/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 20:47:17,426 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 20:47:17,430 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 20:47:17,486 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 20:47:17,487 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 20:47:17,491 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 20:47:17,495 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 20:47:17,500 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 20:47:17,503 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 20:47:17,511 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 20:47:17,515 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 20:47:17,516 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 20:47:17,517 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 20:47:17,520 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 20:47:17,522 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 20:47:17,524 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 20:47:17,525 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 20:47:17,530 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 20:47:17,535 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 20:47:17,538 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 20:47:17,544 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 20:47:17,547 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 20:47:17,548 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 20:47:17,549 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 20:47:17,552 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 20:47:17,552 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 20:47:17,553 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 20:47:17,554 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 20:47:17,554 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 20:47:17,555 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 20:47:17,556 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 20:47:17,557 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 20:47:17,568 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 20:47:17,569 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 20:47:17,571 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 20:47:17,572 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 20:47:17,574 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 20:47:17,574 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 20:47:17,574 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 20:47:17,576 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 20:47:17,577 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 20:47:17,580 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 20:47:17,607 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 20:47:17,607 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 20:47:17,608 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 20:47:17,609 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 20:47:17,609 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 20:47:17,609 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 20:47:17,609 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 20:47:17,610 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 20:47:17,610 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 20:47:17,610 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 20:47:17,610 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 20:47:17,610 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 20:47:17,610 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 20:47:17,611 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 20:47:17,611 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 20:47:17,611 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 20:47:17,611 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 20:47:17,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 20:47:17,612 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 20:47:17,612 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 20:47:17,612 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 20:47:17,612 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 20:47:17,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 20:47:17,613 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 20:47:17,613 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 20:47:17,613 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-bitabs/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 [2021-01-06 20:47:17,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 20:47:18,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 20:47:18,026 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 20:47:18,027 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 20:47:18,028 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 20:47:18,029 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2021-01-06 20:47:18,104 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/64ebeb01f/8d153052f9a846d4b11984fb62065fc7/FLAGc29819d41 [2021-01-06 20:47:18,745 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 20:47:18,745 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2021-01-06 20:47:18,773 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/64ebeb01f/8d153052f9a846d4b11984fb62065fc7/FLAGc29819d41 [2021-01-06 20:47:19,025 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/64ebeb01f/8d153052f9a846d4b11984fb62065fc7 [2021-01-06 20:47:19,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 20:47:19,038 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 20:47:19,047 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 20:47:19,048 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 20:47:19,052 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 20:47:19,053 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 08:47:19" (1/1) ... [2021-01-06 20:47:19,056 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5484f1e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:47:19, skipping insertion in model container [2021-01-06 20:47:19,056 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 08:47:19" (1/1) ... [2021-01-06 20:47:19,069 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 20:47:19,153 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_1294~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~0,] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~0,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~0,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~0,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~0,] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_1399~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~0,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~1,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~1,] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~1,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~1,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~1,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~1,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~1,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~1,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~1,] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~1,] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~__return_1499~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~1,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1509_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~2,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~2,] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~2,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~2,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~2,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~2,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~2,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~2,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~2,] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~2,] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~__return_1601~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~2,] [2021-01-06 20:47:19,451 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c[10697,10710] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1509_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_1512~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_1~1,] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_1~1,] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_1~1,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_1~1,] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~1,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~1,] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~1,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~1,] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~1,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~1,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_1~2,] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_1~2,] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_1~2,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_1~2,] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~2,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~2,] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~2,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~2,] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~2,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~2,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] [2021-01-06 20:47:19,585 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 20:47:19,601 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_1294~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~0,] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~0,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~0,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~0,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~0,] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_1399~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~0,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~1,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~1,] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~1,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~1,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~1,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~1,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~1,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~1,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~1,] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~1,] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~__return_1499~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~1,] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1509_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~2,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~2,] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~2,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~2,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~2,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~2,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~2,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~2,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~2,] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~2,] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~__return_1601~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_3~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~2,] [2021-01-06 20:47:19,709 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c[10697,10710] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1509_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_1512~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_1~1,] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_1~1,] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_1~1,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_1~1,] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~1,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~1,] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~1,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~1,] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~1,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~1,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_1~2,] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_1~2,] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_1~2,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_1~2,] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~2,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~2,] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~2,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~2,] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~2,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~2,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~2,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] [2021-01-06 20:47:19,807 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 20:47:19,831 INFO L208 MainTranslator]: Completed translation [2021-01-06 20:47:19,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:47:19 WrapperNode [2021-01-06 20:47:19,832 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 20:47:19,833 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 20:47:19,833 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 20:47:19,833 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 20:47:19,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:47:19" (1/1) ... [2021-01-06 20:47:19,869 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:47:19" (1/1) ... [2021-01-06 20:47:19,960 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 20:47:19,961 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 20:47:19,963 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 20:47:19,963 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 20:47:19,973 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:47:19" (1/1) ... [2021-01-06 20:47:19,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:47:19" (1/1) ... [2021-01-06 20:47:19,981 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:47:19" (1/1) ... [2021-01-06 20:47:19,982 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:47:19" (1/1) ... [2021-01-06 20:47:19,999 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:47:19" (1/1) ... [2021-01-06 20:47:20,013 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:47:19" (1/1) ... [2021-01-06 20:47:20,018 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:47:19" (1/1) ... [2021-01-06 20:47:20,027 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 20:47:20,028 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 20:47:20,028 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 20:47:20,028 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 20:47:20,030 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:47:19" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 20:47:20,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 20:47:20,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 20:47:20,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 20:47:20,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 20:47:21,475 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 20:47:21,475 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-01-06 20:47:21,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 08:47:21 BoogieIcfgContainer [2021-01-06 20:47:21,478 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 20:47:21,480 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 20:47:21,480 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 20:47:21,484 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 20:47:21,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 08:47:19" (1/3) ... [2021-01-06 20:47:21,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dac9e87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 08:47:21, skipping insertion in model container [2021-01-06 20:47:21,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:47:19" (2/3) ... [2021-01-06 20:47:21,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dac9e87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 08:47:21, skipping insertion in model container [2021-01-06 20:47:21,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 08:47:21" (3/3) ... [2021-01-06 20:47:21,488 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2021-01-06 20:47:21,495 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 20:47:21,501 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 20:47:21,522 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 20:47:21,557 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 20:47:21,558 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 20:47:21,558 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 20:47:21,558 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 20:47:21,558 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 20:47:21,558 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 20:47:21,559 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 20:47:21,559 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 20:47:21,582 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states. [2021-01-06 20:47:21,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-01-06 20:47:21,598 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:47:21,599 INFO L422 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] [2021-01-06 20:47:21,600 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:47:21,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:47:21,606 INFO L82 PathProgramCache]: Analyzing trace with hash 498035691, now seen corresponding path program 1 times [2021-01-06 20:47:21,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:47:21,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123611124] [2021-01-06 20:47:21,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:47:21,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:47:22,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:47:22,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123611124] [2021-01-06 20:47:22,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:47:22,013 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 20:47:22,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722886499] [2021-01-06 20:47:22,019 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 20:47:22,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:47:22,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 20:47:22,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 20:47:22,039 INFO L87 Difference]: Start difference. First operand 330 states. Second operand 4 states. [2021-01-06 20:47:22,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:47:22,188 INFO L93 Difference]: Finished difference Result 632 states and 1022 transitions. [2021-01-06 20:47:22,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:47:22,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2021-01-06 20:47:22,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:47:22,207 INFO L225 Difference]: With dead ends: 632 [2021-01-06 20:47:22,207 INFO L226 Difference]: Without dead ends: 327 [2021-01-06 20:47:22,212 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:47:22,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-01-06 20:47:22,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2021-01-06 20:47:22,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2021-01-06 20:47:22,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 501 transitions. [2021-01-06 20:47:22,284 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 501 transitions. Word has length 79 [2021-01-06 20:47:22,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:47:22,285 INFO L481 AbstractCegarLoop]: Abstraction has 327 states and 501 transitions. [2021-01-06 20:47:22,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 20:47:22,285 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 501 transitions. [2021-01-06 20:47:22,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-01-06 20:47:22,291 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:47:22,291 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:47:22,291 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 20:47:22,292 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:47:22,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:47:22,293 INFO L82 PathProgramCache]: Analyzing trace with hash 2093359288, now seen corresponding path program 1 times [2021-01-06 20:47:22,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:47:22,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11155041] [2021-01-06 20:47:22,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:47:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:47:22,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:47:22,482 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11155041] [2021-01-06 20:47:22,482 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:47:22,483 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:47:22,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150250719] [2021-01-06 20:47:22,485 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:47:22,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:47:22,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:47:22,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:47:22,486 INFO L87 Difference]: Start difference. First operand 327 states and 501 transitions. Second operand 3 states. [2021-01-06 20:47:22,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:47:22,550 INFO L93 Difference]: Finished difference Result 761 states and 1193 transitions. [2021-01-06 20:47:22,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:47:22,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2021-01-06 20:47:22,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:47:22,556 INFO L225 Difference]: With dead ends: 761 [2021-01-06 20:47:22,556 INFO L226 Difference]: Without dead ends: 483 [2021-01-06 20:47:22,559 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:47:22,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2021-01-06 20:47:22,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 481. [2021-01-06 20:47:22,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2021-01-06 20:47:22,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 745 transitions. [2021-01-06 20:47:22,616 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 745 transitions. Word has length 110 [2021-01-06 20:47:22,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:47:22,617 INFO L481 AbstractCegarLoop]: Abstraction has 481 states and 745 transitions. [2021-01-06 20:47:22,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:47:22,617 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 745 transitions. [2021-01-06 20:47:22,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-01-06 20:47:22,624 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:47:22,624 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:47:22,624 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 20:47:22,624 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:47:22,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:47:22,625 INFO L82 PathProgramCache]: Analyzing trace with hash -55375790, now seen corresponding path program 1 times [2021-01-06 20:47:22,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:47:22,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169955983] [2021-01-06 20:47:22,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:47:22,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:47:22,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:47:22,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169955983] [2021-01-06 20:47:22,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:47:22,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:47:22,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927360715] [2021-01-06 20:47:22,766 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:47:22,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:47:22,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:47:22,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:47:22,768 INFO L87 Difference]: Start difference. First operand 481 states and 745 transitions. Second operand 3 states. [2021-01-06 20:47:22,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:47:22,837 INFO L93 Difference]: Finished difference Result 1163 states and 1832 transitions. [2021-01-06 20:47:22,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:47:22,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2021-01-06 20:47:22,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:47:22,842 INFO L225 Difference]: With dead ends: 1163 [2021-01-06 20:47:22,843 INFO L226 Difference]: Without dead ends: 744 [2021-01-06 20:47:22,847 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:47:22,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2021-01-06 20:47:22,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 742. [2021-01-06 20:47:22,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2021-01-06 20:47:22,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1158 transitions. [2021-01-06 20:47:22,914 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1158 transitions. Word has length 112 [2021-01-06 20:47:22,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:47:22,921 INFO L481 AbstractCegarLoop]: Abstraction has 742 states and 1158 transitions. [2021-01-06 20:47:22,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:47:22,921 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1158 transitions. [2021-01-06 20:47:22,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-01-06 20:47:22,930 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:47:22,931 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:47:22,933 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 20:47:22,933 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:47:22,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:47:22,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1569587546, now seen corresponding path program 1 times [2021-01-06 20:47:22,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:47:22,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600566361] [2021-01-06 20:47:22,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:47:22,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:47:23,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:47:23,048 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600566361] [2021-01-06 20:47:23,048 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:47:23,049 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:47:23,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792245462] [2021-01-06 20:47:23,049 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:47:23,050 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:47:23,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:47:23,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:47:23,051 INFO L87 Difference]: Start difference. First operand 742 states and 1158 transitions. Second operand 3 states. [2021-01-06 20:47:23,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:47:23,124 INFO L93 Difference]: Finished difference Result 1834 states and 2894 transitions. [2021-01-06 20:47:23,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:47:23,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2021-01-06 20:47:23,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:47:23,132 INFO L225 Difference]: With dead ends: 1834 [2021-01-06 20:47:23,133 INFO L226 Difference]: Without dead ends: 1167 [2021-01-06 20:47:23,134 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:47:23,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2021-01-06 20:47:23,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1165. [2021-01-06 20:47:23,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1165 states. [2021-01-06 20:47:23,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1824 transitions. [2021-01-06 20:47:23,213 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1824 transitions. Word has length 114 [2021-01-06 20:47:23,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:47:23,215 INFO L481 AbstractCegarLoop]: Abstraction has 1165 states and 1824 transitions. [2021-01-06 20:47:23,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:47:23,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1824 transitions. [2021-01-06 20:47:23,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-06 20:47:23,220 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:47:23,220 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:47:23,220 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 20:47:23,220 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:47:23,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:47:23,221 INFO L82 PathProgramCache]: Analyzing trace with hash -598144290, now seen corresponding path program 1 times [2021-01-06 20:47:23,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:47:23,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397510202] [2021-01-06 20:47:23,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:47:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:47:23,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:47:23,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397510202] [2021-01-06 20:47:23,349 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:47:23,349 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:47:23,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298235506] [2021-01-06 20:47:23,350 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:47:23,350 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:47:23,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:47:23,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:47:23,352 INFO L87 Difference]: Start difference. First operand 1165 states and 1824 transitions. Second operand 3 states. [2021-01-06 20:47:23,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:47:23,460 INFO L93 Difference]: Finished difference Result 2887 states and 4547 transitions. [2021-01-06 20:47:23,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:47:23,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2021-01-06 20:47:23,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:47:23,472 INFO L225 Difference]: With dead ends: 2887 [2021-01-06 20:47:23,473 INFO L226 Difference]: Without dead ends: 1810 [2021-01-06 20:47:23,475 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:47:23,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2021-01-06 20:47:23,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1808. [2021-01-06 20:47:23,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1808 states. [2021-01-06 20:47:23,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2826 transitions. [2021-01-06 20:47:23,568 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2826 transitions. Word has length 116 [2021-01-06 20:47:23,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:47:23,568 INFO L481 AbstractCegarLoop]: Abstraction has 1808 states and 2826 transitions. [2021-01-06 20:47:23,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:47:23,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2826 transitions. [2021-01-06 20:47:23,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-01-06 20:47:23,575 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:47:23,575 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:47:23,575 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 20:47:23,575 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:47:23,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:47:23,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1082431554, now seen corresponding path program 1 times [2021-01-06 20:47:23,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:47:23,577 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987471641] [2021-01-06 20:47:23,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:47:23,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:47:23,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:47:23,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987471641] [2021-01-06 20:47:23,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:47:23,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:47:23,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429071454] [2021-01-06 20:47:23,713 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:47:23,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:47:23,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:47:23,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:47:23,716 INFO L87 Difference]: Start difference. First operand 1808 states and 2826 transitions. Second operand 3 states. [2021-01-06 20:47:23,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:47:23,864 INFO L93 Difference]: Finished difference Result 4392 states and 6872 transitions. [2021-01-06 20:47:23,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:47:23,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2021-01-06 20:47:23,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:47:23,879 INFO L225 Difference]: With dead ends: 4392 [2021-01-06 20:47:23,880 INFO L226 Difference]: Without dead ends: 2685 [2021-01-06 20:47:23,884 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:47:23,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2685 states. [2021-01-06 20:47:24,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2685 to 2683. [2021-01-06 20:47:24,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2683 states. [2021-01-06 20:47:24,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2683 states to 2683 states and 4160 transitions. [2021-01-06 20:47:24,050 INFO L78 Accepts]: Start accepts. Automaton has 2683 states and 4160 transitions. Word has length 118 [2021-01-06 20:47:24,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:47:24,050 INFO L481 AbstractCegarLoop]: Abstraction has 2683 states and 4160 transitions. [2021-01-06 20:47:24,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:47:24,051 INFO L276 IsEmpty]: Start isEmpty. Operand 2683 states and 4160 transitions. [2021-01-06 20:47:24,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-01-06 20:47:24,057 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:47:24,058 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:47:24,058 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 20:47:24,058 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:47:24,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:47:24,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1267336044, now seen corresponding path program 1 times [2021-01-06 20:47:24,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:47:24,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996467977] [2021-01-06 20:47:24,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:47:24,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:47:24,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:47:24,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996467977] [2021-01-06 20:47:24,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:47:24,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 20:47:24,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007016463] [2021-01-06 20:47:24,420 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 20:47:24,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:47:24,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 20:47:24,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-06 20:47:24,422 INFO L87 Difference]: Start difference. First operand 2683 states and 4160 transitions. Second operand 7 states. [2021-01-06 20:47:25,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:47:25,741 INFO L93 Difference]: Finished difference Result 13585 states and 20972 transitions. [2021-01-06 20:47:25,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 20:47:25,742 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 120 [2021-01-06 20:47:25,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:47:25,795 INFO L225 Difference]: With dead ends: 13585 [2021-01-06 20:47:25,795 INFO L226 Difference]: Without dead ends: 10997 [2021-01-06 20:47:25,801 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-06 20:47:25,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10997 states. [2021-01-06 20:47:26,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10997 to 10989. [2021-01-06 20:47:26,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10989 states. [2021-01-06 20:47:26,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10989 states to 10989 states and 16865 transitions. [2021-01-06 20:47:26,742 INFO L78 Accepts]: Start accepts. Automaton has 10989 states and 16865 transitions. Word has length 120 [2021-01-06 20:47:26,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:47:26,742 INFO L481 AbstractCegarLoop]: Abstraction has 10989 states and 16865 transitions. [2021-01-06 20:47:26,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 20:47:26,743 INFO L276 IsEmpty]: Start isEmpty. Operand 10989 states and 16865 transitions. [2021-01-06 20:47:26,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-01-06 20:47:26,774 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:47:26,774 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:47:26,775 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 20:47:26,775 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:47:26,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:47:26,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1888610653, now seen corresponding path program 1 times [2021-01-06 20:47:26,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:47:26,776 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600393101] [2021-01-06 20:47:26,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:47:26,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:47:26,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:47:26,866 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600393101] [2021-01-06 20:47:26,867 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:47:26,867 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:47:26,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938271813] [2021-01-06 20:47:26,868 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:47:26,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:47:26,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:47:26,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:47:26,869 INFO L87 Difference]: Start difference. First operand 10989 states and 16865 transitions. Second operand 3 states. [2021-01-06 20:47:28,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:47:28,132 INFO L93 Difference]: Finished difference Result 27983 states and 42949 transitions. [2021-01-06 20:47:28,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:47:28,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2021-01-06 20:47:28,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:47:28,207 INFO L225 Difference]: With dead ends: 27983 [2021-01-06 20:47:28,207 INFO L226 Difference]: Without dead ends: 19183 [2021-01-06 20:47:28,221 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:47:28,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19183 states. [2021-01-06 20:47:29,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19183 to 19181. [2021-01-06 20:47:29,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19181 states. [2021-01-06 20:47:29,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19181 states to 19181 states and 29233 transitions. [2021-01-06 20:47:29,669 INFO L78 Accepts]: Start accepts. Automaton has 19181 states and 29233 transitions. Word has length 122 [2021-01-06 20:47:29,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:47:29,669 INFO L481 AbstractCegarLoop]: Abstraction has 19181 states and 29233 transitions. [2021-01-06 20:47:29,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:47:29,669 INFO L276 IsEmpty]: Start isEmpty. Operand 19181 states and 29233 transitions. [2021-01-06 20:47:29,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-01-06 20:47:29,715 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:47:29,716 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:47:29,716 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 20:47:29,716 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:47:29,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:47:29,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1052580555, now seen corresponding path program 1 times [2021-01-06 20:47:29,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:47:29,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995549988] [2021-01-06 20:47:29,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:47:29,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:47:29,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:47:29,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995549988] [2021-01-06 20:47:29,813 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:47:29,813 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:47:29,814 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112497648] [2021-01-06 20:47:29,814 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:47:29,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:47:29,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:47:29,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:47:29,816 INFO L87 Difference]: Start difference. First operand 19181 states and 29233 transitions. Second operand 3 states. [2021-01-06 20:47:31,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:47:31,467 INFO L93 Difference]: Finished difference Result 44044 states and 67103 transitions. [2021-01-06 20:47:31,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:47:31,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2021-01-06 20:47:31,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:47:31,546 INFO L225 Difference]: With dead ends: 44044 [2021-01-06 20:47:31,547 INFO L226 Difference]: Without dead ends: 31182 [2021-01-06 20:47:31,572 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:47:31,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31182 states. [2021-01-06 20:47:33,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31182 to 31180. [2021-01-06 20:47:33,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31180 states. [2021-01-06 20:47:33,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31180 states to 31180 states and 47165 transitions. [2021-01-06 20:47:33,635 INFO L78 Accepts]: Start accepts. Automaton has 31180 states and 47165 transitions. Word has length 122 [2021-01-06 20:47:33,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:47:33,635 INFO L481 AbstractCegarLoop]: Abstraction has 31180 states and 47165 transitions. [2021-01-06 20:47:33,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:47:33,635 INFO L276 IsEmpty]: Start isEmpty. Operand 31180 states and 47165 transitions. [2021-01-06 20:47:33,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-01-06 20:47:33,697 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:47:33,697 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:47:33,698 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 20:47:33,698 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:47:33,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:47:33,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1542203229, now seen corresponding path program 1 times [2021-01-06 20:47:33,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:47:33,699 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829378964] [2021-01-06 20:47:33,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:47:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:47:33,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:47:33,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829378964] [2021-01-06 20:47:33,809 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:47:33,809 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:47:33,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52331357] [2021-01-06 20:47:33,810 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:47:33,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:47:33,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:47:33,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:47:33,811 INFO L87 Difference]: Start difference. First operand 31180 states and 47165 transitions. Second operand 3 states. [2021-01-06 20:47:35,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:47:35,467 INFO L93 Difference]: Finished difference Result 63224 states and 95451 transitions. [2021-01-06 20:47:35,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:47:35,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2021-01-06 20:47:35,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:47:35,592 INFO L225 Difference]: With dead ends: 63224 [2021-01-06 20:47:35,592 INFO L226 Difference]: Without dead ends: 46710 [2021-01-06 20:47:35,621 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:47:35,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46710 states. [2021-01-06 20:47:37,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46710 to 46708. [2021-01-06 20:47:37,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46708 states. [2021-01-06 20:47:38,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46708 states to 46708 states and 70009 transitions. [2021-01-06 20:47:38,026 INFO L78 Accepts]: Start accepts. Automaton has 46708 states and 70009 transitions. Word has length 122 [2021-01-06 20:47:38,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:47:38,026 INFO L481 AbstractCegarLoop]: Abstraction has 46708 states and 70009 transitions. [2021-01-06 20:47:38,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:47:38,026 INFO L276 IsEmpty]: Start isEmpty. Operand 46708 states and 70009 transitions. [2021-01-06 20:47:38,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-01-06 20:47:38,080 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:47:38,080 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:47:38,081 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 20:47:38,081 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:47:38,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:47:38,081 INFO L82 PathProgramCache]: Analyzing trace with hash 893236855, now seen corresponding path program 1 times [2021-01-06 20:47:38,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:47:38,082 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179734382] [2021-01-06 20:47:38,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:47:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:47:38,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:47:38,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179734382] [2021-01-06 20:47:38,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:47:38,170 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:47:38,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239916957] [2021-01-06 20:47:38,171 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:47:38,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:47:38,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:47:38,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:47:38,172 INFO L87 Difference]: Start difference. First operand 46708 states and 70009 transitions. Second operand 3 states. [2021-01-06 20:47:40,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:47:40,295 INFO L93 Difference]: Finished difference Result 77068 states and 114787 transitions. [2021-01-06 20:47:40,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:47:40,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2021-01-06 20:47:40,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:47:40,459 INFO L225 Difference]: With dead ends: 77068 [2021-01-06 20:47:40,459 INFO L226 Difference]: Without dead ends: 61578 [2021-01-06 20:47:40,497 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:47:40,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61578 states. [2021-01-06 20:47:43,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61578 to 61576. [2021-01-06 20:47:43,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61576 states. [2021-01-06 20:47:43,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61576 states to 61576 states and 91105 transitions. [2021-01-06 20:47:43,298 INFO L78 Accepts]: Start accepts. Automaton has 61576 states and 91105 transitions. Word has length 122 [2021-01-06 20:47:43,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:47:43,298 INFO L481 AbstractCegarLoop]: Abstraction has 61576 states and 91105 transitions. [2021-01-06 20:47:43,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:47:43,298 INFO L276 IsEmpty]: Start isEmpty. Operand 61576 states and 91105 transitions. [2021-01-06 20:47:43,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-01-06 20:47:43,389 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:47:43,389 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:47:43,389 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 20:47:43,390 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:47:43,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:47:43,390 INFO L82 PathProgramCache]: Analyzing trace with hash -2091528308, now seen corresponding path program 1 times [2021-01-06 20:47:43,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:47:43,391 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127596130] [2021-01-06 20:47:43,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:47:43,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:47:43,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:47:43,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127596130] [2021-01-06 20:47:43,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:47:43,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 20:47:43,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006915970] [2021-01-06 20:47:43,511 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 20:47:43,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:47:43,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 20:47:43,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-06 20:47:43,512 INFO L87 Difference]: Start difference. First operand 61576 states and 91105 transitions. Second operand 6 states. [2021-01-06 20:47:51,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:47:51,143 INFO L93 Difference]: Finished difference Result 214771 states and 316532 transitions. [2021-01-06 20:47:51,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:47:51,148 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124 [2021-01-06 20:47:51,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:47:51,483 INFO L225 Difference]: With dead ends: 214771 [2021-01-06 20:47:51,483 INFO L226 Difference]: Without dead ends: 153239 [2021-01-06 20:47:51,652 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2021-01-06 20:47:51,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153239 states. [2021-01-06 20:47:58,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153239 to 132323. [2021-01-06 20:47:58,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132323 states. [2021-01-06 20:47:59,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132323 states to 132323 states and 194466 transitions. [2021-01-06 20:47:59,218 INFO L78 Accepts]: Start accepts. Automaton has 132323 states and 194466 transitions. Word has length 124 [2021-01-06 20:47:59,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:47:59,220 INFO L481 AbstractCegarLoop]: Abstraction has 132323 states and 194466 transitions. [2021-01-06 20:47:59,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 20:47:59,220 INFO L276 IsEmpty]: Start isEmpty. Operand 132323 states and 194466 transitions. [2021-01-06 20:47:59,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-01-06 20:47:59,413 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:47:59,413 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:47:59,413 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 20:47:59,413 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:47:59,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:47:59,414 INFO L82 PathProgramCache]: Analyzing trace with hash 790516460, now seen corresponding path program 1 times [2021-01-06 20:47:59,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:47:59,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479731522] [2021-01-06 20:47:59,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:47:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:47:59,818 WARN L197 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2021-01-06 20:47:59,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:47:59,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479731522] [2021-01-06 20:47:59,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:47:59,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 20:47:59,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842488020] [2021-01-06 20:47:59,885 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 20:47:59,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:47:59,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 20:47:59,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-06 20:47:59,887 INFO L87 Difference]: Start difference. First operand 132323 states and 194466 transitions. Second operand 7 states. [2021-01-06 20:48:20,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:48:20,260 INFO L93 Difference]: Finished difference Result 551924 states and 807212 transitions. [2021-01-06 20:48:20,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 20:48:20,260 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2021-01-06 20:48:20,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:48:21,194 INFO L225 Difference]: With dead ends: 551924 [2021-01-06 20:48:21,195 INFO L226 Difference]: Without dead ends: 420189 [2021-01-06 20:48:21,390 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-01-06 20:48:22,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420189 states. [2021-01-06 20:48:38,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420189 to 254189. [2021-01-06 20:48:38,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254189 states. [2021-01-06 20:48:39,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254189 states to 254189 states and 365086 transitions. [2021-01-06 20:48:39,151 INFO L78 Accepts]: Start accepts. Automaton has 254189 states and 365086 transitions. Word has length 124 [2021-01-06 20:48:39,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:48:39,151 INFO L481 AbstractCegarLoop]: Abstraction has 254189 states and 365086 transitions. [2021-01-06 20:48:39,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 20:48:39,151 INFO L276 IsEmpty]: Start isEmpty. Operand 254189 states and 365086 transitions. [2021-01-06 20:48:39,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 20:48:39,485 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:48:39,486 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:48:39,486 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 20:48:39,486 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:48:39,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:48:39,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1408195571, now seen corresponding path program 1 times [2021-01-06 20:48:39,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:48:39,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790510343] [2021-01-06 20:48:39,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:48:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:48:39,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:48:39,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790510343] [2021-01-06 20:48:39,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:48:39,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:48:39,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689851063] [2021-01-06 20:48:39,603 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:48:39,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:48:39,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:48:39,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:48:39,604 INFO L87 Difference]: Start difference. First operand 254189 states and 365086 transitions. Second operand 3 states. [2021-01-06 20:48:53,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:48:53,294 INFO L93 Difference]: Finished difference Result 463921 states and 666272 transitions. [2021-01-06 20:48:53,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:48:53,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2021-01-06 20:48:53,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:48:53,766 INFO L225 Difference]: With dead ends: 463921 [2021-01-06 20:48:53,766 INFO L226 Difference]: Without dead ends: 240214 [2021-01-06 20:48:53,917 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:48:54,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240214 states. [2021-01-06 20:49:07,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240214 to 240212. [2021-01-06 20:49:07,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240212 states. [2021-01-06 20:49:08,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240212 states to 240212 states and 342562 transitions. [2021-01-06 20:49:08,829 INFO L78 Accepts]: Start accepts. Automaton has 240212 states and 342562 transitions. Word has length 127 [2021-01-06 20:49:08,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:49:08,829 INFO L481 AbstractCegarLoop]: Abstraction has 240212 states and 342562 transitions. [2021-01-06 20:49:08,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:49:08,829 INFO L276 IsEmpty]: Start isEmpty. Operand 240212 states and 342562 transitions. [2021-01-06 20:49:09,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 20:49:09,002 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:49:09,002 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:49:09,002 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 20:49:09,002 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:49:09,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:49:09,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1680642543, now seen corresponding path program 1 times [2021-01-06 20:49:09,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:49:09,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800317139] [2021-01-06 20:49:09,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:49:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:49:09,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:49:09,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800317139] [2021-01-06 20:49:09,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:49:09,084 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:49:09,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202297390] [2021-01-06 20:49:09,084 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:49:09,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:49:09,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:49:09,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:49:09,085 INFO L87 Difference]: Start difference. First operand 240212 states and 342562 transitions. Second operand 3 states. [2021-01-06 20:49:16,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:49:16,798 INFO L93 Difference]: Finished difference Result 345080 states and 491924 transitions. [2021-01-06 20:49:16,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:49:16,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2021-01-06 20:49:16,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:49:17,187 INFO L225 Difference]: With dead ends: 345080 [2021-01-06 20:49:17,188 INFO L226 Difference]: Without dead ends: 121472 [2021-01-06 20:49:17,368 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:49:17,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121472 states. [2021-01-06 20:49:26,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121472 to 121470. [2021-01-06 20:49:26,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121470 states. [2021-01-06 20:49:26,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121470 states to 121470 states and 171992 transitions. [2021-01-06 20:49:26,895 INFO L78 Accepts]: Start accepts. Automaton has 121470 states and 171992 transitions. Word has length 127 [2021-01-06 20:49:26,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:49:26,896 INFO L481 AbstractCegarLoop]: Abstraction has 121470 states and 171992 transitions. [2021-01-06 20:49:26,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:49:26,896 INFO L276 IsEmpty]: Start isEmpty. Operand 121470 states and 171992 transitions. [2021-01-06 20:49:26,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 20:49:26,979 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:49:26,979 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:49:26,979 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 20:49:26,979 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:49:26,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:49:26,980 INFO L82 PathProgramCache]: Analyzing trace with hash -44063175, now seen corresponding path program 1 times [2021-01-06 20:49:26,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:49:26,980 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100223629] [2021-01-06 20:49:26,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:49:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:49:27,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:49:27,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100223629] [2021-01-06 20:49:27,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:49:27,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:49:27,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761598449] [2021-01-06 20:49:27,047 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:49:27,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:49:27,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:49:27,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:49:27,048 INFO L87 Difference]: Start difference. First operand 121470 states and 171992 transitions. Second operand 3 states. [2021-01-06 20:49:31,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:49:31,159 INFO L93 Difference]: Finished difference Result 173906 states and 246058 transitions. [2021-01-06 20:49:31,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:49:31,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2021-01-06 20:49:31,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:49:31,246 INFO L225 Difference]: With dead ends: 173906 [2021-01-06 20:49:31,246 INFO L226 Difference]: Without dead ends: 62218 [2021-01-06 20:49:31,306 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:49:31,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62218 states. [2021-01-06 20:49:35,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62218 to 62216. [2021-01-06 20:49:35,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62216 states. [2021-01-06 20:49:35,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62216 states to 62216 states and 87374 transitions. [2021-01-06 20:49:35,112 INFO L78 Accepts]: Start accepts. Automaton has 62216 states and 87374 transitions. Word has length 127 [2021-01-06 20:49:35,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:49:35,112 INFO L481 AbstractCegarLoop]: Abstraction has 62216 states and 87374 transitions. [2021-01-06 20:49:35,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:49:35,112 INFO L276 IsEmpty]: Start isEmpty. Operand 62216 states and 87374 transitions. [2021-01-06 20:49:35,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 20:49:35,155 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:49:35,155 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:49:35,155 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 20:49:35,156 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:49:35,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:49:35,156 INFO L82 PathProgramCache]: Analyzing trace with hash 172528685, now seen corresponding path program 1 times [2021-01-06 20:49:35,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:49:35,156 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028976529] [2021-01-06 20:49:35,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:49:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:49:35,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:49:35,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028976529] [2021-01-06 20:49:35,239 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:49:35,239 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:49:35,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089021984] [2021-01-06 20:49:35,240 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:49:35,240 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:49:35,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:49:35,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:49:35,241 INFO L87 Difference]: Start difference. First operand 62216 states and 87374 transitions. Second operand 3 states. [2021-01-06 20:49:37,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:49:37,254 INFO L93 Difference]: Finished difference Result 88436 states and 124100 transitions. [2021-01-06 20:49:37,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:49:37,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2021-01-06 20:49:37,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:49:37,393 INFO L225 Difference]: With dead ends: 88436 [2021-01-06 20:49:37,393 INFO L226 Difference]: Without dead ends: 33079 [2021-01-06 20:49:37,413 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:49:37,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33079 states. [2021-01-06 20:49:39,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33079 to 33077. [2021-01-06 20:49:39,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33077 states. [2021-01-06 20:49:39,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33077 states to 33077 states and 46033 transitions. [2021-01-06 20:49:39,482 INFO L78 Accepts]: Start accepts. Automaton has 33077 states and 46033 transitions. Word has length 127 [2021-01-06 20:49:39,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:49:39,482 INFO L481 AbstractCegarLoop]: Abstraction has 33077 states and 46033 transitions. [2021-01-06 20:49:39,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:49:39,482 INFO L276 IsEmpty]: Start isEmpty. Operand 33077 states and 46033 transitions. [2021-01-06 20:49:39,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 20:49:39,504 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:49:39,505 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:49:39,505 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 20:49:39,505 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:49:39,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:49:39,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1264776567, now seen corresponding path program 1 times [2021-01-06 20:49:39,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:49:39,506 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046168248] [2021-01-06 20:49:39,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:49:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:49:39,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:49:39,639 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046168248] [2021-01-06 20:49:39,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:49:39,639 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 20:49:39,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860290415] [2021-01-06 20:49:39,642 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 20:49:39,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:49:39,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 20:49:39,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 20:49:39,643 INFO L87 Difference]: Start difference. First operand 33077 states and 46033 transitions. Second operand 6 states. [2021-01-06 20:49:43,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:49:43,592 INFO L93 Difference]: Finished difference Result 60527 states and 83682 transitions. [2021-01-06 20:49:43,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 20:49:43,592 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2021-01-06 20:49:43,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:49:43,670 INFO L225 Difference]: With dead ends: 60527 [2021-01-06 20:49:43,670 INFO L226 Difference]: Without dead ends: 60525 [2021-01-06 20:49:43,682 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-01-06 20:49:43,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60525 states. [2021-01-06 20:49:46,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60525 to 34309. [2021-01-06 20:49:46,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34309 states. [2021-01-06 20:49:46,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34309 states to 34309 states and 47265 transitions. [2021-01-06 20:49:46,193 INFO L78 Accepts]: Start accepts. Automaton has 34309 states and 47265 transitions. Word has length 127 [2021-01-06 20:49:46,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:49:46,194 INFO L481 AbstractCegarLoop]: Abstraction has 34309 states and 47265 transitions. [2021-01-06 20:49:46,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 20:49:46,194 INFO L276 IsEmpty]: Start isEmpty. Operand 34309 states and 47265 transitions. [2021-01-06 20:49:46,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-01-06 20:49:46,215 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:49:46,216 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:49:46,216 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 20:49:46,216 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:49:46,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:49:46,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1384750876, now seen corresponding path program 1 times [2021-01-06 20:49:46,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:49:46,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304383618] [2021-01-06 20:49:46,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:49:46,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:49:46,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:49:46,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304383618] [2021-01-06 20:49:46,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:49:46,400 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 20:49:46,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035725596] [2021-01-06 20:49:46,402 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 20:49:46,402 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:49:46,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 20:49:46,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-06 20:49:46,403 INFO L87 Difference]: Start difference. First operand 34309 states and 47265 transitions. Second operand 7 states. [2021-01-06 20:49:50,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:49:50,983 INFO L93 Difference]: Finished difference Result 62644 states and 86528 transitions. [2021-01-06 20:49:50,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 20:49:50,983 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 128 [2021-01-06 20:49:50,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:49:51,051 INFO L225 Difference]: With dead ends: 62644 [2021-01-06 20:49:51,052 INFO L226 Difference]: Without dead ends: 56786 [2021-01-06 20:49:51,065 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-01-06 20:49:51,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56786 states. [2021-01-06 20:49:54,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56786 to 40318. [2021-01-06 20:49:54,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40318 states. [2021-01-06 20:49:54,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40318 states to 40318 states and 55460 transitions. [2021-01-06 20:49:54,306 INFO L78 Accepts]: Start accepts. Automaton has 40318 states and 55460 transitions. Word has length 128 [2021-01-06 20:49:54,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:49:54,307 INFO L481 AbstractCegarLoop]: Abstraction has 40318 states and 55460 transitions. [2021-01-06 20:49:54,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 20:49:54,307 INFO L276 IsEmpty]: Start isEmpty. Operand 40318 states and 55460 transitions. [2021-01-06 20:49:54,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-01-06 20:49:54,330 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:49:54,330 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:49:54,331 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 20:49:54,331 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:49:54,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:49:54,331 INFO L82 PathProgramCache]: Analyzing trace with hash 563941196, now seen corresponding path program 1 times [2021-01-06 20:49:54,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:49:54,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338939050] [2021-01-06 20:49:54,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:49:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:49:54,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:49:54,394 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338939050] [2021-01-06 20:49:54,395 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:49:54,395 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:49:54,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500488488] [2021-01-06 20:49:54,395 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:49:54,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:49:54,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:49:54,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:49:54,396 INFO L87 Difference]: Start difference. First operand 40318 states and 55460 transitions. Second operand 3 states. [2021-01-06 20:49:59,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:49:59,118 INFO L93 Difference]: Finished difference Result 99088 states and 134952 transitions. [2021-01-06 20:49:59,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:49:59,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2021-01-06 20:49:59,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:49:59,199 INFO L225 Difference]: With dead ends: 99088 [2021-01-06 20:49:59,199 INFO L226 Difference]: Without dead ends: 59327 [2021-01-06 20:49:59,225 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:49:59,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59327 states. [2021-01-06 20:50:03,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59327 to 57493. [2021-01-06 20:50:03,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57493 states. [2021-01-06 20:50:04,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57493 states to 57493 states and 77878 transitions. [2021-01-06 20:50:04,084 INFO L78 Accepts]: Start accepts. Automaton has 57493 states and 77878 transitions. Word has length 128 [2021-01-06 20:50:04,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:50:04,084 INFO L481 AbstractCegarLoop]: Abstraction has 57493 states and 77878 transitions. [2021-01-06 20:50:04,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:50:04,084 INFO L276 IsEmpty]: Start isEmpty. Operand 57493 states and 77878 transitions. [2021-01-06 20:50:04,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-01-06 20:50:04,130 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:50:04,130 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:50:04,130 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 20:50:04,130 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:50:04,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:50:04,130 INFO L82 PathProgramCache]: Analyzing trace with hash 593600719, now seen corresponding path program 1 times [2021-01-06 20:50:04,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:50:04,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508644499] [2021-01-06 20:50:04,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:50:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:50:04,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:50:04,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508644499] [2021-01-06 20:50:04,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:50:04,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 20:50:04,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680514607] [2021-01-06 20:50:04,408 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 20:50:04,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:50:04,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 20:50:04,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-06 20:50:04,409 INFO L87 Difference]: Start difference. First operand 57493 states and 77878 transitions. Second operand 6 states. [2021-01-06 20:50:17,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:50:17,773 INFO L93 Difference]: Finished difference Result 215718 states and 291004 transitions. [2021-01-06 20:50:17,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:50:17,774 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2021-01-06 20:50:17,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:50:18,138 INFO L225 Difference]: With dead ends: 215718 [2021-01-06 20:50:18,138 INFO L226 Difference]: Without dead ends: 158291 [2021-01-06 20:50:18,206 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2021-01-06 20:50:18,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158291 states. [2021-01-06 20:50:29,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158291 to 134219. [2021-01-06 20:50:29,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134219 states. [2021-01-06 20:50:30,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134219 states to 134219 states and 180330 transitions. [2021-01-06 20:50:30,354 INFO L78 Accepts]: Start accepts. Automaton has 134219 states and 180330 transitions. Word has length 128 [2021-01-06 20:50:30,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:50:30,355 INFO L481 AbstractCegarLoop]: Abstraction has 134219 states and 180330 transitions. [2021-01-06 20:50:30,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 20:50:30,355 INFO L276 IsEmpty]: Start isEmpty. Operand 134219 states and 180330 transitions. [2021-01-06 20:50:30,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-01-06 20:50:30,453 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:50:30,454 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:50:30,454 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 20:50:30,454 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:50:30,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:50:30,454 INFO L82 PathProgramCache]: Analyzing trace with hash 568982681, now seen corresponding path program 1 times [2021-01-06 20:50:30,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:50:30,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655025344] [2021-01-06 20:50:30,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:50:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:50:30,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:50:30,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655025344] [2021-01-06 20:50:30,644 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:50:30,644 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 20:50:30,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585047527] [2021-01-06 20:50:30,645 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 20:50:30,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:50:30,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 20:50:30,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-06 20:50:30,646 INFO L87 Difference]: Start difference. First operand 134219 states and 180330 transitions. Second operand 7 states. [2021-01-06 20:50:49,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:50:49,132 INFO L93 Difference]: Finished difference Result 230780 states and 310378 transitions. [2021-01-06 20:50:49,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 20:50:49,132 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 128 [2021-01-06 20:50:49,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:50:49,636 INFO L225 Difference]: With dead ends: 230780 [2021-01-06 20:50:49,636 INFO L226 Difference]: Without dead ends: 209186 [2021-01-06 20:50:49,691 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-01-06 20:50:49,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209186 states. [2021-01-06 20:51:04,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209186 to 155126. [2021-01-06 20:51:04,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155126 states. [2021-01-06 20:51:04,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155126 states to 155126 states and 207989 transitions. [2021-01-06 20:51:04,804 INFO L78 Accepts]: Start accepts. Automaton has 155126 states and 207989 transitions. Word has length 128 [2021-01-06 20:51:04,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:51:04,804 INFO L481 AbstractCegarLoop]: Abstraction has 155126 states and 207989 transitions. [2021-01-06 20:51:04,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 20:51:04,804 INFO L276 IsEmpty]: Start isEmpty. Operand 155126 states and 207989 transitions. [2021-01-06 20:51:04,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-01-06 20:51:04,917 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:51:04,918 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:51:04,918 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 20:51:04,918 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:51:04,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:51:04,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1767896909, now seen corresponding path program 1 times [2021-01-06 20:51:04,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:51:04,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786237477] [2021-01-06 20:51:04,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:51:05,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:51:05,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:51:05,395 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786237477] [2021-01-06 20:51:05,395 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:51:05,395 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:51:05,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329720148] [2021-01-06 20:51:05,396 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:51:05,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:51:05,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:51:05,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:51:05,397 INFO L87 Difference]: Start difference. First operand 155126 states and 207989 transitions. Second operand 3 states.