/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.8.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 21:16:15,445 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 21:16:15,448 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 21:16:15,482 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 21:16:15,483 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 21:16:15,484 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 21:16:15,486 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 21:16:15,489 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 21:16:15,491 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 21:16:15,492 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 21:16:15,493 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 21:16:15,495 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 21:16:15,495 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 21:16:15,497 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 21:16:15,498 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 21:16:15,499 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 21:16:15,500 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 21:16:15,535 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 21:16:15,542 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 21:16:15,547 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 21:16:15,560 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 21:16:15,566 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 21:16:15,567 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 21:16:15,568 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 21:16:15,576 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 21:16:15,577 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 21:16:15,577 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 21:16:15,578 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 21:16:15,584 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 21:16:15,586 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 21:16:15,586 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 21:16:15,587 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 21:16:15,588 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 21:16:15,589 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 21:16:15,590 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 21:16:15,590 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 21:16:15,591 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 21:16:15,591 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 21:16:15,591 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 21:16:15,592 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 21:16:15,593 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 21:16:15,594 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 21:16:15,620 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 21:16:15,620 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 21:16:15,622 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 21:16:15,622 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 21:16:15,622 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 21:16:15,623 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 21:16:15,623 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 21:16:15,623 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 21:16:15,623 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 21:16:15,624 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 21:16:15,624 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 21:16:15,624 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 21:16:15,625 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 21:16:15,625 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 21:16:15,625 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 21:16:15,625 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 21:16:15,626 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 21:16:15,626 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 21:16:15,626 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 21:16:15,627 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 21:16:15,627 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 21:16:15,627 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 21:16:15,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 21:16:15,628 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 21:16:15,628 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 21:16:15,628 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 21:16:16,009 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 21:16:16,054 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 21:16:16,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 21:16:16,059 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 21:16:16,059 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 21:16:16,060 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.8.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2021-01-06 21:16:16,144 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/6ca011f4a/63ec89484b3848f89fc1f937c5624d5e/FLAGf5e6988ea [2021-01-06 21:16:16,771 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 21:16:16,772 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2021-01-06 21:16:16,805 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/6ca011f4a/63ec89484b3848f89fc1f937c5624d5e/FLAGf5e6988ea [2021-01-06 21:16:17,015 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/6ca011f4a/63ec89484b3848f89fc1f937c5624d5e [2021-01-06 21:16:17,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 21:16:17,020 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 21:16:17,021 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 21:16:17,022 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 21:16:17,025 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 21:16:17,026 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 09:16:17" (1/1) ... [2021-01-06 21:16:17,027 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bbdc411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:16:17, skipping insertion in model container [2021-01-06 21:16:17,027 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 09:16:17" (1/1) ... [2021-01-06 21:16:17,036 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 21:16:17,113 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[~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[~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[~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[~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[~id6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_60836~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[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_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[~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[~node2__m2~0,] 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[~node3__m3~0,] 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[~node4__m4~0,] 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[~node5__m5~0,] 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[~node6__m6~0,] left hand side expression in assignment: lhs: VariableLHS[~node6____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node7__m7~0,] left hand side expression in assignment: lhs: VariableLHS[~node7____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node8__m8~0,] left hand side expression in assignment: lhs: VariableLHS[~node8____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p8_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode8~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[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_60999~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[~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[~p8_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[~node6__m6~1,] left hand side expression in assignment: lhs: VariableLHS[~node6__m6~1,] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node7__m7~1,] left hand side expression in assignment: lhs: VariableLHS[~node7__m7~1,] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node8__m8~1,] left hand side expression in assignment: lhs: VariableLHS[~node8__m8~1,] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode8~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[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~__return_61281~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,] [2021-01-06 21:16:17,418 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.8.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[11276,11289] 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[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~2,] left hand side expression in assignment: lhs: VariableLHS[~p8_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[~node6__m6~2,] left hand side expression in assignment: lhs: VariableLHS[~node6__m6~2,] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node7__m7~2,] left hand side expression in assignment: lhs: VariableLHS[~node7__m7~2,] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node7____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node7____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~st5~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[~st4~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[~st3~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[~st2~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[~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[~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[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~st8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node8____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p8_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node8____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~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[~node8____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node7____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node6____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] [2021-01-06 21:16:17,515 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 21:16:17,533 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[~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[~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[~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[~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[~id6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_60836~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[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_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[~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[~node2__m2~0,] 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[~node3__m3~0,] 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[~node4__m4~0,] 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[~node5__m5~0,] 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[~node6__m6~0,] left hand side expression in assignment: lhs: VariableLHS[~node6____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node7__m7~0,] left hand side expression in assignment: lhs: VariableLHS[~node7____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node8__m8~0,] left hand side expression in assignment: lhs: VariableLHS[~node8____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p8_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode8~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[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_60999~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[~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[~p8_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[~node6__m6~1,] left hand side expression in assignment: lhs: VariableLHS[~node6__m6~1,] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node7__m7~1,] left hand side expression in assignment: lhs: VariableLHS[~node7__m7~1,] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node8__m8~1,] left hand side expression in assignment: lhs: VariableLHS[~node8__m8~1,] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode8~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[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~__return_61281~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,] [2021-01-06 21:16:17,676 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.8.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[11276,11289] 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[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~2,] left hand side expression in assignment: lhs: VariableLHS[~p8_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[~node6__m6~2,] left hand side expression in assignment: lhs: VariableLHS[~node6__m6~2,] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node7__m7~2,] left hand side expression in assignment: lhs: VariableLHS[~node7__m7~2,] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node7____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node7____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~st5~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[~st4~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[~st3~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[~st2~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[~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[~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[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~st8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node8____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p8_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node8____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~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[~node8____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node7____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node6____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] [2021-01-06 21:16:17,770 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 21:16:17,794 INFO L208 MainTranslator]: Completed translation [2021-01-06 21:16:17,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:16:17 WrapperNode [2021-01-06 21:16:17,795 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 21:16:17,796 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 21:16:17,796 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 21:16:17,797 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 21:16:17,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:16:17" (1/1) ... [2021-01-06 21:16:17,838 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:16:17" (1/1) ... [2021-01-06 21:16:17,945 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 21:16:17,945 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 21:16:17,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 21:16:17,946 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 21:16:17,967 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:16:17" (1/1) ... [2021-01-06 21:16:17,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:16:17" (1/1) ... [2021-01-06 21:16:17,978 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:16:17" (1/1) ... [2021-01-06 21:16:17,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:16:17" (1/1) ... [2021-01-06 21:16:17,999 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:16:17" (1/1) ... [2021-01-06 21:16:18,009 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:16:17" (1/1) ... [2021-01-06 21:16:18,014 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:16:17" (1/1) ... [2021-01-06 21:16:18,021 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 21:16:18,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 21:16:18,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 21:16:18,022 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 21:16:18,023 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:16:17" (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 21:16:18,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 21:16:18,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 21:16:18,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 21:16:18,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 21:16:19,372 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 21:16:19,372 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-01-06 21:16:19,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 09:16:19 BoogieIcfgContainer [2021-01-06 21:16:19,375 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 21:16:19,376 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 21:16:19,377 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 21:16:19,380 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 21:16:19,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 09:16:17" (1/3) ... [2021-01-06 21:16:19,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1041025 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 09:16:19, skipping insertion in model container [2021-01-06 21:16:19,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:16:17" (2/3) ... [2021-01-06 21:16:19,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1041025 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 09:16:19, skipping insertion in model container [2021-01-06 21:16:19,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 09:16:19" (3/3) ... [2021-01-06 21:16:19,383 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2021-01-06 21:16:19,397 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 21:16:19,408 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 21:16:19,436 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 21:16:19,465 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 21:16:19,465 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 21:16:19,465 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 21:16:19,465 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 21:16:19,466 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 21:16:19,466 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 21:16:19,466 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 21:16:19,466 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 21:16:19,491 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states. [2021-01-06 21:16:19,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-01-06 21:16:19,504 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:16:19,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] [2021-01-06 21:16:19,506 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:16:19,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:16:19,513 INFO L82 PathProgramCache]: Analyzing trace with hash 96284054, now seen corresponding path program 1 times [2021-01-06 21:16:19,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:16:19,523 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440391006] [2021-01-06 21:16:19,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:16:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:16:20,211 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 21:16:20,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440391006] [2021-01-06 21:16:20,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:16:20,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:16:20,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843731982] [2021-01-06 21:16:20,220 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:16:20,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:16:20,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:16:20,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:16:20,238 INFO L87 Difference]: Start difference. First operand 231 states. Second operand 3 states. [2021-01-06 21:16:20,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:16:20,415 INFO L93 Difference]: Finished difference Result 446 states and 748 transitions. [2021-01-06 21:16:20,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:16:20,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2021-01-06 21:16:20,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:16:20,437 INFO L225 Difference]: With dead ends: 446 [2021-01-06 21:16:20,437 INFO L226 Difference]: Without dead ends: 346 [2021-01-06 21:16:20,441 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 21:16:20,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2021-01-06 21:16:20,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 344. [2021-01-06 21:16:20,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2021-01-06 21:16:20,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 495 transitions. [2021-01-06 21:16:20,521 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 495 transitions. Word has length 124 [2021-01-06 21:16:20,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:16:20,522 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 495 transitions. [2021-01-06 21:16:20,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:16:20,522 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 495 transitions. [2021-01-06 21:16:20,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-01-06 21:16:20,526 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:16:20,526 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] [2021-01-06 21:16:20,526 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 21:16:20,527 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:16:20,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:16:20,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1563387348, now seen corresponding path program 1 times [2021-01-06 21:16:20,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:16:20,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85298787] [2021-01-06 21:16:20,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:16:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:16:20,794 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 21:16:20,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85298787] [2021-01-06 21:16:20,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:16:20,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:16:20,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229499718] [2021-01-06 21:16:20,797 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:16:20,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:16:20,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:16:20,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:16:20,798 INFO L87 Difference]: Start difference. First operand 344 states and 495 transitions. Second operand 5 states. [2021-01-06 21:16:21,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:16:21,034 INFO L93 Difference]: Finished difference Result 593 states and 887 transitions. [2021-01-06 21:16:21,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:16:21,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2021-01-06 21:16:21,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:16:21,039 INFO L225 Difference]: With dead ends: 593 [2021-01-06 21:16:21,039 INFO L226 Difference]: Without dead ends: 344 [2021-01-06 21:16:21,041 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 21:16:21,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2021-01-06 21:16:21,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2021-01-06 21:16:21,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2021-01-06 21:16:21,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 492 transitions. [2021-01-06 21:16:21,068 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 492 transitions. Word has length 126 [2021-01-06 21:16:21,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:16:21,069 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 492 transitions. [2021-01-06 21:16:21,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:16:21,069 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 492 transitions. [2021-01-06 21:16:21,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 21:16:21,072 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:16:21,072 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 21:16:21,073 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 21:16:21,073 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:16:21,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:16:21,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1653467386, now seen corresponding path program 1 times [2021-01-06 21:16:21,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:16:21,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947310725] [2021-01-06 21:16:21,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:16:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:16:21,247 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 21:16:21,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947310725] [2021-01-06 21:16:21,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:16:21,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:16:21,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072182664] [2021-01-06 21:16:21,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:16:21,250 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:16:21,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:16:21,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:16:21,251 INFO L87 Difference]: Start difference. First operand 344 states and 492 transitions. Second operand 5 states. [2021-01-06 21:16:21,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:16:21,458 INFO L93 Difference]: Finished difference Result 601 states and 891 transitions. [2021-01-06 21:16:21,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:16:21,458 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2021-01-06 21:16:21,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:16:21,461 INFO L225 Difference]: With dead ends: 601 [2021-01-06 21:16:21,461 INFO L226 Difference]: Without dead ends: 344 [2021-01-06 21:16:21,463 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 21:16:21,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2021-01-06 21:16:21,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2021-01-06 21:16:21,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2021-01-06 21:16:21,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 489 transitions. [2021-01-06 21:16:21,485 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 489 transitions. Word has length 127 [2021-01-06 21:16:21,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:16:21,485 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 489 transitions. [2021-01-06 21:16:21,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:16:21,485 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 489 transitions. [2021-01-06 21:16:21,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-01-06 21:16:21,488 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:16:21,489 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 21:16:21,489 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 21:16:21,489 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:16:21,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:16:21,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1375492460, now seen corresponding path program 1 times [2021-01-06 21:16:21,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:16:21,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451918966] [2021-01-06 21:16:21,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:16:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:16:21,676 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 21:16:21,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451918966] [2021-01-06 21:16:21,677 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:16:21,677 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:16:21,677 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483985244] [2021-01-06 21:16:21,678 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 21:16:21,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:16:21,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 21:16:21,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-06 21:16:21,680 INFO L87 Difference]: Start difference. First operand 344 states and 489 transitions. Second operand 6 states. [2021-01-06 21:16:22,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:16:22,007 INFO L93 Difference]: Finished difference Result 852 states and 1272 transitions. [2021-01-06 21:16:22,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:16:22,009 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2021-01-06 21:16:22,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:16:22,012 INFO L225 Difference]: With dead ends: 852 [2021-01-06 21:16:22,013 INFO L226 Difference]: Without dead ends: 575 [2021-01-06 21:16:22,014 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 21:16:22,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2021-01-06 21:16:22,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 573. [2021-01-06 21:16:22,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2021-01-06 21:16:22,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 847 transitions. [2021-01-06 21:16:22,066 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 847 transitions. Word has length 128 [2021-01-06 21:16:22,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:16:22,067 INFO L481 AbstractCegarLoop]: Abstraction has 573 states and 847 transitions. [2021-01-06 21:16:22,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 21:16:22,067 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 847 transitions. [2021-01-06 21:16:22,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-01-06 21:16:22,070 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:16:22,071 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, 1] [2021-01-06 21:16:22,071 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 21:16:22,071 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:16:22,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:16:22,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1287483718, now seen corresponding path program 1 times [2021-01-06 21:16:22,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:16:22,073 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996568488] [2021-01-06 21:16:22,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:16:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:16:22,302 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 21:16:22,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996568488] [2021-01-06 21:16:22,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:16:22,303 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:16:22,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570385121] [2021-01-06 21:16:22,304 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 21:16:22,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:16:22,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 21:16:22,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-06 21:16:22,305 INFO L87 Difference]: Start difference. First operand 573 states and 847 transitions. Second operand 6 states. [2021-01-06 21:16:22,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:16:22,630 INFO L93 Difference]: Finished difference Result 1451 states and 2212 transitions. [2021-01-06 21:16:22,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:16:22,630 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2021-01-06 21:16:22,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:16:22,636 INFO L225 Difference]: With dead ends: 1451 [2021-01-06 21:16:22,636 INFO L226 Difference]: Without dead ends: 961 [2021-01-06 21:16:22,638 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 21:16:22,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2021-01-06 21:16:22,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 959. [2021-01-06 21:16:22,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2021-01-06 21:16:22,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1446 transitions. [2021-01-06 21:16:22,709 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1446 transitions. Word has length 129 [2021-01-06 21:16:22,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:16:22,710 INFO L481 AbstractCegarLoop]: Abstraction has 959 states and 1446 transitions. [2021-01-06 21:16:22,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 21:16:22,710 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1446 transitions. [2021-01-06 21:16:22,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-01-06 21:16:22,712 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:16:22,712 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, 1, 1] [2021-01-06 21:16:22,712 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 21:16:22,713 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:16:22,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:16:22,713 INFO L82 PathProgramCache]: Analyzing trace with hash -937280724, now seen corresponding path program 1 times [2021-01-06 21:16:22,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:16:22,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066644364] [2021-01-06 21:16:22,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:16:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:16:22,867 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 21:16:22,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066644364] [2021-01-06 21:16:22,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:16:22,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:16:22,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689793667] [2021-01-06 21:16:22,869 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 21:16:22,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:16:22,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 21:16:22,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-06 21:16:22,870 INFO L87 Difference]: Start difference. First operand 959 states and 1446 transitions. Second operand 6 states. [2021-01-06 21:16:23,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:16:23,270 INFO L93 Difference]: Finished difference Result 2629 states and 4039 transitions. [2021-01-06 21:16:23,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:16:23,270 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2021-01-06 21:16:23,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:16:23,280 INFO L225 Difference]: With dead ends: 2629 [2021-01-06 21:16:23,280 INFO L226 Difference]: Without dead ends: 1749 [2021-01-06 21:16:23,282 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 21:16:23,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1749 states. [2021-01-06 21:16:23,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1749 to 1747. [2021-01-06 21:16:23,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1747 states. [2021-01-06 21:16:23,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1747 states to 1747 states and 2665 transitions. [2021-01-06 21:16:23,416 INFO L78 Accepts]: Start accepts. Automaton has 1747 states and 2665 transitions. Word has length 130 [2021-01-06 21:16:23,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:16:23,416 INFO L481 AbstractCegarLoop]: Abstraction has 1747 states and 2665 transitions. [2021-01-06 21:16:23,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 21:16:23,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1747 states and 2665 transitions. [2021-01-06 21:16:23,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-01-06 21:16:23,419 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:16:23,419 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, 1, 1, 1] [2021-01-06 21:16:23,419 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 21:16:23,419 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:16:23,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:16:23,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1054057838, now seen corresponding path program 1 times [2021-01-06 21:16:23,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:16:23,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105689895] [2021-01-06 21:16:23,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:16:23,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:16:23,611 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 21:16:23,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105689895] [2021-01-06 21:16:23,612 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:16:23,614 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:16:23,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887636907] [2021-01-06 21:16:23,616 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 21:16:23,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:16:23,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 21:16:23,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-06 21:16:23,617 INFO L87 Difference]: Start difference. First operand 1747 states and 2665 transitions. Second operand 6 states. [2021-01-06 21:16:24,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:16:24,124 INFO L93 Difference]: Finished difference Result 4773 states and 7349 transitions. [2021-01-06 21:16:24,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:16:24,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2021-01-06 21:16:24,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:16:24,140 INFO L225 Difference]: With dead ends: 4773 [2021-01-06 21:16:24,140 INFO L226 Difference]: Without dead ends: 3117 [2021-01-06 21:16:24,144 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 21:16:24,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3117 states. [2021-01-06 21:16:24,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3117 to 3115. [2021-01-06 21:16:24,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2021-01-06 21:16:24,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 4760 transitions. [2021-01-06 21:16:24,379 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 4760 transitions. Word has length 131 [2021-01-06 21:16:24,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:16:24,380 INFO L481 AbstractCegarLoop]: Abstraction has 3115 states and 4760 transitions. [2021-01-06 21:16:24,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 21:16:24,381 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 4760 transitions. [2021-01-06 21:16:24,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-01-06 21:16:24,384 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:16:24,384 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, 1, 1, 1, 1] [2021-01-06 21:16:24,384 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 21:16:24,384 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:16:24,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:16:24,385 INFO L82 PathProgramCache]: Analyzing trace with hash -139208048, now seen corresponding path program 1 times [2021-01-06 21:16:24,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:16:24,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716839698] [2021-01-06 21:16:24,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:16:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:16:24,550 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 21:16:24,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716839698] [2021-01-06 21:16:24,551 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:16:24,551 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:16:24,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386387811] [2021-01-06 21:16:24,552 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:16:24,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:16:24,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:16:24,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:16:24,554 INFO L87 Difference]: Start difference. First operand 3115 states and 4760 transitions. Second operand 5 states. [2021-01-06 21:16:25,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:16:25,004 INFO L93 Difference]: Finished difference Result 6155 states and 9443 transitions. [2021-01-06 21:16:25,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:16:25,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2021-01-06 21:16:25,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:16:25,020 INFO L225 Difference]: With dead ends: 6155 [2021-01-06 21:16:25,020 INFO L226 Difference]: Without dead ends: 3115 [2021-01-06 21:16:25,025 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 21:16:25,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3115 states. [2021-01-06 21:16:25,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3115 to 3115. [2021-01-06 21:16:25,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2021-01-06 21:16:25,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 4727 transitions. [2021-01-06 21:16:25,278 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 4727 transitions. Word has length 132 [2021-01-06 21:16:25,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:16:25,279 INFO L481 AbstractCegarLoop]: Abstraction has 3115 states and 4727 transitions. [2021-01-06 21:16:25,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:16:25,279 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 4727 transitions. [2021-01-06 21:16:25,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-01-06 21:16:25,283 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:16:25,283 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, 1, 1, 1, 1, 1] [2021-01-06 21:16:25,283 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 21:16:25,283 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:16:25,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:16:25,284 INFO L82 PathProgramCache]: Analyzing trace with hash 386157790, now seen corresponding path program 1 times [2021-01-06 21:16:25,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:16:25,284 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913784440] [2021-01-06 21:16:25,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:16:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:16:25,396 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 21:16:25,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913784440] [2021-01-06 21:16:25,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:16:25,397 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:16:25,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122279153] [2021-01-06 21:16:25,398 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:16:25,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:16:25,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:16:25,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:16:25,399 INFO L87 Difference]: Start difference. First operand 3115 states and 4727 transitions. Second operand 5 states. [2021-01-06 21:16:25,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:16:25,956 INFO L93 Difference]: Finished difference Result 6159 states and 9382 transitions. [2021-01-06 21:16:25,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:16:25,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2021-01-06 21:16:25,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:16:25,974 INFO L225 Difference]: With dead ends: 6159 [2021-01-06 21:16:25,975 INFO L226 Difference]: Without dead ends: 3115 [2021-01-06 21:16:25,980 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 21:16:25,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3115 states. [2021-01-06 21:16:26,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3115 to 3115. [2021-01-06 21:16:26,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2021-01-06 21:16:26,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 4694 transitions. [2021-01-06 21:16:26,292 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 4694 transitions. Word has length 133 [2021-01-06 21:16:26,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:16:26,293 INFO L481 AbstractCegarLoop]: Abstraction has 3115 states and 4694 transitions. [2021-01-06 21:16:26,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:16:26,293 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 4694 transitions. [2021-01-06 21:16:26,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-01-06 21:16:26,296 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:16:26,296 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, 1, 1, 1, 1, 1, 1] [2021-01-06 21:16:26,296 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 21:16:26,297 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:16:26,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:16:26,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1981300572, now seen corresponding path program 1 times [2021-01-06 21:16:26,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:16:26,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863029197] [2021-01-06 21:16:26,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:16:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:16:26,588 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 21:16:26,588 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863029197] [2021-01-06 21:16:26,589 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:16:26,589 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 21:16:26,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864228991] [2021-01-06 21:16:26,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 21:16:26,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:16:26,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 21:16:26,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-01-06 21:16:26,591 INFO L87 Difference]: Start difference. First operand 3115 states and 4694 transitions. Second operand 10 states. [2021-01-06 21:16:29,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:16:29,446 INFO L93 Difference]: Finished difference Result 26465 states and 40231 transitions. [2021-01-06 21:16:29,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 21:16:29,447 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 134 [2021-01-06 21:16:29,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:16:29,547 INFO L225 Difference]: With dead ends: 26465 [2021-01-06 21:16:29,548 INFO L226 Difference]: Without dead ends: 23743 [2021-01-06 21:16:29,559 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2021-01-06 21:16:29,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23743 states. [2021-01-06 21:16:30,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23743 to 4502. [2021-01-06 21:16:30,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4502 states. [2021-01-06 21:16:30,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4502 states to 4502 states and 6814 transitions. [2021-01-06 21:16:30,518 INFO L78 Accepts]: Start accepts. Automaton has 4502 states and 6814 transitions. Word has length 134 [2021-01-06 21:16:30,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:16:30,518 INFO L481 AbstractCegarLoop]: Abstraction has 4502 states and 6814 transitions. [2021-01-06 21:16:30,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 21:16:30,518 INFO L276 IsEmpty]: Start isEmpty. Operand 4502 states and 6814 transitions. [2021-01-06 21:16:30,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-01-06 21:16:30,522 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:16:30,522 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, 1, 1, 1, 1, 1, 1] [2021-01-06 21:16:30,522 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 21:16:30,522 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:16:30,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:16:30,523 INFO L82 PathProgramCache]: Analyzing trace with hash -35796984, now seen corresponding path program 1 times [2021-01-06 21:16:30,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:16:30,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965381424] [2021-01-06 21:16:30,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:16:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:16:30,797 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 21:16:30,798 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965381424] [2021-01-06 21:16:30,798 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:16:30,798 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 21:16:30,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652768609] [2021-01-06 21:16:30,799 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 21:16:30,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:16:30,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 21:16:30,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-01-06 21:16:30,800 INFO L87 Difference]: Start difference. First operand 4502 states and 6814 transitions. Second operand 10 states. [2021-01-06 21:16:34,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:16:34,329 INFO L93 Difference]: Finished difference Result 27605 states and 41983 transitions. [2021-01-06 21:16:34,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 21:16:34,330 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 134 [2021-01-06 21:16:34,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:16:34,386 INFO L225 Difference]: With dead ends: 27605 [2021-01-06 21:16:34,387 INFO L226 Difference]: Without dead ends: 24883 [2021-01-06 21:16:34,397 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2021-01-06 21:16:34,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24883 states. [2021-01-06 21:16:35,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24883 to 7485. [2021-01-06 21:16:35,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7485 states. [2021-01-06 21:16:35,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7485 states to 7485 states and 11374 transitions. [2021-01-06 21:16:35,684 INFO L78 Accepts]: Start accepts. Automaton has 7485 states and 11374 transitions. Word has length 134 [2021-01-06 21:16:35,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:16:35,684 INFO L481 AbstractCegarLoop]: Abstraction has 7485 states and 11374 transitions. [2021-01-06 21:16:35,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 21:16:35,685 INFO L276 IsEmpty]: Start isEmpty. Operand 7485 states and 11374 transitions. [2021-01-06 21:16:35,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-01-06 21:16:35,689 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:16:35,689 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, 1, 1, 1, 1, 1, 1] [2021-01-06 21:16:35,690 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 21:16:35,690 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:16:35,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:16:35,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1520043662, now seen corresponding path program 1 times [2021-01-06 21:16:35,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:16:35,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473595216] [2021-01-06 21:16:35,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:16:35,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:16:35,935 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 21:16:35,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473595216] [2021-01-06 21:16:35,936 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:16:35,936 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 21:16:35,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128912922] [2021-01-06 21:16:35,937 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 21:16:35,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:16:35,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 21:16:35,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-01-06 21:16:35,938 INFO L87 Difference]: Start difference. First operand 7485 states and 11374 transitions. Second operand 10 states. [2021-01-06 21:16:39,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:16:39,608 INFO L93 Difference]: Finished difference Result 28929 states and 44005 transitions. [2021-01-06 21:16:39,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 21:16:39,609 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 134 [2021-01-06 21:16:39,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:16:39,653 INFO L225 Difference]: With dead ends: 28929 [2021-01-06 21:16:39,653 INFO L226 Difference]: Without dead ends: 26207 [2021-01-06 21:16:39,666 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2021-01-06 21:16:39,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26207 states. [2021-01-06 21:16:41,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26207 to 8935. [2021-01-06 21:16:41,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8935 states. [2021-01-06 21:16:41,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8935 states to 8935 states and 13590 transitions. [2021-01-06 21:16:41,477 INFO L78 Accepts]: Start accepts. Automaton has 8935 states and 13590 transitions. Word has length 134 [2021-01-06 21:16:41,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:16:41,478 INFO L481 AbstractCegarLoop]: Abstraction has 8935 states and 13590 transitions. [2021-01-06 21:16:41,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 21:16:41,478 INFO L276 IsEmpty]: Start isEmpty. Operand 8935 states and 13590 transitions. [2021-01-06 21:16:41,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-01-06 21:16:41,483 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:16:41,483 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, 1, 1, 1, 1, 1, 1] [2021-01-06 21:16:41,484 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 21:16:41,484 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:16:41,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:16:41,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1042374816, now seen corresponding path program 1 times [2021-01-06 21:16:41,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:16:41,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105694365] [2021-01-06 21:16:41,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:16:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:16:41,729 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 21:16:41,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105694365] [2021-01-06 21:16:41,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:16:41,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 21:16:41,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549068523] [2021-01-06 21:16:41,730 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 21:16:41,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:16:41,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 21:16:41,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-01-06 21:16:41,731 INFO L87 Difference]: Start difference. First operand 8935 states and 13590 transitions. Second operand 10 states. [2021-01-06 21:16:45,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:16:45,952 INFO L93 Difference]: Finished difference Result 29883 states and 45467 transitions. [2021-01-06 21:16:45,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 21:16:45,952 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 134 [2021-01-06 21:16:45,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:16:45,994 INFO L225 Difference]: With dead ends: 29883 [2021-01-06 21:16:45,994 INFO L226 Difference]: Without dead ends: 27161 [2021-01-06 21:16:46,007 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2021-01-06 21:16:46,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27161 states. [2021-01-06 21:16:47,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27161 to 10335. [2021-01-06 21:16:47,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10335 states. [2021-01-06 21:16:47,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10335 states to 10335 states and 15726 transitions. [2021-01-06 21:16:47,543 INFO L78 Accepts]: Start accepts. Automaton has 10335 states and 15726 transitions. Word has length 134 [2021-01-06 21:16:47,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:16:47,544 INFO L481 AbstractCegarLoop]: Abstraction has 10335 states and 15726 transitions. [2021-01-06 21:16:47,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 21:16:47,544 INFO L276 IsEmpty]: Start isEmpty. Operand 10335 states and 15726 transitions. [2021-01-06 21:16:47,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-01-06 21:16:47,549 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:16:47,549 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, 1, 1, 1, 1, 1, 1] [2021-01-06 21:16:47,550 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 21:16:47,550 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:16:47,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:16:47,551 INFO L82 PathProgramCache]: Analyzing trace with hash -405814938, now seen corresponding path program 1 times [2021-01-06 21:16:47,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:16:47,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492077630] [2021-01-06 21:16:47,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:16:47,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:16:47,777 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 21:16:47,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492077630] [2021-01-06 21:16:47,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:16:47,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 21:16:47,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492731708] [2021-01-06 21:16:47,778 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 21:16:47,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:16:47,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 21:16:47,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-01-06 21:16:47,779 INFO L87 Difference]: Start difference. First operand 10335 states and 15726 transitions. Second operand 10 states. [2021-01-06 21:16:52,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:16:52,777 INFO L93 Difference]: Finished difference Result 31115 states and 47355 transitions. [2021-01-06 21:16:52,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 21:16:52,778 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 134 [2021-01-06 21:16:52,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:16:52,829 INFO L225 Difference]: With dead ends: 31115 [2021-01-06 21:16:52,829 INFO L226 Difference]: Without dead ends: 28393 [2021-01-06 21:16:52,840 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2021-01-06 21:16:52,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28393 states. [2021-01-06 21:16:54,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28393 to 11727. [2021-01-06 21:16:54,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11727 states. [2021-01-06 21:16:54,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11727 states to 11727 states and 17854 transitions. [2021-01-06 21:16:54,789 INFO L78 Accepts]: Start accepts. Automaton has 11727 states and 17854 transitions. Word has length 134 [2021-01-06 21:16:54,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:16:54,789 INFO L481 AbstractCegarLoop]: Abstraction has 11727 states and 17854 transitions. [2021-01-06 21:16:54,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 21:16:54,790 INFO L276 IsEmpty]: Start isEmpty. Operand 11727 states and 17854 transitions. [2021-01-06 21:16:54,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-01-06 21:16:54,796 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:16:54,796 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, 1, 1, 1, 1, 1, 1] [2021-01-06 21:16:54,796 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 21:16:54,797 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:16:54,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:16:54,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1745679121, now seen corresponding path program 1 times [2021-01-06 21:16:54,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:16:54,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612300501] [2021-01-06 21:16:54,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:16:54,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:16:54,896 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 21:16:54,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612300501] [2021-01-06 21:16:54,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:16:54,897 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:16:54,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601085453] [2021-01-06 21:16:54,897 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:16:54,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:16:54,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:16:54,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:16:54,898 INFO L87 Difference]: Start difference. First operand 11727 states and 17854 transitions. Second operand 3 states. [2021-01-06 21:16:58,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:16:58,033 INFO L93 Difference]: Finished difference Result 31155 states and 47536 transitions. [2021-01-06 21:16:58,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:16:58,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2021-01-06 21:16:58,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:16:58,052 INFO L225 Difference]: With dead ends: 31155 [2021-01-06 21:16:58,052 INFO L226 Difference]: Without dead ends: 20081 [2021-01-06 21:16:58,067 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 21:16:58,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20081 states. [2021-01-06 21:17:01,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20081 to 20079. [2021-01-06 21:17:01,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20079 states. [2021-01-06 21:17:01,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20079 states to 20079 states and 30398 transitions. [2021-01-06 21:17:01,138 INFO L78 Accepts]: Start accepts. Automaton has 20079 states and 30398 transitions. Word has length 134 [2021-01-06 21:17:01,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:17:01,138 INFO L481 AbstractCegarLoop]: Abstraction has 20079 states and 30398 transitions. [2021-01-06 21:17:01,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:17:01,138 INFO L276 IsEmpty]: Start isEmpty. Operand 20079 states and 30398 transitions. [2021-01-06 21:17:01,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-01-06 21:17:01,143 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:17:01,144 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, 1, 1, 1, 1, 1, 1] [2021-01-06 21:17:01,144 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 21:17:01,144 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:17:01,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:17:01,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1465375602, now seen corresponding path program 1 times [2021-01-06 21:17:01,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:17:01,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7673633] [2021-01-06 21:17:01,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:17:01,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:17:01,211 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 21:17:01,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7673633] [2021-01-06 21:17:01,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:17:01,212 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:17:01,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195091007] [2021-01-06 21:17:01,213 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:17:01,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:17:01,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:17:01,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:17:01,214 INFO L87 Difference]: Start difference. First operand 20079 states and 30398 transitions. Second operand 3 states. [2021-01-06 21:17:07,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:17:07,569 INFO L93 Difference]: Finished difference Result 57523 states and 86944 transitions. [2021-01-06 21:17:07,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:17:07,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2021-01-06 21:17:07,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:17:07,606 INFO L225 Difference]: With dead ends: 57523 [2021-01-06 21:17:07,606 INFO L226 Difference]: Without dead ends: 38097 [2021-01-06 21:17:07,625 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 21:17:07,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38097 states. [2021-01-06 21:17:14,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38097 to 37647. [2021-01-06 21:17:14,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37647 states. [2021-01-06 21:17:14,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37647 states to 37647 states and 56398 transitions. [2021-01-06 21:17:14,125 INFO L78 Accepts]: Start accepts. Automaton has 37647 states and 56398 transitions. Word has length 134 [2021-01-06 21:17:14,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:17:14,126 INFO L481 AbstractCegarLoop]: Abstraction has 37647 states and 56398 transitions. [2021-01-06 21:17:14,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:17:14,126 INFO L276 IsEmpty]: Start isEmpty. Operand 37647 states and 56398 transitions. [2021-01-06 21:17:14,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-01-06 21:17:14,131 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:17:14,131 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, 1, 1, 1, 1, 1, 1] [2021-01-06 21:17:14,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 21:17:14,131 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:17:14,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:17:14,132 INFO L82 PathProgramCache]: Analyzing trace with hash -674307358, now seen corresponding path program 1 times [2021-01-06 21:17:14,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:17:14,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618285184] [2021-01-06 21:17:14,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:17:14,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:17:14,442 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 21:17:14,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618285184] [2021-01-06 21:17:14,443 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:17:14,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 21:17:14,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880798985] [2021-01-06 21:17:14,443 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 21:17:14,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:17:14,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 21:17:14,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-01-06 21:17:14,444 INFO L87 Difference]: Start difference. First operand 37647 states and 56398 transitions. Second operand 10 states. [2021-01-06 21:17:32,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:17:32,919 INFO L93 Difference]: Finished difference Result 98987 states and 148535 transitions. [2021-01-06 21:17:32,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 21:17:32,920 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 134 [2021-01-06 21:17:32,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:17:33,006 INFO L225 Difference]: With dead ends: 98987 [2021-01-06 21:17:33,006 INFO L226 Difference]: Without dead ends: 91129 [2021-01-06 21:17:33,031 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2021-01-06 21:17:33,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91129 states. [2021-01-06 21:17:41,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91129 to 42999. [2021-01-06 21:17:41,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42999 states. [2021-01-06 21:17:41,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42999 states to 42999 states and 64414 transitions. [2021-01-06 21:17:41,700 INFO L78 Accepts]: Start accepts. Automaton has 42999 states and 64414 transitions. Word has length 134 [2021-01-06 21:17:41,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:17:41,701 INFO L481 AbstractCegarLoop]: Abstraction has 42999 states and 64414 transitions. [2021-01-06 21:17:41,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 21:17:41,701 INFO L276 IsEmpty]: Start isEmpty. Operand 42999 states and 64414 transitions. [2021-01-06 21:17:41,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-01-06 21:17:41,706 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:17:41,706 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, 1, 1, 1, 1, 1, 1] [2021-01-06 21:17:41,706 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 21:17:41,706 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:17:41,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:17:41,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1211224756, now seen corresponding path program 1 times [2021-01-06 21:17:41,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:17:41,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203842595] [2021-01-06 21:17:41,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:17:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:17:41,942 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 21:17:41,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203842595] [2021-01-06 21:17:41,943 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:17:41,943 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 21:17:41,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713685177] [2021-01-06 21:17:41,944 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 21:17:41,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:17:41,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 21:17:41,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-01-06 21:17:41,945 INFO L87 Difference]: Start difference. First operand 42999 states and 64414 transitions. Second operand 10 states. [2021-01-06 21:18:03,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:18:03,692 INFO L93 Difference]: Finished difference Result 104631 states and 156991 transitions. [2021-01-06 21:18:03,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 21:18:03,692 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 134 [2021-01-06 21:18:03,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:18:03,784 INFO L225 Difference]: With dead ends: 104631 [2021-01-06 21:18:03,784 INFO L226 Difference]: Without dead ends: 96773 [2021-01-06 21:18:03,807 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2021-01-06 21:18:03,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96773 states. [2021-01-06 21:18:14,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96773 to 48343. [2021-01-06 21:18:14,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48343 states. [2021-01-06 21:18:14,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48343 states to 48343 states and 72422 transitions. [2021-01-06 21:18:14,090 INFO L78 Accepts]: Start accepts. Automaton has 48343 states and 72422 transitions. Word has length 134 [2021-01-06 21:18:14,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:18:14,090 INFO L481 AbstractCegarLoop]: Abstraction has 48343 states and 72422 transitions. [2021-01-06 21:18:14,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 21:18:14,090 INFO L276 IsEmpty]: Start isEmpty. Operand 48343 states and 72422 transitions. [2021-01-06 21:18:14,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-01-06 21:18:14,096 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:18:14,096 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, 1, 1, 1, 1, 1, 1] [2021-01-06 21:18:14,096 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 21:18:14,097 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:18:14,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:18:14,097 INFO L82 PathProgramCache]: Analyzing trace with hash 54102074, now seen corresponding path program 1 times [2021-01-06 21:18:14,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:18:14,098 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348193249] [2021-01-06 21:18:14,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:18:14,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:18:14,334 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 21:18:14,335 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348193249] [2021-01-06 21:18:14,335 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:18:14,335 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 21:18:14,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031312360] [2021-01-06 21:18:14,336 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 21:18:14,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:18:14,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 21:18:14,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-01-06 21:18:14,337 INFO L87 Difference]: Start difference. First operand 48343 states and 72422 transitions. Second operand 10 states. [2021-01-06 21:18:39,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:18:39,381 INFO L93 Difference]: Finished difference Result 110981 states and 166527 transitions. [2021-01-06 21:18:39,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 21:18:39,382 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 134 [2021-01-06 21:18:39,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:18:39,488 INFO L225 Difference]: With dead ends: 110981 [2021-01-06 21:18:39,488 INFO L226 Difference]: Without dead ends: 103123 [2021-01-06 21:18:39,518 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2021-01-06 21:18:39,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103123 states. [2021-01-06 21:18:51,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103123 to 53770. [2021-01-06 21:18:51,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53770 states. [2021-01-06 21:18:51,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53770 states to 53770 states and 80558 transitions. [2021-01-06 21:18:51,880 INFO L78 Accepts]: Start accepts. Automaton has 53770 states and 80558 transitions. Word has length 134 [2021-01-06 21:18:51,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:18:51,880 INFO L481 AbstractCegarLoop]: Abstraction has 53770 states and 80558 transitions. [2021-01-06 21:18:51,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 21:18:51,880 INFO L276 IsEmpty]: Start isEmpty. Operand 53770 states and 80558 transitions. [2021-01-06 21:18:51,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-01-06 21:18:51,904 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:18:51,904 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, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:18:51,904 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 21:18:51,905 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:18:51,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:18:51,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1720431211, now seen corresponding path program 1 times [2021-01-06 21:18:51,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:18:51,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15094720] [2021-01-06 21:18:51,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:18:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:18:52,006 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 21:18:52,007 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15094720] [2021-01-06 21:18:52,007 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:18:52,007 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:18:52,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208825829] [2021-01-06 21:18:52,008 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:18:52,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:18:52,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:18:52,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:18:52,009 INFO L87 Difference]: Start difference. First operand 53770 states and 80558 transitions. Second operand 5 states. [2021-01-06 21:19:13,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:19:13,280 INFO L93 Difference]: Finished difference Result 92548 states and 138487 transitions. [2021-01-06 21:19:13,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 21:19:13,281 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2021-01-06 21:19:13,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:19:13,385 INFO L225 Difference]: With dead ends: 92548 [2021-01-06 21:19:13,385 INFO L226 Difference]: Without dead ends: 92546 [2021-01-06 21:19:13,405 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 21:19:13,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92546 states. [2021-01-06 21:19:26,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92546 to 54058. [2021-01-06 21:19:26,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54058 states. [2021-01-06 21:19:26,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54058 states to 54058 states and 80686 transitions. [2021-01-06 21:19:26,715 INFO L78 Accepts]: Start accepts. Automaton has 54058 states and 80686 transitions. Word has length 135 [2021-01-06 21:19:26,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:19:26,715 INFO L481 AbstractCegarLoop]: Abstraction has 54058 states and 80686 transitions. [2021-01-06 21:19:26,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:19:26,716 INFO L276 IsEmpty]: Start isEmpty. Operand 54058 states and 80686 transitions. [2021-01-06 21:19:26,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-01-06 21:19:26,722 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:19:26,722 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, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:19:26,722 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 21:19:26,723 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:19:26,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:19:26,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1548122415, now seen corresponding path program 1 times [2021-01-06 21:19:26,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:19:26,724 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5517957] [2021-01-06 21:19:26,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:19:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:19:27,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 21:19:27,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5517957] [2021-01-06 21:19:27,047 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:19:27,047 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 21:19:27,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500993157] [2021-01-06 21:19:27,048 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 21:19:27,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:19:27,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 21:19:27,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-01-06 21:19:27,049 INFO L87 Difference]: Start difference. First operand 54058 states and 80686 transitions. Second operand 10 states. [2021-01-06 21:19:56,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:19:56,359 INFO L93 Difference]: Finished difference Result 162885 states and 242568 transitions. [2021-01-06 21:19:56,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 21:19:56,360 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 135 [2021-01-06 21:19:56,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:19:56,479 INFO L225 Difference]: With dead ends: 162885 [2021-01-06 21:19:56,479 INFO L226 Difference]: Without dead ends: 109119 [2021-01-06 21:19:56,536 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2021-01-06 21:19:56,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109119 states. [2021-01-06 21:20:11,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109119 to 54058. [2021-01-06 21:20:11,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54058 states. [2021-01-06 21:20:11,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54058 states to 54058 states and 80680 transitions. [2021-01-06 21:20:11,308 INFO L78 Accepts]: Start accepts. Automaton has 54058 states and 80680 transitions. Word has length 135 [2021-01-06 21:20:11,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:20:11,309 INFO L481 AbstractCegarLoop]: Abstraction has 54058 states and 80680 transitions. [2021-01-06 21:20:11,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 21:20:11,309 INFO L276 IsEmpty]: Start isEmpty. Operand 54058 states and 80680 transitions. [2021-01-06 21:20:11,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-01-06 21:20:11,313 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:20:11,313 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:20:11,314 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 21:20:11,314 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:20:11,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:20:11,314 INFO L82 PathProgramCache]: Analyzing trace with hash -260842722, now seen corresponding path program 1 times [2021-01-06 21:20:11,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:20:11,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13399570] [2021-01-06 21:20:11,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:20:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:20:11,589 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 21:20:11,589 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13399570] [2021-01-06 21:20:11,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:20:11,590 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 21:20:11,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906931454] [2021-01-06 21:20:11,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 21:20:11,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:20:11,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 21:20:11,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-01-06 21:20:11,591 INFO L87 Difference]: Start difference. First operand 54058 states and 80680 transitions. Second operand 10 states.