/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 02:33:37,293 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 02:33:37,294 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 02:33:37,341 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 02:33:37,341 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 02:33:37,346 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 02:33:37,349 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 02:33:37,354 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 02:33:37,356 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 02:33:37,359 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 02:33:37,360 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 02:33:37,360 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 02:33:37,361 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 02:33:37,362 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 02:33:37,363 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 02:33:37,364 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 02:33:37,364 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 02:33:37,365 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 02:33:37,368 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 02:33:37,370 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 02:33:37,371 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 02:33:37,372 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 02:33:37,373 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 02:33:37,373 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 02:33:37,378 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 02:33:37,379 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 02:33:37,379 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 02:33:37,380 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 02:33:37,380 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 02:33:37,380 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 02:33:37,380 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 02:33:37,381 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 02:33:37,382 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 02:33:37,382 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 02:33:37,383 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 02:33:37,383 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 02:33:37,384 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 02:33:37,384 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 02:33:37,384 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 02:33:37,385 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 02:33:37,385 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 02:33:37,386 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-10 02:33:37,409 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 02:33:37,409 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 02:33:37,409 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 02:33:37,409 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 02:33:37,410 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 02:33:37,410 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 02:33:37,410 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 02:33:37,411 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 02:33:37,411 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 02:33:37,411 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 02:33:37,411 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 02:33:37,412 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 02:33:37,412 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 02:33:37,412 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 02:33:37,412 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 02:33:37,412 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 02:33:37,412 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 02:33:37,412 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 02:33:37,412 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 02:33:37,412 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 02:33:37,412 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 02:33:37,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 02:33:37,413 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 02:33:37,413 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 02:33:37,413 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 02:33:37,413 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 02:33:37,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 02:33:37,414 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 02:33:37,414 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 02:33:37,414 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 02:33:37,414 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 02:33:37,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 02:33:37,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 02:33:37,618 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 02:33:37,618 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 02:33:37,620 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 02:33:37,620 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-1.c [2022-01-10 02:33:37,671 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ab45906a/5ce2d88d78df49208068fac68cf5f87e/FLAG1ccc307e6 [2022-01-10 02:33:38,010 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 02:33:38,010 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-1.c [2022-01-10 02:33:38,019 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ab45906a/5ce2d88d78df49208068fac68cf5f87e/FLAG1ccc307e6 [2022-01-10 02:33:38,426 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ab45906a/5ce2d88d78df49208068fac68cf5f87e [2022-01-10 02:33:38,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 02:33:38,429 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 02:33:38,431 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 02:33:38,431 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 02:33:38,433 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 02:33:38,434 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:33:38" (1/1) ... [2022-01-10 02:33:38,435 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38f406ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:33:38, skipping insertion in model container [2022-01-10 02:33:38,435 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:33:38" (1/1) ... [2022-01-10 02:33:38,440 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 02:33:38,467 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 02:33:38,584 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-1.c[914,927] [2022-01-10 02:33:38,640 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-1.c[7115,7128] [2022-01-10 02:33:38,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 02:33:38,675 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 02:33:38,683 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-1.c[914,927] [2022-01-10 02:33:38,709 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-1.c[7115,7128] [2022-01-10 02:33:38,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 02:33:38,742 INFO L208 MainTranslator]: Completed translation [2022-01-10 02:33:38,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:33:38 WrapperNode [2022-01-10 02:33:38,743 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 02:33:38,760 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 02:33:38,760 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 02:33:38,760 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 02:33:38,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:33:38" (1/1) ... [2022-01-10 02:33:38,780 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:33:38" (1/1) ... [2022-01-10 02:33:38,816 INFO L137 Inliner]: procedures = 59, calls = 67, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 523 [2022-01-10 02:33:38,817 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 02:33:38,817 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 02:33:38,817 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 02:33:38,818 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 02:33:38,828 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:33:38" (1/1) ... [2022-01-10 02:33:38,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:33:38" (1/1) ... [2022-01-10 02:33:38,835 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:33:38" (1/1) ... [2022-01-10 02:33:38,835 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:33:38" (1/1) ... [2022-01-10 02:33:38,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:33:38" (1/1) ... [2022-01-10 02:33:38,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:33:38" (1/1) ... [2022-01-10 02:33:38,857 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:33:38" (1/1) ... [2022-01-10 02:33:38,867 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 02:33:38,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 02:33:38,870 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 02:33:38,870 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 02:33:38,872 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:33:38" (1/1) ... [2022-01-10 02:33:38,877 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 02:33:38,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:33:38,896 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 02:33:38,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 02:33:38,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 02:33:38,936 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-01-10 02:33:38,936 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-01-10 02:33:38,936 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-01-10 02:33:38,936 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-01-10 02:33:38,936 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-01-10 02:33:38,936 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-01-10 02:33:38,936 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-01-10 02:33:38,937 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-01-10 02:33:38,937 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-01-10 02:33:38,937 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-01-10 02:33:38,937 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-01-10 02:33:38,937 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-01-10 02:33:38,937 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-01-10 02:33:38,937 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-01-10 02:33:38,937 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-01-10 02:33:38,937 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-01-10 02:33:38,937 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-01-10 02:33:38,937 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-01-10 02:33:38,938 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-01-10 02:33:38,938 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-01-10 02:33:38,938 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-01-10 02:33:38,938 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-01-10 02:33:38,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 02:33:38,938 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-01-10 02:33:38,938 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-01-10 02:33:38,938 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-01-10 02:33:38,938 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-01-10 02:33:38,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 02:33:38,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 02:33:38,938 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-01-10 02:33:38,939 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-01-10 02:33:38,939 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-01-10 02:33:38,939 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-01-10 02:33:39,046 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 02:33:39,047 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 02:33:39,456 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 02:33:39,463 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 02:33:39,463 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2022-01-10 02:33:39,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:33:39 BoogieIcfgContainer [2022-01-10 02:33:39,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 02:33:39,466 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 02:33:39,466 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 02:33:39,468 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 02:33:39,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:33:38" (1/3) ... [2022-01-10 02:33:39,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c525d86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:33:39, skipping insertion in model container [2022-01-10 02:33:39,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:33:38" (2/3) ... [2022-01-10 02:33:39,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c525d86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:33:39, skipping insertion in model container [2022-01-10 02:33:39,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:33:39" (3/3) ... [2022-01-10 02:33:39,470 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.03.cil-1.c [2022-01-10 02:33:39,474 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 02:33:39,474 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-10 02:33:39,518 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 02:33:39,522 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 02:33:39,523 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-01-10 02:33:39,540 INFO L276 IsEmpty]: Start isEmpty. Operand has 266 states, 215 states have (on average 1.5813953488372092) internal successors, (340), 223 states have internal predecessors, (340), 33 states have call successors, (33), 15 states have call predecessors, (33), 15 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2022-01-10 02:33:39,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:33:39,554 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:33:39,555 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:33:39,555 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:33:39,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:33:39,563 INFO L85 PathProgramCache]: Analyzing trace with hash 207768249, now seen corresponding path program 1 times [2022-01-10 02:33:39,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:33:39,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441403408] [2022-01-10 02:33:39,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:39,570 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:33:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:39,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:33:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:39,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:33:39,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:39,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:33:39,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:39,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:33:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:39,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:33:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:39,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:33:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:39,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:33:39,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:39,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:33:39,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:33:39,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441403408] [2022-01-10 02:33:39,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441403408] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:33:39,934 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:33:39,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 02:33:39,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887311582] [2022-01-10 02:33:39,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:33:39,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:33:39,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:33:39,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:33:39,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:33:39,971 INFO L87 Difference]: Start difference. First operand has 266 states, 215 states have (on average 1.5813953488372092) internal successors, (340), 223 states have internal predecessors, (340), 33 states have call successors, (33), 15 states have call predecessors, (33), 15 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 02:33:40,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:33:40,659 INFO L93 Difference]: Finished difference Result 647 states and 988 transitions. [2022-01-10 02:33:40,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:33:40,661 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-01-10 02:33:40,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:33:40,686 INFO L225 Difference]: With dead ends: 647 [2022-01-10 02:33:40,687 INFO L226 Difference]: Without dead ends: 390 [2022-01-10 02:33:40,690 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-01-10 02:33:40,692 INFO L933 BasicCegarLoop]: 383 mSDtfsCounter, 668 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 02:33:40,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [673 Valid, 1101 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 02:33:40,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-01-10 02:33:40,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 351. [2022-01-10 02:33:40,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 283 states have (on average 1.459363957597173) internal successors, (413), 290 states have internal predecessors, (413), 44 states have call successors, (44), 22 states have call predecessors, (44), 22 states have return successors, (45), 41 states have call predecessors, (45), 40 states have call successors, (45) [2022-01-10 02:33:40,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 502 transitions. [2022-01-10 02:33:40,771 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 502 transitions. Word has length 65 [2022-01-10 02:33:40,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:33:40,772 INFO L470 AbstractCegarLoop]: Abstraction has 351 states and 502 transitions. [2022-01-10 02:33:40,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 02:33:40,772 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 502 transitions. [2022-01-10 02:33:40,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:33:40,775 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:33:40,775 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:33:40,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 02:33:40,776 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:33:40,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:33:40,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1886656889, now seen corresponding path program 1 times [2022-01-10 02:33:40,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:33:40,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068032367] [2022-01-10 02:33:40,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:40,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:33:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:40,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:33:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:40,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:33:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:40,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:33:40,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:40,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:33:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:40,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:33:40,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:40,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:33:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:40,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:33:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:40,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:33:40,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:33:40,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068032367] [2022-01-10 02:33:40,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068032367] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:33:40,873 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:33:40,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 02:33:40,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143029618] [2022-01-10 02:33:40,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:33:40,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:33:40,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:33:40,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:33:40,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:33:40,878 INFO L87 Difference]: Start difference. First operand 351 states and 502 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 02:33:41,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:33:41,558 INFO L93 Difference]: Finished difference Result 698 states and 979 transitions. [2022-01-10 02:33:41,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 02:33:41,558 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-01-10 02:33:41,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:33:41,567 INFO L225 Difference]: With dead ends: 698 [2022-01-10 02:33:41,567 INFO L226 Difference]: Without dead ends: 521 [2022-01-10 02:33:41,571 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-01-10 02:33:41,571 INFO L933 BasicCegarLoop]: 439 mSDtfsCounter, 697 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 1001 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 1541 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 02:33:41,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [718 Valid, 1541 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1001 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 02:33:41,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2022-01-10 02:33:41,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 447. [2022-01-10 02:33:41,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 359 states have (on average 1.4401114206128134) internal successors, (517), 368 states have internal predecessors, (517), 55 states have call successors, (55), 29 states have call predecessors, (55), 31 states have return successors, (64), 53 states have call predecessors, (64), 51 states have call successors, (64) [2022-01-10 02:33:41,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 636 transitions. [2022-01-10 02:33:41,619 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 636 transitions. Word has length 65 [2022-01-10 02:33:41,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:33:41,619 INFO L470 AbstractCegarLoop]: Abstraction has 447 states and 636 transitions. [2022-01-10 02:33:41,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 02:33:41,620 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 636 transitions. [2022-01-10 02:33:41,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:33:41,627 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:33:41,627 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:33:41,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 02:33:41,627 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:33:41,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:33:41,628 INFO L85 PathProgramCache]: Analyzing trace with hash -141929221, now seen corresponding path program 1 times [2022-01-10 02:33:41,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:33:41,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939625816] [2022-01-10 02:33:41,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:41,628 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:33:41,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:41,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:33:41,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:41,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:33:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:41,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:33:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:41,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:33:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:41,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:33:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:41,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:33:41,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:41,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:33:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:41,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:33:41,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:33:41,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939625816] [2022-01-10 02:33:41,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939625816] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:33:41,795 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:33:41,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 02:33:41,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376086808] [2022-01-10 02:33:41,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:33:41,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 02:33:41,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:33:41,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 02:33:41,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:33:41,797 INFO L87 Difference]: Start difference. First operand 447 states and 636 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:33:42,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:33:42,306 INFO L93 Difference]: Finished difference Result 748 states and 1050 transitions. [2022-01-10 02:33:42,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 02:33:42,306 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-01-10 02:33:42,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:33:42,309 INFO L225 Difference]: With dead ends: 748 [2022-01-10 02:33:42,310 INFO L226 Difference]: Without dead ends: 481 [2022-01-10 02:33:42,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:33:42,315 INFO L933 BasicCegarLoop]: 358 mSDtfsCounter, 292 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 1635 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:33:42,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [293 Valid, 1635 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 02:33:42,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-01-10 02:33:42,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 452. [2022-01-10 02:33:42,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 363 states have (on average 1.4297520661157024) internal successors, (519), 372 states have internal predecessors, (519), 55 states have call successors, (55), 29 states have call predecessors, (55), 32 states have return successors, (65), 54 states have call predecessors, (65), 51 states have call successors, (65) [2022-01-10 02:33:42,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 639 transitions. [2022-01-10 02:33:42,352 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 639 transitions. Word has length 65 [2022-01-10 02:33:42,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:33:42,352 INFO L470 AbstractCegarLoop]: Abstraction has 452 states and 639 transitions. [2022-01-10 02:33:42,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:33:42,353 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 639 transitions. [2022-01-10 02:33:42,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:33:42,354 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:33:42,355 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:33:42,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 02:33:42,355 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:33:42,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:33:42,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1171288519, now seen corresponding path program 1 times [2022-01-10 02:33:42,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:33:42,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996919464] [2022-01-10 02:33:42,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:42,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:33:42,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:42,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:33:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:42,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:33:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:42,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:33:42,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:42,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:33:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:42,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:33:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:42,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:33:42,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:42,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:33:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:42,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:33:42,460 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:33:42,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996919464] [2022-01-10 02:33:42,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996919464] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:33:42,460 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:33:42,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 02:33:42,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622824533] [2022-01-10 02:33:42,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:33:42,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 02:33:42,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:33:42,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 02:33:42,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:33:42,461 INFO L87 Difference]: Start difference. First operand 452 states and 639 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:33:43,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:33:43,021 INFO L93 Difference]: Finished difference Result 770 states and 1072 transitions. [2022-01-10 02:33:43,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 02:33:43,021 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-01-10 02:33:43,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:33:43,023 INFO L225 Difference]: With dead ends: 770 [2022-01-10 02:33:43,023 INFO L226 Difference]: Without dead ends: 498 [2022-01-10 02:33:43,024 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-01-10 02:33:43,024 INFO L933 BasicCegarLoop]: 355 mSDtfsCounter, 432 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 1468 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:33:43,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [434 Valid, 1468 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 02:33:43,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2022-01-10 02:33:43,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 467. [2022-01-10 02:33:43,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 375 states have (on average 1.416) internal successors, (531), 384 states have internal predecessors, (531), 55 states have call successors, (55), 29 states have call predecessors, (55), 35 states have return successors, (68), 57 states have call predecessors, (68), 51 states have call successors, (68) [2022-01-10 02:33:43,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 654 transitions. [2022-01-10 02:33:43,038 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 654 transitions. Word has length 65 [2022-01-10 02:33:43,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:33:43,039 INFO L470 AbstractCegarLoop]: Abstraction has 467 states and 654 transitions. [2022-01-10 02:33:43,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:33:43,039 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 654 transitions. [2022-01-10 02:33:43,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:33:43,040 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:33:43,040 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:33:43,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 02:33:43,040 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:33:43,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:33:43,040 INFO L85 PathProgramCache]: Analyzing trace with hash 214914875, now seen corresponding path program 1 times [2022-01-10 02:33:43,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:33:43,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387347226] [2022-01-10 02:33:43,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:43,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:33:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:43,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:33:43,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:43,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:33:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:43,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:33:43,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:43,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:33:43,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:43,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:33:43,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:43,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:33:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:43,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:33:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:43,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:33:43,114 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:33:43,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387347226] [2022-01-10 02:33:43,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387347226] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:33:43,115 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:33:43,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 02:33:43,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561434224] [2022-01-10 02:33:43,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:33:43,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:33:43,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:33:43,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:33:43,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:33:43,116 INFO L87 Difference]: Start difference. First operand 467 states and 654 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 02:33:43,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:33:43,798 INFO L93 Difference]: Finished difference Result 859 states and 1165 transitions. [2022-01-10 02:33:43,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 02:33:43,799 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-01-10 02:33:43,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:33:43,801 INFO L225 Difference]: With dead ends: 859 [2022-01-10 02:33:43,801 INFO L226 Difference]: Without dead ends: 574 [2022-01-10 02:33:43,802 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-01-10 02:33:43,803 INFO L933 BasicCegarLoop]: 385 mSDtfsCounter, 887 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 02:33:43,803 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [908 Valid, 1135 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 02:33:43,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2022-01-10 02:33:43,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 479. [2022-01-10 02:33:43,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 385 states have (on average 1.405194805194805) internal successors, (541), 394 states have internal predecessors, (541), 56 states have call successors, (56), 30 states have call predecessors, (56), 36 states have return successors, (67), 58 states have call predecessors, (67), 52 states have call successors, (67) [2022-01-10 02:33:43,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 664 transitions. [2022-01-10 02:33:43,820 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 664 transitions. Word has length 65 [2022-01-10 02:33:43,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:33:43,820 INFO L470 AbstractCegarLoop]: Abstraction has 479 states and 664 transitions. [2022-01-10 02:33:43,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 02:33:43,820 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 664 transitions. [2022-01-10 02:33:43,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:33:43,821 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:33:43,821 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:33:43,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 02:33:43,821 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:33:43,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:33:43,822 INFO L85 PathProgramCache]: Analyzing trace with hash 80901369, now seen corresponding path program 1 times [2022-01-10 02:33:43,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:33:43,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605995504] [2022-01-10 02:33:43,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:43,822 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:33:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:43,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:33:43,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:43,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:33:43,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:43,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:33:43,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:43,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:33:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:43,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:33:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:43,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:33:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:43,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:33:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:43,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:33:43,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:33:43,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605995504] [2022-01-10 02:33:43,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605995504] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:33:43,891 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:33:43,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:33:43,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904114028] [2022-01-10 02:33:43,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:33:43,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:33:43,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:33:43,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:33:43,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:33:43,892 INFO L87 Difference]: Start difference. First operand 479 states and 664 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 02:33:44,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:33:44,179 INFO L93 Difference]: Finished difference Result 1121 states and 1511 transitions. [2022-01-10 02:33:44,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 02:33:44,180 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-01-10 02:33:44,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:33:44,183 INFO L225 Difference]: With dead ends: 1121 [2022-01-10 02:33:44,183 INFO L226 Difference]: Without dead ends: 825 [2022-01-10 02:33:44,184 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-01-10 02:33:44,184 INFO L933 BasicCegarLoop]: 345 mSDtfsCounter, 1050 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1074 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 02:33:44,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1074 Valid, 730 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 02:33:44,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2022-01-10 02:33:44,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 769. [2022-01-10 02:33:44,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 609 states have (on average 1.3596059113300492) internal successors, (828), 625 states have internal predecessors, (828), 91 states have call successors, (91), 52 states have call predecessors, (91), 67 states have return successors, (124), 98 states have call predecessors, (124), 87 states have call successors, (124) [2022-01-10 02:33:44,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1043 transitions. [2022-01-10 02:33:44,209 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1043 transitions. Word has length 65 [2022-01-10 02:33:44,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:33:44,209 INFO L470 AbstractCegarLoop]: Abstraction has 769 states and 1043 transitions. [2022-01-10 02:33:44,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 02:33:44,210 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1043 transitions. [2022-01-10 02:33:44,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-10 02:33:44,211 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:33:44,211 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:33:44,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 02:33:44,211 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:33:44,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:33:44,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1103860140, now seen corresponding path program 1 times [2022-01-10 02:33:44,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:33:44,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452599688] [2022-01-10 02:33:44,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:44,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:33:44,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:44,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:33:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:44,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:33:44,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:44,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:33:44,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:44,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:33:44,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:44,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:33:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:44,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:33:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:44,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:33:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:44,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:33:44,294 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:33:44,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452599688] [2022-01-10 02:33:44,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452599688] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:33:44,294 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:33:44,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 02:33:44,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030278182] [2022-01-10 02:33:44,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:33:44,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:33:44,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:33:44,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:33:44,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:33:44,296 INFO L87 Difference]: Start difference. First operand 769 states and 1043 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:33:44,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:33:44,634 INFO L93 Difference]: Finished difference Result 1972 states and 2614 transitions. [2022-01-10 02:33:44,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 02:33:44,634 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-01-10 02:33:44,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:33:44,639 INFO L225 Difference]: With dead ends: 1972 [2022-01-10 02:33:44,639 INFO L226 Difference]: Without dead ends: 1365 [2022-01-10 02:33:44,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:33:44,641 INFO L933 BasicCegarLoop]: 359 mSDtfsCounter, 653 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 02:33:44,641 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [661 Valid, 849 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 02:33:44,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2022-01-10 02:33:44,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1250. [2022-01-10 02:33:44,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 988 states have (on average 1.3248987854251013) internal successors, (1309), 1007 states have internal predecessors, (1309), 136 states have call successors, (136), 96 states have call predecessors, (136), 124 states have return successors, (196), 153 states have call predecessors, (196), 132 states have call successors, (196) [2022-01-10 02:33:44,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1641 transitions. [2022-01-10 02:33:44,676 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1641 transitions. Word has length 66 [2022-01-10 02:33:44,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:33:44,676 INFO L470 AbstractCegarLoop]: Abstraction has 1250 states and 1641 transitions. [2022-01-10 02:33:44,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:33:44,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1641 transitions. [2022-01-10 02:33:44,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-10 02:33:44,678 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:33:44,678 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:33:44,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 02:33:44,678 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:33:44,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:33:44,679 INFO L85 PathProgramCache]: Analyzing trace with hash 354379519, now seen corresponding path program 1 times [2022-01-10 02:33:44,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:33:44,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735578334] [2022-01-10 02:33:44,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:44,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:33:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:44,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:33:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:44,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:33:44,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:44,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:33:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:44,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:33:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:44,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:33:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:44,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:33:44,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:44,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:33:44,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:44,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:33:44,727 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:33:44,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735578334] [2022-01-10 02:33:44,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735578334] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:33:44,727 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:33:44,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 02:33:44,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277423143] [2022-01-10 02:33:44,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:33:44,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:33:44,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:33:44,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:33:44,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:33:44,728 INFO L87 Difference]: Start difference. First operand 1250 states and 1641 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:33:45,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:33:45,015 INFO L93 Difference]: Finished difference Result 3438 states and 4447 transitions. [2022-01-10 02:33:45,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 02:33:45,015 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-01-10 02:33:45,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:33:45,023 INFO L225 Difference]: With dead ends: 3438 [2022-01-10 02:33:45,023 INFO L226 Difference]: Without dead ends: 2370 [2022-01-10 02:33:45,025 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-01-10 02:33:45,025 INFO L933 BasicCegarLoop]: 360 mSDtfsCounter, 873 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 02:33:45,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [897 Valid, 728 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 02:33:45,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2370 states. [2022-01-10 02:33:45,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2370 to 2112. [2022-01-10 02:33:45,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2112 states, 1654 states have (on average 1.2914147521160821) internal successors, (2136), 1683 states have internal predecessors, (2136), 234 states have call successors, (234), 180 states have call predecessors, (234), 222 states have return successors, (332), 255 states have call predecessors, (332), 230 states have call successors, (332) [2022-01-10 02:33:45,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2112 states to 2112 states and 2702 transitions. [2022-01-10 02:33:45,129 INFO L78 Accepts]: Start accepts. Automaton has 2112 states and 2702 transitions. Word has length 66 [2022-01-10 02:33:45,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:33:45,129 INFO L470 AbstractCegarLoop]: Abstraction has 2112 states and 2702 transitions. [2022-01-10 02:33:45,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:33:45,130 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 2702 transitions. [2022-01-10 02:33:45,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-10 02:33:45,131 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:33:45,131 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:33:45,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 02:33:45,132 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:33:45,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:33:45,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1353227277, now seen corresponding path program 1 times [2022-01-10 02:33:45,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:33:45,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644733217] [2022-01-10 02:33:45,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:45,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:33:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:45,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:33:45,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:45,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:33:45,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:45,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:33:45,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:45,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:33:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:45,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:33:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:45,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:33:45,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:45,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:33:45,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:45,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:33:45,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:33:45,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644733217] [2022-01-10 02:33:45,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644733217] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:33:45,183 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:33:45,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 02:33:45,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708245956] [2022-01-10 02:33:45,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:33:45,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:33:45,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:33:45,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:33:45,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:33:45,184 INFO L87 Difference]: Start difference. First operand 2112 states and 2702 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:33:45,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:33:45,471 INFO L93 Difference]: Finished difference Result 5022 states and 6352 transitions. [2022-01-10 02:33:45,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 02:33:45,472 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2022-01-10 02:33:45,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:33:45,482 INFO L225 Difference]: With dead ends: 5022 [2022-01-10 02:33:45,482 INFO L226 Difference]: Without dead ends: 3092 [2022-01-10 02:33:45,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:33:45,487 INFO L933 BasicCegarLoop]: 374 mSDtfsCounter, 854 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 02:33:45,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [878 Valid, 764 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 02:33:45,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3092 states. [2022-01-10 02:33:45,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3092 to 2844. [2022-01-10 02:33:45,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2844 states, 2222 states have (on average 1.278127812781278) internal successors, (2840), 2259 states have internal predecessors, (2840), 314 states have call successors, (314), 250 states have call predecessors, (314), 306 states have return successors, (441), 341 states have call predecessors, (441), 310 states have call successors, (441) [2022-01-10 02:33:45,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2844 states to 2844 states and 3595 transitions. [2022-01-10 02:33:45,577 INFO L78 Accepts]: Start accepts. Automaton has 2844 states and 3595 transitions. Word has length 72 [2022-01-10 02:33:45,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:33:45,577 INFO L470 AbstractCegarLoop]: Abstraction has 2844 states and 3595 transitions. [2022-01-10 02:33:45,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:33:45,577 INFO L276 IsEmpty]: Start isEmpty. Operand 2844 states and 3595 transitions. [2022-01-10 02:33:45,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-10 02:33:45,579 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:33:45,579 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:33:45,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 02:33:45,579 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:33:45,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:33:45,579 INFO L85 PathProgramCache]: Analyzing trace with hash 483330199, now seen corresponding path program 1 times [2022-01-10 02:33:45,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:33:45,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383878010] [2022-01-10 02:33:45,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:45,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:33:45,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:45,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:33:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:45,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:33:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:45,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:33:45,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:45,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:33:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:45,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:33:45,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:45,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:33:45,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:45,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:33:45,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:45,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:33:45,649 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:33:45,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383878010] [2022-01-10 02:33:45,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383878010] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:33:45,649 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:33:45,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:33:45,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885859517] [2022-01-10 02:33:45,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:33:45,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:33:45,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:33:45,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:33:45,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:33:45,650 INFO L87 Difference]: Start difference. First operand 2844 states and 3595 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-10 02:33:46,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:33:46,006 INFO L93 Difference]: Finished difference Result 3618 states and 4526 transitions. [2022-01-10 02:33:46,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 02:33:46,007 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2022-01-10 02:33:46,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:33:46,019 INFO L225 Difference]: With dead ends: 3618 [2022-01-10 02:33:46,020 INFO L226 Difference]: Without dead ends: 3615 [2022-01-10 02:33:46,021 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-01-10 02:33:46,021 INFO L933 BasicCegarLoop]: 369 mSDtfsCounter, 1225 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1235 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 02:33:46,022 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1235 Valid, 742 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 02:33:46,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3615 states. [2022-01-10 02:33:46,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3615 to 3338. [2022-01-10 02:33:46,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3338 states, 2607 states have (on average 1.2704257767548908) internal successors, (3312), 2649 states have internal predecessors, (3312), 364 states have call successors, (364), 294 states have call predecessors, (364), 365 states have return successors, (520), 401 states have call predecessors, (520), 361 states have call successors, (520) [2022-01-10 02:33:46,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3338 states to 3338 states and 4196 transitions. [2022-01-10 02:33:46,127 INFO L78 Accepts]: Start accepts. Automaton has 3338 states and 4196 transitions. Word has length 73 [2022-01-10 02:33:46,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:33:46,127 INFO L470 AbstractCegarLoop]: Abstraction has 3338 states and 4196 transitions. [2022-01-10 02:33:46,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-10 02:33:46,127 INFO L276 IsEmpty]: Start isEmpty. Operand 3338 states and 4196 transitions. [2022-01-10 02:33:46,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-01-10 02:33:46,128 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:33:46,128 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:33:46,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 02:33:46,129 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:33:46,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:33:46,129 INFO L85 PathProgramCache]: Analyzing trace with hash 2097533117, now seen corresponding path program 1 times [2022-01-10 02:33:46,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:33:46,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401169580] [2022-01-10 02:33:46,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:46,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:33:46,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:46,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:33:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:46,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:33:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:46,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:33:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:46,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:33:46,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:46,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:33:46,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:46,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:33:46,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:46,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:33:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:46,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:33:46,223 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:33:46,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401169580] [2022-01-10 02:33:46,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401169580] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 02:33:46,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974916013] [2022-01-10 02:33:46,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:46,223 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:33:46,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:33:46,224 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 02:33:46,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 02:33:46,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:46,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-10 02:33:46,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:33:46,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:33:46,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:33:46,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:33:46,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974916013] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:33:46,879 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 02:33:46,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2022-01-10 02:33:46,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775212406] [2022-01-10 02:33:46,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 02:33:46,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 02:33:46,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:33:46,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 02:33:46,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-01-10 02:33:46,881 INFO L87 Difference]: Start difference. First operand 3338 states and 4196 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-01-10 02:33:48,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:33:48,030 INFO L93 Difference]: Finished difference Result 7779 states and 9682 transitions. [2022-01-10 02:33:48,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-10 02:33:48,030 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2022-01-10 02:33:48,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:33:48,056 INFO L225 Difference]: With dead ends: 7779 [2022-01-10 02:33:48,056 INFO L226 Difference]: Without dead ends: 7776 [2022-01-10 02:33:48,058 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2022-01-10 02:33:48,059 INFO L933 BasicCegarLoop]: 527 mSDtfsCounter, 1443 mSDsluCounter, 1170 mSDsCounter, 0 mSdLazyCounter, 1449 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 1733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 1449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 02:33:48,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1506 Valid, 1697 Invalid, 1733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 1449 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 02:33:48,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7776 states. [2022-01-10 02:33:48,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7776 to 5128. [2022-01-10 02:33:48,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5128 states, 4011 states have (on average 1.268511593118923) internal successors, (5088), 4075 states have internal predecessors, (5088), 548 states have call successors, (548), 452 states have call predecessors, (548), 567 states have return successors, (798), 607 states have call predecessors, (798), 545 states have call successors, (798) [2022-01-10 02:33:48,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5128 states to 5128 states and 6434 transitions. [2022-01-10 02:33:48,283 INFO L78 Accepts]: Start accepts. Automaton has 5128 states and 6434 transitions. Word has length 74 [2022-01-10 02:33:48,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:33:48,283 INFO L470 AbstractCegarLoop]: Abstraction has 5128 states and 6434 transitions. [2022-01-10 02:33:48,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-01-10 02:33:48,284 INFO L276 IsEmpty]: Start isEmpty. Operand 5128 states and 6434 transitions. [2022-01-10 02:33:48,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-01-10 02:33:48,285 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:33:48,285 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:33:48,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 02:33:48,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-01-10 02:33:48,503 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:33:48,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:33:48,503 INFO L85 PathProgramCache]: Analyzing trace with hash -863953769, now seen corresponding path program 2 times [2022-01-10 02:33:48,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:33:48,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470063626] [2022-01-10 02:33:48,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:48,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:33:48,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:48,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:33:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:48,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:33:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:48,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:33:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:48,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:33:48,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:48,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:33:48,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:48,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:33:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:48,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:33:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:48,547 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:33:48,548 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:33:48,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470063626] [2022-01-10 02:33:48,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470063626] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:33:48,548 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:33:48,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 02:33:48,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298413915] [2022-01-10 02:33:48,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:33:48,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:33:48,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:33:48,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:33:48,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:33:48,549 INFO L87 Difference]: Start difference. First operand 5128 states and 6434 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-10 02:33:48,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:33:48,962 INFO L93 Difference]: Finished difference Result 7810 states and 9807 transitions. [2022-01-10 02:33:48,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 02:33:48,962 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 77 [2022-01-10 02:33:48,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:33:48,979 INFO L225 Difference]: With dead ends: 7810 [2022-01-10 02:33:48,979 INFO L226 Difference]: Without dead ends: 3735 [2022-01-10 02:33:48,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-01-10 02:33:48,988 INFO L933 BasicCegarLoop]: 419 mSDtfsCounter, 741 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 02:33:48,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [768 Valid, 849 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 02:33:48,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3735 states. [2022-01-10 02:33:49,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3735 to 3500. [2022-01-10 02:33:49,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3500 states, 2739 states have (on average 1.2515516611902153) internal successors, (3428), 2781 states have internal predecessors, (3428), 380 states have call successors, (380), 308 states have call predecessors, (380), 379 states have return successors, (524), 417 states have call predecessors, (524), 377 states have call successors, (524) [2022-01-10 02:33:49,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3500 states to 3500 states and 4332 transitions. [2022-01-10 02:33:49,137 INFO L78 Accepts]: Start accepts. Automaton has 3500 states and 4332 transitions. Word has length 77 [2022-01-10 02:33:49,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:33:49,138 INFO L470 AbstractCegarLoop]: Abstraction has 3500 states and 4332 transitions. [2022-01-10 02:33:49,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-10 02:33:49,138 INFO L276 IsEmpty]: Start isEmpty. Operand 3500 states and 4332 transitions. [2022-01-10 02:33:49,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-10 02:33:49,140 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:33:49,140 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:33:49,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 02:33:49,140 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:33:49,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:33:49,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1029310995, now seen corresponding path program 1 times [2022-01-10 02:33:49,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:33:49,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297626540] [2022-01-10 02:33:49,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:49,141 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:33:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:49,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:33:49,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:49,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-10 02:33:49,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:49,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-01-10 02:33:49,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:49,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 02:33:49,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:49,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-10 02:33:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:49,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:33:49,195 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:33:49,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297626540] [2022-01-10 02:33:49,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297626540] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:33:49,196 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:33:49,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 02:33:49,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941438207] [2022-01-10 02:33:49,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:33:49,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:33:49,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:33:49,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:33:49,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:33:49,197 INFO L87 Difference]: Start difference. First operand 3500 states and 4332 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:33:50,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:33:50,019 INFO L93 Difference]: Finished difference Result 3882 states and 4923 transitions. [2022-01-10 02:33:50,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 02:33:50,019 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2022-01-10 02:33:50,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:33:50,039 INFO L225 Difference]: With dead ends: 3882 [2022-01-10 02:33:50,039 INFO L226 Difference]: Without dead ends: 3734 [2022-01-10 02:33:50,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:33:50,042 INFO L933 BasicCegarLoop]: 389 mSDtfsCounter, 752 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 02:33:50,042 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [772 Valid, 968 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 02:33:50,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3734 states. [2022-01-10 02:33:50,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3734 to 3647. [2022-01-10 02:33:50,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3647 states, 2867 states have (on average 1.264387861876526) internal successors, (3625), 2910 states have internal predecessors, (3625), 392 states have call successors, (392), 314 states have call predecessors, (392), 386 states have return successors, (539), 429 states have call predecessors, (539), 389 states have call successors, (539) [2022-01-10 02:33:50,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3647 states to 3647 states and 4556 transitions. [2022-01-10 02:33:50,194 INFO L78 Accepts]: Start accepts. Automaton has 3647 states and 4556 transitions. Word has length 80 [2022-01-10 02:33:50,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:33:50,195 INFO L470 AbstractCegarLoop]: Abstraction has 3647 states and 4556 transitions. [2022-01-10 02:33:50,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:33:50,195 INFO L276 IsEmpty]: Start isEmpty. Operand 3647 states and 4556 transitions. [2022-01-10 02:33:50,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-10 02:33:50,199 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:33:50,199 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:33:50,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 02:33:50,199 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:33:50,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:33:50,200 INFO L85 PathProgramCache]: Analyzing trace with hash -212129521, now seen corresponding path program 1 times [2022-01-10 02:33:50,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:33:50,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859239554] [2022-01-10 02:33:50,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:50,200 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:33:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:50,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:33:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:50,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-10 02:33:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:50,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-01-10 02:33:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:50,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 02:33:50,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:50,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-10 02:33:50,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:50,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:33:50,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:33:50,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859239554] [2022-01-10 02:33:50,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859239554] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:33:50,263 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:33:50,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:33:50,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549463970] [2022-01-10 02:33:50,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:33:50,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:33:50,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:33:50,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:33:50,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:33:50,265 INFO L87 Difference]: Start difference. First operand 3647 states and 4556 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:33:51,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:33:51,242 INFO L93 Difference]: Finished difference Result 4220 states and 5436 transitions. [2022-01-10 02:33:51,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:33:51,243 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2022-01-10 02:33:51,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:33:51,255 INFO L225 Difference]: With dead ends: 4220 [2022-01-10 02:33:51,255 INFO L226 Difference]: Without dead ends: 3925 [2022-01-10 02:33:51,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:33:51,257 INFO L933 BasicCegarLoop]: 504 mSDtfsCounter, 743 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 1526 SdHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 02:33:51,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [763 Valid, 1526 Invalid, 1382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1287 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 02:33:51,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3925 states. [2022-01-10 02:33:51,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3925 to 3785. [2022-01-10 02:33:51,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3785 states, 2986 states have (on average 1.2739450770261218) internal successors, (3804), 3030 states have internal predecessors, (3804), 404 states have call successors, (404), 320 states have call predecessors, (404), 393 states have return successors, (553), 442 states have call predecessors, (553), 401 states have call successors, (553) [2022-01-10 02:33:51,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3785 states to 3785 states and 4761 transitions. [2022-01-10 02:33:51,431 INFO L78 Accepts]: Start accepts. Automaton has 3785 states and 4761 transitions. Word has length 80 [2022-01-10 02:33:51,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:33:51,431 INFO L470 AbstractCegarLoop]: Abstraction has 3785 states and 4761 transitions. [2022-01-10 02:33:51,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:33:51,431 INFO L276 IsEmpty]: Start isEmpty. Operand 3785 states and 4761 transitions. [2022-01-10 02:33:51,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-10 02:33:51,433 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:33:51,433 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:33:51,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 02:33:51,434 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:33:51,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:33:51,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1898309359, now seen corresponding path program 1 times [2022-01-10 02:33:51,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:33:51,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387123428] [2022-01-10 02:33:51,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:51,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:33:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:51,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:33:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:51,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-10 02:33:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:51,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-01-10 02:33:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:51,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 02:33:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:51,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-10 02:33:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:51,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:33:51,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:33:51,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387123428] [2022-01-10 02:33:51,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387123428] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:33:51,493 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:33:51,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:33:51,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954743402] [2022-01-10 02:33:51,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:33:51,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:33:51,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:33:51,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:33:51,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:33:51,495 INFO L87 Difference]: Start difference. First operand 3785 states and 4761 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:33:52,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:33:52,466 INFO L93 Difference]: Finished difference Result 4717 states and 6189 transitions. [2022-01-10 02:33:52,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:33:52,466 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2022-01-10 02:33:52,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:33:52,477 INFO L225 Difference]: With dead ends: 4717 [2022-01-10 02:33:52,477 INFO L226 Difference]: Without dead ends: 4284 [2022-01-10 02:33:52,479 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:33:52,480 INFO L933 BasicCegarLoop]: 496 mSDtfsCounter, 740 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 1289 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 1518 SdHoareTripleChecker+Invalid, 1387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 02:33:52,480 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [760 Valid, 1518 Invalid, 1387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1289 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 02:33:52,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4284 states. [2022-01-10 02:33:52,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4284 to 4062. [2022-01-10 02:33:52,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4062 states, 3225 states have (on average 1.2908527131782945) internal successors, (4163), 3271 states have internal predecessors, (4163), 428 states have call successors, (428), 332 states have call predecessors, (428), 407 states have return successors, (585), 468 states have call predecessors, (585), 425 states have call successors, (585) [2022-01-10 02:33:52,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 5176 transitions. [2022-01-10 02:33:52,641 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 5176 transitions. Word has length 80 [2022-01-10 02:33:52,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:33:52,641 INFO L470 AbstractCegarLoop]: Abstraction has 4062 states and 5176 transitions. [2022-01-10 02:33:52,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:33:52,641 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 5176 transitions. [2022-01-10 02:33:52,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-10 02:33:52,643 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:33:52,644 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:33:52,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 02:33:52,644 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:33:52,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:33:52,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1952702257, now seen corresponding path program 1 times [2022-01-10 02:33:52,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:33:52,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947611533] [2022-01-10 02:33:52,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:52,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:33:52,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:52,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:33:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:52,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-10 02:33:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:52,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-01-10 02:33:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:52,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 02:33:52,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:52,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-10 02:33:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:52,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:33:52,700 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:33:52,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947611533] [2022-01-10 02:33:52,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947611533] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:33:52,700 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:33:52,700 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:33:52,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489537959] [2022-01-10 02:33:52,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:33:52,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:33:52,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:33:52,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:33:52,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:33:52,701 INFO L87 Difference]: Start difference. First operand 4062 states and 5176 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:33:53,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:33:53,343 INFO L93 Difference]: Finished difference Result 4982 states and 6595 transitions. [2022-01-10 02:33:53,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:33:53,343 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2022-01-10 02:33:53,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:33:53,355 INFO L225 Difference]: With dead ends: 4982 [2022-01-10 02:33:53,355 INFO L226 Difference]: Without dead ends: 4272 [2022-01-10 02:33:53,357 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:33:53,358 INFO L933 BasicCegarLoop]: 344 mSDtfsCounter, 613 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:33:53,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [634 Valid, 954 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 02:33:53,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4272 states. [2022-01-10 02:33:53,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4272 to 4062. [2022-01-10 02:33:53,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4062 states, 3225 states have (on average 1.2893023255813953) internal successors, (4158), 3271 states have internal predecessors, (4158), 428 states have call successors, (428), 332 states have call predecessors, (428), 407 states have return successors, (585), 468 states have call predecessors, (585), 425 states have call successors, (585) [2022-01-10 02:33:53,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 5171 transitions. [2022-01-10 02:33:53,521 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 5171 transitions. Word has length 80 [2022-01-10 02:33:53,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:33:53,522 INFO L470 AbstractCegarLoop]: Abstraction has 4062 states and 5171 transitions. [2022-01-10 02:33:53,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:33:53,522 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 5171 transitions. [2022-01-10 02:33:53,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-10 02:33:53,524 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:33:53,524 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:33:53,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 02:33:53,524 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:33:53,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:33:53,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1924868433, now seen corresponding path program 1 times [2022-01-10 02:33:53,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:33:53,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686016596] [2022-01-10 02:33:53,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:53,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:33:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:53,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:33:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:53,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-10 02:33:53,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:53,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-01-10 02:33:53,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:53,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 02:33:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:53,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-10 02:33:53,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:53,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:33:53,575 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:33:53,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686016596] [2022-01-10 02:33:53,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686016596] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:33:53,575 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:33:53,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:33:53,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694000719] [2022-01-10 02:33:53,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:33:53,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:33:53,576 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:33:53,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:33:53,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:33:53,576 INFO L87 Difference]: Start difference. First operand 4062 states and 5171 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:33:54,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:33:54,200 INFO L93 Difference]: Finished difference Result 4976 states and 6569 transitions. [2022-01-10 02:33:54,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:33:54,201 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2022-01-10 02:33:54,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:33:54,214 INFO L225 Difference]: With dead ends: 4976 [2022-01-10 02:33:54,214 INFO L226 Difference]: Without dead ends: 4266 [2022-01-10 02:33:54,216 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:33:54,217 INFO L933 BasicCegarLoop]: 340 mSDtfsCounter, 609 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:33:54,217 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [630 Valid, 948 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 02:33:54,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4266 states. [2022-01-10 02:33:54,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4266 to 4062. [2022-01-10 02:33:54,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4062 states, 3225 states have (on average 1.2877519379844962) internal successors, (4153), 3271 states have internal predecessors, (4153), 428 states have call successors, (428), 332 states have call predecessors, (428), 407 states have return successors, (585), 468 states have call predecessors, (585), 425 states have call successors, (585) [2022-01-10 02:33:54,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 5166 transitions. [2022-01-10 02:33:54,385 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 5166 transitions. Word has length 80 [2022-01-10 02:33:54,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:33:54,385 INFO L470 AbstractCegarLoop]: Abstraction has 4062 states and 5166 transitions. [2022-01-10 02:33:54,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:33:54,385 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 5166 transitions. [2022-01-10 02:33:54,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-10 02:33:54,387 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:33:54,387 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:33:54,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 02:33:54,387 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:33:54,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:33:54,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1690826609, now seen corresponding path program 1 times [2022-01-10 02:33:54,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:33:54,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161188958] [2022-01-10 02:33:54,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:54,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:33:54,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:54,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:33:54,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:54,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-10 02:33:54,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:54,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-01-10 02:33:54,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:54,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 02:33:54,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:54,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-10 02:33:54,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:54,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:33:54,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:33:54,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161188958] [2022-01-10 02:33:54,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161188958] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:33:54,437 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:33:54,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:33:54,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674609139] [2022-01-10 02:33:54,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:33:54,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:33:54,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:33:54,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:33:54,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:33:54,438 INFO L87 Difference]: Start difference. First operand 4062 states and 5166 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:33:55,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:33:55,491 INFO L93 Difference]: Finished difference Result 5819 states and 7800 transitions. [2022-01-10 02:33:55,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 02:33:55,491 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2022-01-10 02:33:55,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:33:55,503 INFO L225 Difference]: With dead ends: 5819 [2022-01-10 02:33:55,504 INFO L226 Difference]: Without dead ends: 5109 [2022-01-10 02:33:55,508 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-01-10 02:33:55,508 INFO L933 BasicCegarLoop]: 390 mSDtfsCounter, 858 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 02:33:55,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [882 Valid, 1157 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 02:33:55,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5109 states. [2022-01-10 02:33:55,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5109 to 4573. [2022-01-10 02:33:55,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4573 states, 3664 states have (on average 1.3081331877729259) internal successors, (4793), 3714 states have internal predecessors, (4793), 472 states have call successors, (472), 356 states have call predecessors, (472), 435 states have return successors, (651), 516 states have call predecessors, (651), 469 states have call successors, (651) [2022-01-10 02:33:55,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4573 states to 4573 states and 5916 transitions. [2022-01-10 02:33:55,735 INFO L78 Accepts]: Start accepts. Automaton has 4573 states and 5916 transitions. Word has length 80 [2022-01-10 02:33:55,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:33:55,735 INFO L470 AbstractCegarLoop]: Abstraction has 4573 states and 5916 transitions. [2022-01-10 02:33:55,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:33:55,735 INFO L276 IsEmpty]: Start isEmpty. Operand 4573 states and 5916 transitions. [2022-01-10 02:33:55,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-10 02:33:55,738 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:33:55,738 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:33:55,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 02:33:55,738 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:33:55,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:33:55,739 INFO L85 PathProgramCache]: Analyzing trace with hash 270748049, now seen corresponding path program 1 times [2022-01-10 02:33:55,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:33:55,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9955631] [2022-01-10 02:33:55,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:55,739 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:33:55,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:55,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:33:55,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:55,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-10 02:33:55,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:55,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-01-10 02:33:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:55,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 02:33:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:55,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-10 02:33:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:55,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:33:55,785 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:33:55,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9955631] [2022-01-10 02:33:55,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9955631] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:33:55,786 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:33:55,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:33:55,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780846029] [2022-01-10 02:33:55,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:33:55,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:33:55,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:33:55,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:33:55,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:33:55,787 INFO L87 Difference]: Start difference. First operand 4573 states and 5916 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:33:56,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:33:56,812 INFO L93 Difference]: Finished difference Result 7514 states and 10302 transitions. [2022-01-10 02:33:56,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 02:33:56,813 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2022-01-10 02:33:56,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:33:56,827 INFO L225 Difference]: With dead ends: 7514 [2022-01-10 02:33:56,827 INFO L226 Difference]: Without dead ends: 6293 [2022-01-10 02:33:56,832 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-01-10 02:33:56,832 INFO L933 BasicCegarLoop]: 469 mSDtfsCounter, 736 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 02:33:56,832 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [760 Valid, 1483 Invalid, 1320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 02:33:56,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6293 states. [2022-01-10 02:33:57,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6293 to 5634. [2022-01-10 02:33:57,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5634 states, 4585 states have (on average 1.3424209378407852) internal successors, (6155), 4643 states have internal predecessors, (6155), 556 states have call successors, (556), 404 states have call predecessors, (556), 491 states have return successors, (797), 608 states have call predecessors, (797), 553 states have call successors, (797) [2022-01-10 02:33:57,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5634 states to 5634 states and 7508 transitions. [2022-01-10 02:33:57,094 INFO L78 Accepts]: Start accepts. Automaton has 5634 states and 7508 transitions. Word has length 80 [2022-01-10 02:33:57,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:33:57,095 INFO L470 AbstractCegarLoop]: Abstraction has 5634 states and 7508 transitions. [2022-01-10 02:33:57,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:33:57,095 INFO L276 IsEmpty]: Start isEmpty. Operand 5634 states and 7508 transitions. [2022-01-10 02:33:57,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-10 02:33:57,098 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:33:57,098 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:33:57,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 02:33:57,098 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:33:57,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:33:57,099 INFO L85 PathProgramCache]: Analyzing trace with hash 831447827, now seen corresponding path program 1 times [2022-01-10 02:33:57,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:33:57,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095460768] [2022-01-10 02:33:57,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:57,099 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:33:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:57,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:33:57,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:57,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-10 02:33:57,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:57,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-01-10 02:33:57,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:57,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 02:33:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:57,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-10 02:33:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:57,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:33:57,158 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:33:57,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095460768] [2022-01-10 02:33:57,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095460768] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:33:57,158 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:33:57,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:33:57,158 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374835046] [2022-01-10 02:33:57,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:33:57,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:33:57,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:33:57,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:33:57,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:33:57,159 INFO L87 Difference]: Start difference. First operand 5634 states and 7508 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:33:58,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:33:58,162 INFO L93 Difference]: Finished difference Result 9406 states and 13156 transitions. [2022-01-10 02:33:58,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 02:33:58,162 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2022-01-10 02:33:58,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:33:58,181 INFO L225 Difference]: With dead ends: 9406 [2022-01-10 02:33:58,181 INFO L226 Difference]: Without dead ends: 7125 [2022-01-10 02:33:58,190 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-01-10 02:33:58,191 INFO L933 BasicCegarLoop]: 357 mSDtfsCounter, 460 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 02:33:58,192 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [460 Valid, 1228 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 02:33:58,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7125 states. [2022-01-10 02:33:58,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7125 to 5685. [2022-01-10 02:33:58,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5685 states, 4636 states have (on average 1.3386540120793788) internal successors, (6206), 4694 states have internal predecessors, (6206), 556 states have call successors, (556), 404 states have call predecessors, (556), 491 states have return successors, (797), 608 states have call predecessors, (797), 553 states have call successors, (797) [2022-01-10 02:33:58,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5685 states to 5685 states and 7559 transitions. [2022-01-10 02:33:58,503 INFO L78 Accepts]: Start accepts. Automaton has 5685 states and 7559 transitions. Word has length 80 [2022-01-10 02:33:58,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:33:58,503 INFO L470 AbstractCegarLoop]: Abstraction has 5685 states and 7559 transitions. [2022-01-10 02:33:58,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:33:58,503 INFO L276 IsEmpty]: Start isEmpty. Operand 5685 states and 7559 transitions. [2022-01-10 02:33:58,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-10 02:33:58,507 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:33:58,507 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:33:58,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 02:33:58,507 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:33:58,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:33:58,508 INFO L85 PathProgramCache]: Analyzing trace with hash 350367569, now seen corresponding path program 1 times [2022-01-10 02:33:58,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:33:58,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601840347] [2022-01-10 02:33:58,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:58,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:33:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:58,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:33:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:58,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-10 02:33:58,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:58,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-01-10 02:33:58,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:58,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 02:33:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:58,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-10 02:33:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:58,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:33:58,575 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:33:58,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601840347] [2022-01-10 02:33:58,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601840347] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:33:58,575 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:33:58,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:33:58,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981655515] [2022-01-10 02:33:58,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:33:58,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:33:58,576 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:33:58,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:33:58,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:33:58,576 INFO L87 Difference]: Start difference. First operand 5685 states and 7559 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:34:00,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:00,386 INFO L93 Difference]: Finished difference Result 13719 states and 19840 transitions. [2022-01-10 02:34:00,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-10 02:34:00,386 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2022-01-10 02:34:00,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:00,427 INFO L225 Difference]: With dead ends: 13719 [2022-01-10 02:34:00,427 INFO L226 Difference]: Without dead ends: 11387 [2022-01-10 02:34:00,438 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-01-10 02:34:00,439 INFO L933 BasicCegarLoop]: 583 mSDtfsCounter, 1539 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 1298 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1562 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 1624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 1298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:00,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1562 Valid, 1325 Invalid, 1624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 1298 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-10 02:34:00,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11387 states. [2022-01-10 02:34:00,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11387 to 10008. [2022-01-10 02:34:01,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10008 states, 8344 states have (on average 1.3851869606903164) internal successors, (11558), 8461 states have internal predecessors, (11558), 929 states have call successors, (929), 614 states have call predecessors, (929), 733 states have return successors, (1452), 954 states have call predecessors, (1452), 926 states have call successors, (1452) [2022-01-10 02:34:01,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10008 states to 10008 states and 13939 transitions. [2022-01-10 02:34:01,023 INFO L78 Accepts]: Start accepts. Automaton has 10008 states and 13939 transitions. Word has length 80 [2022-01-10 02:34:01,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:01,023 INFO L470 AbstractCegarLoop]: Abstraction has 10008 states and 13939 transitions. [2022-01-10 02:34:01,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:34:01,024 INFO L276 IsEmpty]: Start isEmpty. Operand 10008 states and 13939 transitions. [2022-01-10 02:34:01,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-10 02:34:01,028 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:01,028 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:34:01,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 02:34:01,028 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:01,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:01,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1956288145, now seen corresponding path program 1 times [2022-01-10 02:34:01,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:01,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069080523] [2022-01-10 02:34:01,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:01,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:01,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:01,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:01,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:01,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:01,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:01,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:01,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:01,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:01,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:01,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-10 02:34:01,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:01,090 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 02:34:01,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:01,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069080523] [2022-01-10 02:34:01,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069080523] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:01,090 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:01,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 02:34:01,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769946445] [2022-01-10 02:34:01,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:01,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:34:01,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:01,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:34:01,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:34:01,092 INFO L87 Difference]: Start difference. First operand 10008 states and 13939 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-10 02:34:02,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:02,343 INFO L93 Difference]: Finished difference Result 16880 states and 22356 transitions. [2022-01-10 02:34:02,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-10 02:34:02,345 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2022-01-10 02:34:02,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:02,381 INFO L225 Difference]: With dead ends: 16880 [2022-01-10 02:34:02,381 INFO L226 Difference]: Without dead ends: 12243 [2022-01-10 02:34:02,394 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2022-01-10 02:34:02,395 INFO L933 BasicCegarLoop]: 422 mSDtfsCounter, 887 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 1376 SdHoareTripleChecker+Invalid, 1139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:02,396 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [903 Valid, 1376 Invalid, 1139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 02:34:02,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12243 states. [2022-01-10 02:34:03,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12243 to 11923. [2022-01-10 02:34:03,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11923 states, 9802 states have (on average 1.3549275658028974) internal successors, (13281), 9962 states have internal predecessors, (13281), 1133 states have call successors, (1133), 788 states have call predecessors, (1133), 986 states have return successors, (1834), 1194 states have call predecessors, (1834), 1130 states have call successors, (1834) [2022-01-10 02:34:03,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11923 states to 11923 states and 16248 transitions. [2022-01-10 02:34:03,082 INFO L78 Accepts]: Start accepts. Automaton has 11923 states and 16248 transitions. Word has length 84 [2022-01-10 02:34:03,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:03,082 INFO L470 AbstractCegarLoop]: Abstraction has 11923 states and 16248 transitions. [2022-01-10 02:34:03,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-10 02:34:03,082 INFO L276 IsEmpty]: Start isEmpty. Operand 11923 states and 16248 transitions. [2022-01-10 02:34:03,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-01-10 02:34:03,088 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:03,088 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:34:03,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-10 02:34:03,089 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:03,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:03,089 INFO L85 PathProgramCache]: Analyzing trace with hash -197625515, now seen corresponding path program 1 times [2022-01-10 02:34:03,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:03,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498611043] [2022-01-10 02:34:03,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:03,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:03,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:03,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:03,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:03,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:03,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:03,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:03,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:03,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:03,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:03,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:03,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:03,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 02:34:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:03,143 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 02:34:03,143 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:03,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498611043] [2022-01-10 02:34:03,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498611043] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:03,143 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:03,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 02:34:03,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290879538] [2022-01-10 02:34:03,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:03,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 02:34:03,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:03,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 02:34:03,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:34:03,144 INFO L87 Difference]: Start difference. First operand 11923 states and 16248 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-10 02:34:04,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:04,466 INFO L93 Difference]: Finished difference Result 15926 states and 21088 transitions. [2022-01-10 02:34:04,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-10 02:34:04,466 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 93 [2022-01-10 02:34:04,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:04,495 INFO L225 Difference]: With dead ends: 15926 [2022-01-10 02:34:04,495 INFO L226 Difference]: Without dead ends: 11333 [2022-01-10 02:34:04,506 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2022-01-10 02:34:04,506 INFO L933 BasicCegarLoop]: 404 mSDtfsCounter, 1528 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 386 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1565 SdHoareTripleChecker+Valid, 1405 SdHoareTripleChecker+Invalid, 1430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 386 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:04,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1565 Valid, 1405 Invalid, 1430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [386 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 02:34:04,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11333 states. [2022-01-10 02:34:05,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11333 to 10999. [2022-01-10 02:34:05,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10999 states, 9091 states have (on average 1.3617863821361786) internal successors, (12380), 9233 states have internal predecessors, (12380), 1034 states have call successors, (1034), 703 states have call predecessors, (1034), 872 states have return successors, (1612), 1084 states have call predecessors, (1612), 1031 states have call successors, (1612) [2022-01-10 02:34:05,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10999 states to 10999 states and 15026 transitions. [2022-01-10 02:34:05,134 INFO L78 Accepts]: Start accepts. Automaton has 10999 states and 15026 transitions. Word has length 93 [2022-01-10 02:34:05,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:05,134 INFO L470 AbstractCegarLoop]: Abstraction has 10999 states and 15026 transitions. [2022-01-10 02:34:05,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-10 02:34:05,134 INFO L276 IsEmpty]: Start isEmpty. Operand 10999 states and 15026 transitions. [2022-01-10 02:34:05,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-01-10 02:34:05,147 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:05,147 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:34:05,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-10 02:34:05,147 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:05,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:05,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1663679213, now seen corresponding path program 1 times [2022-01-10 02:34:05,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:05,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513235092] [2022-01-10 02:34:05,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:05,148 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:05,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:05,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:05,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-10 02:34:05,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:05,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-01-10 02:34:05,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:05,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 02:34:05,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:05,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-10 02:34:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:05,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-01-10 02:34:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:05,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 02:34:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:05,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-01-10 02:34:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:05,211 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-10 02:34:05,211 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:05,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513235092] [2022-01-10 02:34:05,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513235092] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 02:34:05,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971183746] [2022-01-10 02:34:05,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:05,212 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:34:05,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:34:05,213 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 02:34:05,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 02:34:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:05,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:34:05,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:34:05,451 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-10 02:34:05,451 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:34:05,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971183746] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:05,452 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 02:34:05,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-01-10 02:34:05,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816352809] [2022-01-10 02:34:05,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:05,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:34:05,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:05,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:34:05,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:34:05,453 INFO L87 Difference]: Start difference. First operand 10999 states and 15026 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:34:06,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:06,311 INFO L93 Difference]: Finished difference Result 24036 states and 34570 transitions. [2022-01-10 02:34:06,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:34:06,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 129 [2022-01-10 02:34:06,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:06,363 INFO L225 Difference]: With dead ends: 24036 [2022-01-10 02:34:06,363 INFO L226 Difference]: Without dead ends: 17381 [2022-01-10 02:34:06,387 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:34:06,387 INFO L933 BasicCegarLoop]: 373 mSDtfsCounter, 311 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:06,387 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [311 Valid, 581 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:34:06,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17381 states. [2022-01-10 02:34:07,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17381 to 17273. [2022-01-10 02:34:07,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17273 states, 14503 states have (on average 1.3946080121354203) internal successors, (20226), 14720 states have internal predecessors, (20226), 1540 states have call successors, (1540), 1011 states have call predecessors, (1540), 1228 states have return successors, (2455), 1563 states have call predecessors, (2455), 1537 states have call successors, (2455) [2022-01-10 02:34:07,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17273 states to 17273 states and 24221 transitions. [2022-01-10 02:34:07,349 INFO L78 Accepts]: Start accepts. Automaton has 17273 states and 24221 transitions. Word has length 129 [2022-01-10 02:34:07,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:07,349 INFO L470 AbstractCegarLoop]: Abstraction has 17273 states and 24221 transitions. [2022-01-10 02:34:07,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:34:07,349 INFO L276 IsEmpty]: Start isEmpty. Operand 17273 states and 24221 transitions. [2022-01-10 02:34:07,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-01-10 02:34:07,371 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:07,371 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:34:07,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-01-10 02:34:07,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-01-10 02:34:07,590 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:07,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:07,590 INFO L85 PathProgramCache]: Analyzing trace with hash 389348365, now seen corresponding path program 1 times [2022-01-10 02:34:07,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:07,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298767493] [2022-01-10 02:34:07,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:07,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:07,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:07,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:07,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:07,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-10 02:34:07,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:07,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-01-10 02:34:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:07,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 02:34:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:07,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-10 02:34:07,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:07,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-01-10 02:34:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:07,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 02:34:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:07,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-01-10 02:34:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:07,666 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-10 02:34:07,666 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:07,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298767493] [2022-01-10 02:34:07,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298767493] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 02:34:07,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545015658] [2022-01-10 02:34:07,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:07,666 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:34:07,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:34:07,667 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 02:34:07,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 02:34:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:07,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:34:07,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:34:07,939 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-10 02:34:07,939 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:34:07,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545015658] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:07,939 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 02:34:07,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-01-10 02:34:07,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723335203] [2022-01-10 02:34:07,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:07,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:34:07,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:07,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:34:07,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:34:07,940 INFO L87 Difference]: Start difference. First operand 17273 states and 24221 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 02:34:09,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:09,410 INFO L93 Difference]: Finished difference Result 42508 states and 61581 transitions. [2022-01-10 02:34:09,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:34:09,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 129 [2022-01-10 02:34:09,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:09,474 INFO L225 Difference]: With dead ends: 42508 [2022-01-10 02:34:09,474 INFO L226 Difference]: Without dead ends: 19542 [2022-01-10 02:34:09,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:34:09,526 INFO L933 BasicCegarLoop]: 558 mSDtfsCounter, 192 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:09,526 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 918 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:34:09,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19542 states. [2022-01-10 02:34:10,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19542 to 19542. [2022-01-10 02:34:10,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19542 states, 16465 states have (on average 1.3992104464014576) internal successors, (23038), 16698 states have internal predecessors, (23038), 1723 states have call successors, (1723), 1119 states have call predecessors, (1723), 1352 states have return successors, (2769), 1746 states have call predecessors, (2769), 1720 states have call successors, (2769) [2022-01-10 02:34:10,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19542 states to 19542 states and 27530 transitions. [2022-01-10 02:34:10,605 INFO L78 Accepts]: Start accepts. Automaton has 19542 states and 27530 transitions. Word has length 129 [2022-01-10 02:34:10,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:10,606 INFO L470 AbstractCegarLoop]: Abstraction has 19542 states and 27530 transitions. [2022-01-10 02:34:10,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 02:34:10,606 INFO L276 IsEmpty]: Start isEmpty. Operand 19542 states and 27530 transitions. [2022-01-10 02:34:10,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-01-10 02:34:10,625 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:10,625 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:34:10,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-01-10 02:34:10,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:34:10,839 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:10,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:10,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1234059877, now seen corresponding path program 1 times [2022-01-10 02:34:10,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:10,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667160706] [2022-01-10 02:34:10,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:10,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:10,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:10,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:10,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:10,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:10,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:10,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:10,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:10,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:10,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:10,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:10,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-10 02:34:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:10,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-01-10 02:34:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:10,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-01-10 02:34:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:10,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-10 02:34:10,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:10,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:10,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:10,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:10,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-10 02:34:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:10,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-01-10 02:34:10,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:10,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-01-10 02:34:10,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:10,947 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-01-10 02:34:10,947 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:10,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667160706] [2022-01-10 02:34:10,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667160706] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 02:34:10,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845434558] [2022-01-10 02:34:10,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:10,948 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:34:10,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:34:10,949 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 02:34:10,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 02:34:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:11,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 02:34:11,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:34:11,203 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 02:34:11,203 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:34:11,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845434558] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:11,203 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 02:34:11,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2022-01-10 02:34:11,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221502734] [2022-01-10 02:34:11,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:11,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:34:11,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:11,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:34:11,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-01-10 02:34:11,205 INFO L87 Difference]: Start difference. First operand 19542 states and 27530 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-01-10 02:34:11,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:11,989 INFO L93 Difference]: Finished difference Result 21708 states and 30153 transitions. [2022-01-10 02:34:11,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:34:11,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2022-01-10 02:34:11,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:12,032 INFO L225 Difference]: With dead ends: 21708 [2022-01-10 02:34:12,032 INFO L226 Difference]: Without dead ends: 17403 [2022-01-10 02:34:12,045 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-01-10 02:34:12,045 INFO L933 BasicCegarLoop]: 364 mSDtfsCounter, 34 mSDsluCounter, 1419 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1783 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:12,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 1783 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:34:12,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17403 states. [2022-01-10 02:34:12,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17403 to 17278. [2022-01-10 02:34:12,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17278 states, 14778 states have (on average 1.4199485722019218) internal successors, (20984), 14960 states have internal predecessors, (20984), 1447 states have call successors, (1447), 885 states have call predecessors, (1447), 1051 states have return successors, (2376), 1448 states have call predecessors, (2376), 1444 states have call successors, (2376) [2022-01-10 02:34:12,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17278 states to 17278 states and 24807 transitions. [2022-01-10 02:34:12,887 INFO L78 Accepts]: Start accepts. Automaton has 17278 states and 24807 transitions. Word has length 145 [2022-01-10 02:34:12,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:12,888 INFO L470 AbstractCegarLoop]: Abstraction has 17278 states and 24807 transitions. [2022-01-10 02:34:12,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-01-10 02:34:12,888 INFO L276 IsEmpty]: Start isEmpty. Operand 17278 states and 24807 transitions. [2022-01-10 02:34:12,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-01-10 02:34:12,906 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:12,906 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:34:12,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-10 02:34:13,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-01-10 02:34:13,119 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:13,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:13,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1525119333, now seen corresponding path program 1 times [2022-01-10 02:34:13,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:13,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791109360] [2022-01-10 02:34:13,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:13,120 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:13,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:13,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:13,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:13,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:13,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:13,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:13,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:13,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:13,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:13,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:13,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:13,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-10 02:34:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:13,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-01-10 02:34:13,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:13,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-01-10 02:34:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:13,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-01-10 02:34:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:13,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:13,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:13,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:13,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-01-10 02:34:13,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:13,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-01-10 02:34:13,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:13,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-01-10 02:34:13,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:13,178 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-01-10 02:34:13,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:13,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791109360] [2022-01-10 02:34:13,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791109360] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:13,178 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:13,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 02:34:13,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606917559] [2022-01-10 02:34:13,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:13,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:34:13,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:13,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:34:13,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:34:13,179 INFO L87 Difference]: Start difference. First operand 17278 states and 24807 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-01-10 02:34:14,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:14,116 INFO L93 Difference]: Finished difference Result 17343 states and 24875 transitions. [2022-01-10 02:34:14,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:34:14,116 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 147 [2022-01-10 02:34:14,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:14,160 INFO L225 Difference]: With dead ends: 17343 [2022-01-10 02:34:14,160 INFO L226 Difference]: Without dead ends: 16900 [2022-01-10 02:34:14,170 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-01-10 02:34:14,170 INFO L933 BasicCegarLoop]: 343 mSDtfsCounter, 522 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:14,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [537 Valid, 787 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 02:34:14,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16900 states. [2022-01-10 02:34:15,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16900 to 16838. [2022-01-10 02:34:15,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16838 states, 14434 states have (on average 1.4258001939864209) internal successors, (20580), 14613 states have internal predecessors, (20580), 1401 states have call successors, (1401), 845 states have call predecessors, (1401), 1001 states have return successors, (2312), 1395 states have call predecessors, (2312), 1398 states have call successors, (2312) [2022-01-10 02:34:15,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16838 states to 16838 states and 24293 transitions. [2022-01-10 02:34:15,113 INFO L78 Accepts]: Start accepts. Automaton has 16838 states and 24293 transitions. Word has length 147 [2022-01-10 02:34:15,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:15,114 INFO L470 AbstractCegarLoop]: Abstraction has 16838 states and 24293 transitions. [2022-01-10 02:34:15,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-01-10 02:34:15,114 INFO L276 IsEmpty]: Start isEmpty. Operand 16838 states and 24293 transitions. [2022-01-10 02:34:15,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-01-10 02:34:15,132 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:15,133 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:34:15,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-10 02:34:15,133 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:15,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:15,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1268854173, now seen corresponding path program 1 times [2022-01-10 02:34:15,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:15,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239525500] [2022-01-10 02:34:15,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:15,134 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:15,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:15,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:15,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:15,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:15,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:15,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:15,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:15,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:15,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:15,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-01-10 02:34:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:15,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-01-10 02:34:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:15,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-10 02:34:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:15,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-01-10 02:34:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:15,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:15,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:15,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-01-10 02:34:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:15,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-01-10 02:34:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:15,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-01-10 02:34:15,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:15,241 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-01-10 02:34:15,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:15,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239525500] [2022-01-10 02:34:15,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239525500] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:15,241 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:15,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:34:15,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311261262] [2022-01-10 02:34:15,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:15,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:34:15,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:15,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:34:15,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:34:15,242 INFO L87 Difference]: Start difference. First operand 16838 states and 24293 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-01-10 02:34:16,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:16,297 INFO L93 Difference]: Finished difference Result 18315 states and 26092 transitions. [2022-01-10 02:34:16,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 02:34:16,298 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 159 [2022-01-10 02:34:16,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:16,340 INFO L225 Difference]: With dead ends: 18315 [2022-01-10 02:34:16,341 INFO L226 Difference]: Without dead ends: 16939 [2022-01-10 02:34:16,353 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:34:16,353 INFO L933 BasicCegarLoop]: 376 mSDtfsCounter, 453 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:16,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [454 Valid, 1110 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 02:34:16,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16939 states. [2022-01-10 02:34:17,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16939 to 16747. [2022-01-10 02:34:17,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16747 states, 14365 states have (on average 1.4267316394013227) internal successors, (20495), 14545 states have internal predecessors, (20495), 1392 states have call successors, (1392), 840 states have call predecessors, (1392), 988 states have return successors, (2296), 1377 states have call predecessors, (2296), 1389 states have call successors, (2296) [2022-01-10 02:34:17,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16747 states to 16747 states and 24183 transitions. [2022-01-10 02:34:17,235 INFO L78 Accepts]: Start accepts. Automaton has 16747 states and 24183 transitions. Word has length 159 [2022-01-10 02:34:17,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:17,235 INFO L470 AbstractCegarLoop]: Abstraction has 16747 states and 24183 transitions. [2022-01-10 02:34:17,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-01-10 02:34:17,235 INFO L276 IsEmpty]: Start isEmpty. Operand 16747 states and 24183 transitions. [2022-01-10 02:34:17,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-01-10 02:34:17,251 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:17,252 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:34:17,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-10 02:34:17,252 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:17,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:17,252 INFO L85 PathProgramCache]: Analyzing trace with hash 35384604, now seen corresponding path program 1 times [2022-01-10 02:34:17,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:17,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707608440] [2022-01-10 02:34:17,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:17,253 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:17,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:17,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:17,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-01-10 02:34:17,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-01-10 02:34:17,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-01-10 02:34:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-01-10 02:34:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:17,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-01-10 02:34:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-01-10 02:34:17,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-01-10 02:34:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,345 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-01-10 02:34:17,345 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:17,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707608440] [2022-01-10 02:34:17,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707608440] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 02:34:17,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960391665] [2022-01-10 02:34:17,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:17,346 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:34:17,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:34:17,347 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 02:34:17,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-10 02:34:17,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-10 02:34:17,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:34:17,681 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-01-10 02:34:17,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:34:18,079 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-01-10 02:34:18,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960391665] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:34:18,079 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 02:34:18,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2022-01-10 02:34:18,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919705221] [2022-01-10 02:34:18,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 02:34:18,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-10 02:34:18,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:18,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-10 02:34:18,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-01-10 02:34:18,082 INFO L87 Difference]: Start difference. First operand 16747 states and 24183 transitions. Second operand has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 12 states have internal predecessors, (246), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2022-01-10 02:34:19,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:19,505 INFO L93 Difference]: Finished difference Result 18719 states and 26636 transitions. [2022-01-10 02:34:19,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-10 02:34:19,506 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 12 states have internal predecessors, (246), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) Word has length 162 [2022-01-10 02:34:19,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:19,548 INFO L225 Difference]: With dead ends: 18719 [2022-01-10 02:34:19,549 INFO L226 Difference]: Without dead ends: 17287 [2022-01-10 02:34:19,561 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 354 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2022-01-10 02:34:19,562 INFO L933 BasicCegarLoop]: 320 mSDtfsCounter, 1253 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 1324 SdHoareTripleChecker+Invalid, 1439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:19,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1277 Valid, 1324 Invalid, 1439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 02:34:19,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17287 states. [2022-01-10 02:34:20,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17287 to 17137. [2022-01-10 02:34:20,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17137 states, 14643 states have (on average 1.4203373625623166) internal successors, (20798), 14831 states have internal predecessors, (20798), 1446 states have call successors, (1446), 890 states have call predecessors, (1446), 1046 states have return successors, (2410), 1431 states have call predecessors, (2410), 1443 states have call successors, (2410) [2022-01-10 02:34:20,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17137 states to 17137 states and 24654 transitions. [2022-01-10 02:34:20,445 INFO L78 Accepts]: Start accepts. Automaton has 17137 states and 24654 transitions. Word has length 162 [2022-01-10 02:34:20,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:20,445 INFO L470 AbstractCegarLoop]: Abstraction has 17137 states and 24654 transitions. [2022-01-10 02:34:20,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 12 states have internal predecessors, (246), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2022-01-10 02:34:20,446 INFO L276 IsEmpty]: Start isEmpty. Operand 17137 states and 24654 transitions. [2022-01-10 02:34:20,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-01-10 02:34:20,466 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:20,466 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:34:20,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-10 02:34:20,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-01-10 02:34:20,692 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:20,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:20,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1043385329, now seen corresponding path program 1 times [2022-01-10 02:34:20,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:20,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891340049] [2022-01-10 02:34:20,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:20,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:20,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:20,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-10 02:34:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:20,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-01-10 02:34:20,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:20,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 02:34:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:20,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-10 02:34:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:20,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-01-10 02:34:20,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:20,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 02:34:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:20,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-01-10 02:34:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:20,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 02:34:20,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:20,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-01-10 02:34:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:20,798 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-01-10 02:34:20,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:20,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891340049] [2022-01-10 02:34:20,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891340049] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 02:34:20,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525914032] [2022-01-10 02:34:20,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:20,799 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:34:20,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:34:20,800 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 02:34:20,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-10 02:34:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:20,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:34:20,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:34:21,102 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-10 02:34:21,102 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:34:21,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525914032] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:21,102 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 02:34:21,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-01-10 02:34:21,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966262077] [2022-01-10 02:34:21,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:21,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:34:21,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:21,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:34:21,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:34:21,103 INFO L87 Difference]: Start difference. First operand 17137 states and 24654 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-01-10 02:34:22,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:22,497 INFO L93 Difference]: Finished difference Result 47078 states and 69363 transitions. [2022-01-10 02:34:22,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:34:22,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 167 [2022-01-10 02:34:22,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:22,592 INFO L225 Difference]: With dead ends: 47078 [2022-01-10 02:34:22,593 INFO L226 Difference]: Without dead ends: 31880 [2022-01-10 02:34:22,633 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:34:22,634 INFO L933 BasicCegarLoop]: 371 mSDtfsCounter, 264 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:22,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 579 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:34:22,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31880 states. [2022-01-10 02:34:24,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31880 to 31632. [2022-01-10 02:34:24,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31632 states, 27121 states have (on average 1.4300726374396224) internal successors, (38785), 27475 states have internal predecessors, (38785), 2627 states have call successors, (2627), 1614 states have call predecessors, (2627), 1882 states have return successors, (4383), 2558 states have call predecessors, (4383), 2624 states have call successors, (4383) [2022-01-10 02:34:24,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31632 states to 31632 states and 45795 transitions. [2022-01-10 02:34:24,309 INFO L78 Accepts]: Start accepts. Automaton has 31632 states and 45795 transitions. Word has length 167 [2022-01-10 02:34:24,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:24,310 INFO L470 AbstractCegarLoop]: Abstraction has 31632 states and 45795 transitions. [2022-01-10 02:34:24,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-01-10 02:34:24,310 INFO L276 IsEmpty]: Start isEmpty. Operand 31632 states and 45795 transitions. [2022-01-10 02:34:24,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-01-10 02:34:24,349 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:24,350 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:34:24,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-01-10 02:34:24,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:34:24,550 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:24,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:24,551 INFO L85 PathProgramCache]: Analyzing trace with hash -932684503, now seen corresponding path program 1 times [2022-01-10 02:34:24,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:24,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408727525] [2022-01-10 02:34:24,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:24,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:24,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:24,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-10 02:34:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:24,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-01-10 02:34:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:24,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 02:34:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:24,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-10 02:34:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:24,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-01-10 02:34:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:24,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 02:34:24,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:24,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-10 02:34:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:24,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 02:34:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:24,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-01-10 02:34:24,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:24,649 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-01-10 02:34:24,649 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:24,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408727525] [2022-01-10 02:34:24,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408727525] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 02:34:24,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559542882] [2022-01-10 02:34:24,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:24,649 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:34:24,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:34:24,664 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 02:34:24,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-10 02:34:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:24,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:34:24,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:34:25,002 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-10 02:34:25,002 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:34:25,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559542882] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:25,002 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 02:34:25,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-01-10 02:34:25,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492738917] [2022-01-10 02:34:25,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:25,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:34:25,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:25,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:34:25,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:34:25,003 INFO L87 Difference]: Start difference. First operand 31632 states and 45795 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-01-10 02:34:27,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:27,086 INFO L93 Difference]: Finished difference Result 63101 states and 92719 transitions. [2022-01-10 02:34:27,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:34:27,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 167 [2022-01-10 02:34:27,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:27,329 INFO L225 Difference]: With dead ends: 63101 [2022-01-10 02:34:27,329 INFO L226 Difference]: Without dead ends: 45005 [2022-01-10 02:34:27,361 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:34:27,361 INFO L933 BasicCegarLoop]: 392 mSDtfsCounter, 265 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:27,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 600 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:34:27,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45005 states. [2022-01-10 02:34:29,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45005 to 44649. [2022-01-10 02:34:29,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44649 states, 38388 states have (on average 1.4363863707408566) internal successors, (55140), 38874 states have internal predecessors, (55140), 3646 states have call successors, (3646), 2249 states have call predecessors, (3646), 2613 states have return successors, (5969), 3541 states have call predecessors, (5969), 3643 states have call successors, (5969) [2022-01-10 02:34:29,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44649 states to 44649 states and 64755 transitions. [2022-01-10 02:34:29,715 INFO L78 Accepts]: Start accepts. Automaton has 44649 states and 64755 transitions. Word has length 167 [2022-01-10 02:34:29,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:29,715 INFO L470 AbstractCegarLoop]: Abstraction has 44649 states and 64755 transitions. [2022-01-10 02:34:29,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-01-10 02:34:29,716 INFO L276 IsEmpty]: Start isEmpty. Operand 44649 states and 64755 transitions. [2022-01-10 02:34:29,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-01-10 02:34:29,765 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:29,766 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:34:29,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-10 02:34:29,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:34:29,982 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:29,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:29,982 INFO L85 PathProgramCache]: Analyzing trace with hash 99767870, now seen corresponding path program 1 times [2022-01-10 02:34:29,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:29,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552997303] [2022-01-10 02:34:29,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:29,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:30,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:30,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 02:34:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:30,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-10 02:34:30,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:30,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:30,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:30,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:30,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 02:34:30,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:30,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 02:34:30,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:30,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-01-10 02:34:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:30,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-10 02:34:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:30,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-01-10 02:34:30,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:30,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-01-10 02:34:30,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:30,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-01-10 02:34:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:30,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:30,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:30,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-01-10 02:34:30,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:30,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-01-10 02:34:30,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:30,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-01-10 02:34:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:30,219 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-01-10 02:34:30,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:30,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552997303] [2022-01-10 02:34:30,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552997303] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 02:34:30,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831939797] [2022-01-10 02:34:30,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:30,220 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:34:30,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:34:30,221 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 02:34:30,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-10 02:34:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:30,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:34:30,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:34:30,570 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-01-10 02:34:30,571 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:34:30,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831939797] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:30,571 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 02:34:30,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-01-10 02:34:30,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373291340] [2022-01-10 02:34:30,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:30,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:34:30,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:30,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:34:30,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:34:30,572 INFO L87 Difference]: Start difference. First operand 44649 states and 64755 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-01-10 02:34:32,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:32,544 INFO L93 Difference]: Finished difference Result 46411 states and 66884 transitions. [2022-01-10 02:34:32,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:34:32,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 179 [2022-01-10 02:34:32,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:32,668 INFO L225 Difference]: With dead ends: 46411 [2022-01-10 02:34:32,668 INFO L226 Difference]: Without dead ends: 44656 [2022-01-10 02:34:32,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:34:32,694 INFO L933 BasicCegarLoop]: 425 mSDtfsCounter, 33 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:32,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 738 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:34:32,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44656 states. [2022-01-10 02:34:34,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44656 to 44649. [2022-01-10 02:34:34,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44649 states, 38388 states have (on average 1.4362300718974679) internal successors, (55134), 38874 states have internal predecessors, (55134), 3646 states have call successors, (3646), 2249 states have call predecessors, (3646), 2613 states have return successors, (5969), 3541 states have call predecessors, (5969), 3643 states have call successors, (5969) [2022-01-10 02:34:35,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44649 states to 44649 states and 64749 transitions. [2022-01-10 02:34:35,065 INFO L78 Accepts]: Start accepts. Automaton has 44649 states and 64749 transitions. Word has length 179 [2022-01-10 02:34:35,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:35,065 INFO L470 AbstractCegarLoop]: Abstraction has 44649 states and 64749 transitions. [2022-01-10 02:34:35,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-01-10 02:34:35,065 INFO L276 IsEmpty]: Start isEmpty. Operand 44649 states and 64749 transitions. [2022-01-10 02:34:35,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-01-10 02:34:35,112 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:35,112 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:34:35,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-01-10 02:34:35,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-01-10 02:34:35,312 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:35,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:35,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1939442957, now seen corresponding path program 1 times [2022-01-10 02:34:35,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:35,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13806105] [2022-01-10 02:34:35,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:35,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:35,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:35,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:35,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 02:34:35,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:35,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-10 02:34:35,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:35,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:35,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:35,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 02:34:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:35,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 02:34:35,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:35,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-01-10 02:34:35,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:35,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-10 02:34:35,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:35,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-01-10 02:34:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:35,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-01-10 02:34:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:35,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-01-10 02:34:35,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:35,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:35,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:35,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:35,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:35,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-01-10 02:34:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:35,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-01-10 02:34:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:35,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-01-10 02:34:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:35,392 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-01-10 02:34:35,392 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:35,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13806105] [2022-01-10 02:34:35,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13806105] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 02:34:35,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040803011] [2022-01-10 02:34:35,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:35,392 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:34:35,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:34:35,408 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 02:34:35,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-10 02:34:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:35,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 02:34:35,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:34:35,698 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-01-10 02:34:35,698 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:34:35,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040803011] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:35,698 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 02:34:35,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-01-10 02:34:35,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480091357] [2022-01-10 02:34:35,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:35,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 02:34:35,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:35,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 02:34:35,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-01-10 02:34:35,700 INFO L87 Difference]: Start difference. First operand 44649 states and 64749 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12)