/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.7.1.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 21:11:26,358 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 21:11:26,361 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 21:11:26,415 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 21:11:26,416 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 21:11:26,420 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 21:11:26,423 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 21:11:26,429 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 21:11:26,432 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 21:11:26,438 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 21:11:26,441 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 21:11:26,443 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 21:11:26,443 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 21:11:26,446 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 21:11:26,448 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 21:11:26,450 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 21:11:26,451 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 21:11:26,470 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 21:11:26,477 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 21:11:26,485 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 21:11:26,487 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 21:11:26,489 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 21:11:26,490 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 21:11:26,493 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 21:11:26,501 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 21:11:26,501 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 21:11:26,501 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 21:11:26,503 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 21:11:26,504 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 21:11:26,505 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 21:11:26,505 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 21:11:26,506 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 21:11:26,508 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 21:11:26,509 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 21:11:26,510 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 21:11:26,510 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 21:11:26,510 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 21:11:26,517 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 21:11:26,517 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 21:11:26,519 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 21:11:26,519 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 21:11:26,520 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:11:26,545 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 21:11:26,546 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 21:11:26,547 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 21:11:26,547 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 21:11:26,548 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 21:11:26,548 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 21:11:26,548 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 21:11:26,548 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 21:11:26,548 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 21:11:26,549 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 21:11:26,549 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 21:11:26,549 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 21:11:26,549 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 21:11:26,549 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 21:11:26,550 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 21:11:26,550 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 21:11:26,550 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 21:11:26,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 21:11:26,550 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 21:11:26,551 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 21:11:26,551 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 21:11:26,551 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 21:11:26,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 21:11:26,551 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 21:11:26,552 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 21:11:26,552 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:11:26,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 21:11:26,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 21:11:26,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 21:11:26,967 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 21:11:26,968 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 21:11:26,969 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.7.1.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c [2021-01-06 21:11:27,057 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/71efc8faf/d7378fcfb1874bf2a804175879473965/FLAG50a927e97 [2021-01-06 21:11:27,671 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 21:11:27,672 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c [2021-01-06 21:11:27,687 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/71efc8faf/d7378fcfb1874bf2a804175879473965/FLAG50a927e97 [2021-01-06 21:11:27,996 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/71efc8faf/d7378fcfb1874bf2a804175879473965 [2021-01-06 21:11:28,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 21:11:28,006 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 21:11:28,010 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 21:11:28,010 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 21:11:28,014 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 21:11:28,015 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 09:11:27" (1/1) ... [2021-01-06 21:11:28,018 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c0e7f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:11:28, skipping insertion in model container [2021-01-06 21:11:28,018 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 09:11:27" (1/1) ... [2021-01-06 21:11:28,026 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 21:11:28,096 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[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_28618~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[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~0,] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~0,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~0,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~0,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~0,] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6__m6~0,] left hand side expression in assignment: lhs: VariableLHS[~node6__m6~0,] 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~0,] left hand side expression in assignment: lhs: VariableLHS[~node7__m7~0,] 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[~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[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_28770~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,] [2021-01-06 21:11:28,398 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.7.1.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c[7229,7242] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] 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[~node7____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] 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[~node6____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_28875~0,GLOBAL] [2021-01-06 21:11:28,479 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 21:11:28,498 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[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_28618~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[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~0,] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~0,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~0,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~0,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~0,] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6__m6~0,] left hand side expression in assignment: lhs: VariableLHS[~node6__m6~0,] 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~0,] left hand side expression in assignment: lhs: VariableLHS[~node7__m7~0,] 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[~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[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_28770~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,] [2021-01-06 21:11:28,564 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.7.1.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c[7229,7242] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] 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[~node7____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] 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[~node6____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_28875~0,GLOBAL] [2021-01-06 21:11:28,597 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 21:11:28,630 INFO L208 MainTranslator]: Completed translation [2021-01-06 21:11:28,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:11:28 WrapperNode [2021-01-06 21:11:28,631 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 21:11:28,634 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 21:11:28,635 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 21:11:28,635 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 21:11:28,648 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:11:28" (1/1) ... [2021-01-06 21:11:28,685 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:11:28" (1/1) ... [2021-01-06 21:11:28,766 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 21:11:28,770 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 21:11:28,770 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 21:11:28,771 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 21:11:28,790 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:11:28" (1/1) ... [2021-01-06 21:11:28,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:11:28" (1/1) ... [2021-01-06 21:11:28,798 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:11:28" (1/1) ... [2021-01-06 21:11:28,802 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:11:28" (1/1) ... [2021-01-06 21:11:28,824 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:11:28" (1/1) ... [2021-01-06 21:11:28,841 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:11:28" (1/1) ... [2021-01-06 21:11:28,847 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:11:28" (1/1) ... [2021-01-06 21:11:28,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 21:11:28,860 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 21:11:28,860 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 21:11:28,860 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 21:11:28,861 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:11:28" (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:11:29,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 21:11:29,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 21:11:29,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 21:11:29,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 21:11:29,879 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 21:11:29,880 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-01-06 21:11:29,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 09:11:29 BoogieIcfgContainer [2021-01-06 21:11:29,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 21:11:29,884 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 21:11:29,884 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 21:11:29,888 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 21:11:29,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 09:11:27" (1/3) ... [2021-01-06 21:11:29,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5a3727 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 09:11:29, skipping insertion in model container [2021-01-06 21:11:29,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:11:28" (2/3) ... [2021-01-06 21:11:29,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5a3727 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 09:11:29, skipping insertion in model container [2021-01-06 21:11:29,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 09:11:29" (3/3) ... [2021-01-06 21:11:29,892 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c [2021-01-06 21:11:29,899 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 21:11:29,904 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 21:11:29,924 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 21:11:29,951 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 21:11:29,952 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 21:11:29,952 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 21:11:29,952 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 21:11:29,952 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 21:11:29,952 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 21:11:29,952 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 21:11:29,952 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 21:11:29,971 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2021-01-06 21:11:29,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-01-06 21:11:29,982 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:11:29,983 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] [2021-01-06 21:11:29,983 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:11:29,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:11:29,989 INFO L82 PathProgramCache]: Analyzing trace with hash -313177950, now seen corresponding path program 1 times [2021-01-06 21:11:29,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:11:30,000 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428409779] [2021-01-06 21:11:30,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:11:30,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:11:30,536 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:11:30,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428409779] [2021-01-06 21:11:30,538 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:11:30,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:11:30,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024100342] [2021-01-06 21:11:30,547 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:11:30,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:11:30,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:11:30,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:11:30,570 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 3 states. [2021-01-06 21:11:30,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:11:30,708 INFO L93 Difference]: Finished difference Result 294 states and 484 transitions. [2021-01-06 21:11:30,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:11:30,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2021-01-06 21:11:30,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:11:30,725 INFO L225 Difference]: With dead ends: 294 [2021-01-06 21:11:30,726 INFO L226 Difference]: Without dead ends: 205 [2021-01-06 21:11:30,729 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:11:30,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-01-06 21:11:30,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 203. [2021-01-06 21:11:30,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2021-01-06 21:11:30,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 292 transitions. [2021-01-06 21:11:30,793 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 292 transitions. Word has length 86 [2021-01-06 21:11:30,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:11:30,793 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 292 transitions. [2021-01-06 21:11:30,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:11:30,794 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 292 transitions. [2021-01-06 21:11:30,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-06 21:11:30,797 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:11:30,798 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] [2021-01-06 21:11:30,798 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 21:11:30,798 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:11:30,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:11:30,799 INFO L82 PathProgramCache]: Analyzing trace with hash 982762601, now seen corresponding path program 1 times [2021-01-06 21:11:30,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:11:30,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639483001] [2021-01-06 21:11:30,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:11:30,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:11:30,954 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:11:30,954 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639483001] [2021-01-06 21:11:30,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:11:30,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:11:30,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243450557] [2021-01-06 21:11:30,962 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:11:30,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:11:30,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:11:30,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:11:30,964 INFO L87 Difference]: Start difference. First operand 203 states and 292 transitions. Second operand 3 states. [2021-01-06 21:11:31,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:11:31,025 INFO L93 Difference]: Finished difference Result 487 states and 744 transitions. [2021-01-06 21:11:31,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:11:31,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2021-01-06 21:11:31,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:11:31,030 INFO L225 Difference]: With dead ends: 487 [2021-01-06 21:11:31,030 INFO L226 Difference]: Without dead ends: 337 [2021-01-06 21:11:31,032 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:11:31,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-01-06 21:11:31,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2021-01-06 21:11:31,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2021-01-06 21:11:31,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 502 transitions. [2021-01-06 21:11:31,117 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 502 transitions. Word has length 87 [2021-01-06 21:11:31,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:11:31,118 INFO L481 AbstractCegarLoop]: Abstraction has 335 states and 502 transitions. [2021-01-06 21:11:31,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:11:31,118 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 502 transitions. [2021-01-06 21:11:31,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 21:11:31,125 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:11:31,126 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] [2021-01-06 21:11:31,126 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 21:11:31,126 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:11:31,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:11:31,127 INFO L82 PathProgramCache]: Analyzing trace with hash 914543768, now seen corresponding path program 1 times [2021-01-06 21:11:31,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:11:31,128 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498463752] [2021-01-06 21:11:31,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:11:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:11:31,353 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:11:31,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498463752] [2021-01-06 21:11:31,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:11:31,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:11:31,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508645889] [2021-01-06 21:11:31,356 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:11:31,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:11:31,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:11:31,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:11:31,359 INFO L87 Difference]: Start difference. First operand 335 states and 502 transitions. Second operand 3 states. [2021-01-06 21:11:31,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:11:31,467 INFO L93 Difference]: Finished difference Result 867 states and 1348 transitions. [2021-01-06 21:11:31,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:11:31,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2021-01-06 21:11:31,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:11:31,477 INFO L225 Difference]: With dead ends: 867 [2021-01-06 21:11:31,477 INFO L226 Difference]: Without dead ends: 585 [2021-01-06 21:11:31,480 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:11:31,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2021-01-06 21:11:31,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 583. [2021-01-06 21:11:31,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2021-01-06 21:11:31,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 894 transitions. [2021-01-06 21:11:31,549 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 894 transitions. Word has length 88 [2021-01-06 21:11:31,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:11:31,550 INFO L481 AbstractCegarLoop]: Abstraction has 583 states and 894 transitions. [2021-01-06 21:11:31,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:11:31,550 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 894 transitions. [2021-01-06 21:11:31,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-01-06 21:11:31,552 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:11:31,552 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] [2021-01-06 21:11:31,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 21:11:31,553 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:11:31,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:11:31,554 INFO L82 PathProgramCache]: Analyzing trace with hash 349801040, now seen corresponding path program 1 times [2021-01-06 21:11:31,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:11:31,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095142170] [2021-01-06 21:11:31,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:11:31,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:11:31,746 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:11:31,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095142170] [2021-01-06 21:11:31,747 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:11:31,747 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:11:31,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554207321] [2021-01-06 21:11:31,748 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:11:31,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:11:31,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:11:31,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:11:31,749 INFO L87 Difference]: Start difference. First operand 583 states and 894 transitions. Second operand 3 states. [2021-01-06 21:11:31,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:11:31,822 INFO L93 Difference]: Finished difference Result 1579 states and 2472 transitions. [2021-01-06 21:11:31,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:11:31,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2021-01-06 21:11:31,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:11:31,829 INFO L225 Difference]: With dead ends: 1579 [2021-01-06 21:11:31,830 INFO L226 Difference]: Without dead ends: 1049 [2021-01-06 21:11:31,831 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:11:31,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2021-01-06 21:11:31,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 1047. [2021-01-06 21:11:31,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1047 states. [2021-01-06 21:11:31,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1622 transitions. [2021-01-06 21:11:31,895 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1622 transitions. Word has length 89 [2021-01-06 21:11:31,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:11:31,895 INFO L481 AbstractCegarLoop]: Abstraction has 1047 states and 1622 transitions. [2021-01-06 21:11:31,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:11:31,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1622 transitions. [2021-01-06 21:11:31,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 21:11:31,897 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:11:31,898 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] [2021-01-06 21:11:31,898 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 21:11:31,898 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:11:31,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:11:31,899 INFO L82 PathProgramCache]: Analyzing trace with hash -248220501, now seen corresponding path program 1 times [2021-01-06 21:11:31,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:11:31,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516620261] [2021-01-06 21:11:31,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:11:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:11:31,991 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:11:31,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516620261] [2021-01-06 21:11:31,992 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:11:31,992 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:11:31,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892293813] [2021-01-06 21:11:31,993 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:11:31,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:11:31,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:11:31,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:11:31,994 INFO L87 Difference]: Start difference. First operand 1047 states and 1622 transitions. Second operand 3 states. [2021-01-06 21:11:32,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:11:32,136 INFO L93 Difference]: Finished difference Result 2907 states and 4552 transitions. [2021-01-06 21:11:32,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:11:32,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2021-01-06 21:11:32,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:11:32,149 INFO L225 Difference]: With dead ends: 2907 [2021-01-06 21:11:32,149 INFO L226 Difference]: Without dead ends: 1913 [2021-01-06 21:11:32,151 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:11:32,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1913 states. [2021-01-06 21:11:32,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1913 to 1911. [2021-01-06 21:11:32,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1911 states. [2021-01-06 21:11:32,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1911 states to 1911 states and 2966 transitions. [2021-01-06 21:11:32,263 INFO L78 Accepts]: Start accepts. Automaton has 1911 states and 2966 transitions. Word has length 90 [2021-01-06 21:11:32,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:11:32,265 INFO L481 AbstractCegarLoop]: Abstraction has 1911 states and 2966 transitions. [2021-01-06 21:11:32,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:11:32,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 2966 transitions. [2021-01-06 21:11:32,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-01-06 21:11:32,270 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:11:32,270 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] [2021-01-06 21:11:32,271 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 21:11:32,271 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:11:32,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:11:32,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1910770737, now seen corresponding path program 1 times [2021-01-06 21:11:32,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:11:32,272 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919272986] [2021-01-06 21:11:32,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:11:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:11:32,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:11:32,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919272986] [2021-01-06 21:11:32,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:11:32,400 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:11:32,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451489527] [2021-01-06 21:11:32,401 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:11:32,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:11:32,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:11:32,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:11:32,403 INFO L87 Difference]: Start difference. First operand 1911 states and 2966 transitions. Second operand 3 states. [2021-01-06 21:11:32,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:11:32,642 INFO L93 Difference]: Finished difference Result 5371 states and 8376 transitions. [2021-01-06 21:11:32,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:11:32,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2021-01-06 21:11:32,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:11:32,663 INFO L225 Difference]: With dead ends: 5371 [2021-01-06 21:11:32,663 INFO L226 Difference]: Without dead ends: 3513 [2021-01-06 21:11:32,667 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:11:32,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3513 states. [2021-01-06 21:11:32,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3513 to 3511. [2021-01-06 21:11:32,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3511 states. [2021-01-06 21:11:32,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3511 states to 3511 states and 5430 transitions. [2021-01-06 21:11:32,883 INFO L78 Accepts]: Start accepts. Automaton has 3511 states and 5430 transitions. Word has length 91 [2021-01-06 21:11:32,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:11:32,883 INFO L481 AbstractCegarLoop]: Abstraction has 3511 states and 5430 transitions. [2021-01-06 21:11:32,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:11:32,884 INFO L276 IsEmpty]: Start isEmpty. Operand 3511 states and 5430 transitions. [2021-01-06 21:11:32,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-06 21:11:32,886 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:11:32,886 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] [2021-01-06 21:11:32,887 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 21:11:32,887 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:11:32,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:11:32,888 INFO L82 PathProgramCache]: Analyzing trace with hash 307326139, now seen corresponding path program 1 times [2021-01-06 21:11:32,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:11:32,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417566501] [2021-01-06 21:11:32,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:11:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:11:33,002 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:11:33,002 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417566501] [2021-01-06 21:11:33,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:11:33,003 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:11:33,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160597198] [2021-01-06 21:11:33,004 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:11:33,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:11:33,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:11:33,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:11:33,007 INFO L87 Difference]: Start difference. First operand 3511 states and 5430 transitions. Second operand 3 states. [2021-01-06 21:11:33,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:11:33,405 INFO L93 Difference]: Finished difference Result 9915 states and 15352 transitions. [2021-01-06 21:11:33,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:11:33,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2021-01-06 21:11:33,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:11:33,444 INFO L225 Difference]: With dead ends: 9915 [2021-01-06 21:11:33,445 INFO L226 Difference]: Without dead ends: 6457 [2021-01-06 21:11:33,453 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:11:33,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6457 states. [2021-01-06 21:11:33,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6457 to 6455. [2021-01-06 21:11:33,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6455 states. [2021-01-06 21:11:33,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6455 states to 6455 states and 9910 transitions. [2021-01-06 21:11:33,882 INFO L78 Accepts]: Start accepts. Automaton has 6455 states and 9910 transitions. Word has length 92 [2021-01-06 21:11:33,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:11:33,883 INFO L481 AbstractCegarLoop]: Abstraction has 6455 states and 9910 transitions. [2021-01-06 21:11:33,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:11:33,883 INFO L276 IsEmpty]: Start isEmpty. Operand 6455 states and 9910 transitions. [2021-01-06 21:11:33,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-01-06 21:11:33,885 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:11:33,885 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] [2021-01-06 21:11:33,885 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 21:11:33,886 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:11:33,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:11:33,886 INFO L82 PathProgramCache]: Analyzing trace with hash -450885343, now seen corresponding path program 1 times [2021-01-06 21:11:33,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:11:33,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062536105] [2021-01-06 21:11:33,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:11:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:11:34,097 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:11:34,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062536105] [2021-01-06 21:11:34,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:11:34,098 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:11:34,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584289004] [2021-01-06 21:11:34,098 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 21:11:34,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:11:34,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 21:11:34,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-06 21:11:34,101 INFO L87 Difference]: Start difference. First operand 6455 states and 9910 transitions. Second operand 6 states. [2021-01-06 21:11:35,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:11:35,312 INFO L93 Difference]: Finished difference Result 19195 states and 29496 transitions. [2021-01-06 21:11:35,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:11:35,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2021-01-06 21:11:35,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:11:35,402 INFO L225 Difference]: With dead ends: 19195 [2021-01-06 21:11:35,402 INFO L226 Difference]: Without dead ends: 12793 [2021-01-06 21:11:35,414 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:11:35,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12793 states. [2021-01-06 21:11:36,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12793 to 12791. [2021-01-06 21:11:36,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12791 states. [2021-01-06 21:11:36,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12791 states to 12791 states and 19574 transitions. [2021-01-06 21:11:36,509 INFO L78 Accepts]: Start accepts. Automaton has 12791 states and 19574 transitions. Word has length 93 [2021-01-06 21:11:36,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:11:36,510 INFO L481 AbstractCegarLoop]: Abstraction has 12791 states and 19574 transitions. [2021-01-06 21:11:36,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 21:11:36,510 INFO L276 IsEmpty]: Start isEmpty. Operand 12791 states and 19574 transitions. [2021-01-06 21:11:36,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-01-06 21:11:36,511 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:11:36,511 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] [2021-01-06 21:11:36,511 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 21:11:36,511 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:11:36,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:11:36,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1897914938, now seen corresponding path program 1 times [2021-01-06 21:11:36,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:11:36,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602253937] [2021-01-06 21:11:36,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:11:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:11:36,701 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:11:36,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602253937] [2021-01-06 21:11:36,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:11:36,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:11:36,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585482813] [2021-01-06 21:11:36,703 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 21:11:36,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:11:36,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 21:11:36,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-06 21:11:36,704 INFO L87 Difference]: Start difference. First operand 12791 states and 19574 transitions. Second operand 6 states. [2021-01-06 21:11:38,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:11:38,709 INFO L93 Difference]: Finished difference Result 38139 states and 58360 transitions. [2021-01-06 21:11:38,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:11:38,709 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2021-01-06 21:11:38,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:11:38,773 INFO L225 Difference]: With dead ends: 38139 [2021-01-06 21:11:38,774 INFO L226 Difference]: Without dead ends: 25401 [2021-01-06 21:11:38,794 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:11:38,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25401 states. [2021-01-06 21:11:40,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25401 to 25399. [2021-01-06 21:11:40,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25399 states. [2021-01-06 21:11:40,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25399 states to 25399 states and 38710 transitions. [2021-01-06 21:11:40,724 INFO L78 Accepts]: Start accepts. Automaton has 25399 states and 38710 transitions. Word has length 93 [2021-01-06 21:11:40,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:11:40,725 INFO L481 AbstractCegarLoop]: Abstraction has 25399 states and 38710 transitions. [2021-01-06 21:11:40,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 21:11:40,725 INFO L276 IsEmpty]: Start isEmpty. Operand 25399 states and 38710 transitions. [2021-01-06 21:11:40,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-01-06 21:11:40,726 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:11:40,726 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] [2021-01-06 21:11:40,727 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 21:11:40,727 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:11:40,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:11:40,728 INFO L82 PathProgramCache]: Analyzing trace with hash 932980801, now seen corresponding path program 1 times [2021-01-06 21:11:40,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:11:40,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792371591] [2021-01-06 21:11:40,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:11:40,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:11:40,863 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:11:40,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792371591] [2021-01-06 21:11:40,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:11:40,865 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:11:40,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633140922] [2021-01-06 21:11:40,865 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 21:11:40,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:11:40,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 21:11:40,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-06 21:11:40,870 INFO L87 Difference]: Start difference. First operand 25399 states and 38710 transitions. Second operand 6 states. [2021-01-06 21:11:44,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:11:44,100 INFO L93 Difference]: Finished difference Result 75835 states and 115512 transitions. [2021-01-06 21:11:44,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:11:44,103 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2021-01-06 21:11:44,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:11:44,230 INFO L225 Difference]: With dead ends: 75835 [2021-01-06 21:11:44,230 INFO L226 Difference]: Without dead ends: 50489 [2021-01-06 21:11:44,281 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:11:44,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50489 states. [2021-01-06 21:11:47,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50489 to 50487. [2021-01-06 21:11:47,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50487 states. [2021-01-06 21:11:47,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50487 states to 50487 states and 76598 transitions. [2021-01-06 21:11:47,315 INFO L78 Accepts]: Start accepts. Automaton has 50487 states and 76598 transitions. Word has length 93 [2021-01-06 21:11:47,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:11:47,316 INFO L481 AbstractCegarLoop]: Abstraction has 50487 states and 76598 transitions. [2021-01-06 21:11:47,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 21:11:47,316 INFO L276 IsEmpty]: Start isEmpty. Operand 50487 states and 76598 transitions. [2021-01-06 21:11:47,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-01-06 21:11:47,316 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:11:47,316 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] [2021-01-06 21:11:47,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 21:11:47,317 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:11:47,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:11:47,317 INFO L82 PathProgramCache]: Analyzing trace with hash -2088118490, now seen corresponding path program 1 times [2021-01-06 21:11:47,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:11:47,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131899229] [2021-01-06 21:11:47,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:11:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:11:47,406 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:11:47,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131899229] [2021-01-06 21:11:47,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:11:47,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:11:47,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459854507] [2021-01-06 21:11:47,408 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:11:47,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:11:47,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:11:47,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:11:47,409 INFO L87 Difference]: Start difference. First operand 50487 states and 76598 transitions. Second operand 5 states. [2021-01-06 21:11:50,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:11:50,113 INFO L93 Difference]: Finished difference Result 100921 states and 153143 transitions. [2021-01-06 21:11:50,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:11:50,114 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2021-01-06 21:11:50,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:11:50,221 INFO L225 Difference]: With dead ends: 100921 [2021-01-06 21:11:50,221 INFO L226 Difference]: Without dead ends: 50487 [2021-01-06 21:11:50,260 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:11:50,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50487 states. [2021-01-06 21:11:53,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50487 to 50487. [2021-01-06 21:11:53,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50487 states. [2021-01-06 21:11:53,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50487 states to 50487 states and 76086 transitions. [2021-01-06 21:11:53,258 INFO L78 Accepts]: Start accepts. Automaton has 50487 states and 76086 transitions. Word has length 93 [2021-01-06 21:11:53,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:11:53,258 INFO L481 AbstractCegarLoop]: Abstraction has 50487 states and 76086 transitions. [2021-01-06 21:11:53,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:11:53,258 INFO L276 IsEmpty]: Start isEmpty. Operand 50487 states and 76086 transitions. [2021-01-06 21:11:53,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-01-06 21:11:53,259 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:11:53,259 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] [2021-01-06 21:11:53,259 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 21:11:53,260 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:11:53,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:11:53,260 INFO L82 PathProgramCache]: Analyzing trace with hash -760733301, now seen corresponding path program 1 times [2021-01-06 21:11:53,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:11:53,261 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449631469] [2021-01-06 21:11:53,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:11:53,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:11:53,358 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:11:53,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449631469] [2021-01-06 21:11:53,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:11:53,359 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:11:53,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191788926] [2021-01-06 21:11:53,359 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:11:53,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:11:53,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:11:53,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:11:53,361 INFO L87 Difference]: Start difference. First operand 50487 states and 76086 transitions. Second operand 5 states. [2021-01-06 21:11:56,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:11:56,211 INFO L93 Difference]: Finished difference Result 100921 states and 152119 transitions. [2021-01-06 21:11:56,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:11:56,212 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2021-01-06 21:11:56,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:11:56,316 INFO L225 Difference]: With dead ends: 100921 [2021-01-06 21:11:56,317 INFO L226 Difference]: Without dead ends: 50487 [2021-01-06 21:11:56,364 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:11:56,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50487 states. [2021-01-06 21:11:59,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50487 to 50487. [2021-01-06 21:11:59,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50487 states. [2021-01-06 21:11:59,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50487 states to 50487 states and 75574 transitions. [2021-01-06 21:11:59,533 INFO L78 Accepts]: Start accepts. Automaton has 50487 states and 75574 transitions. Word has length 93 [2021-01-06 21:11:59,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:11:59,533 INFO L481 AbstractCegarLoop]: Abstraction has 50487 states and 75574 transitions. [2021-01-06 21:11:59,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:11:59,533 INFO L276 IsEmpty]: Start isEmpty. Operand 50487 states and 75574 transitions. [2021-01-06 21:11:59,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-01-06 21:11:59,534 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:11:59,534 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] [2021-01-06 21:11:59,534 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 21:11:59,535 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:11:59,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:11:59,535 INFO L82 PathProgramCache]: Analyzing trace with hash 960597574, now seen corresponding path program 1 times [2021-01-06 21:11:59,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:11:59,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737962654] [2021-01-06 21:11:59,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:11:59,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:11:59,702 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:11:59,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737962654] [2021-01-06 21:11:59,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:11:59,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 21:11:59,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832653221] [2021-01-06 21:11:59,704 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 21:11:59,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:11:59,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 21:11:59,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-01-06 21:11:59,705 INFO L87 Difference]: Start difference. First operand 50487 states and 75574 transitions. Second operand 9 states. [2021-01-06 21:12:45,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:12:45,105 INFO L93 Difference]: Finished difference Result 756563 states and 1132868 transitions. [2021-01-06 21:12:45,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 21:12:45,105 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2021-01-06 21:12:45,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:12:46,742 INFO L225 Difference]: With dead ends: 756563 [2021-01-06 21:12:46,743 INFO L226 Difference]: Without dead ends: 706129 [2021-01-06 21:12:47,009 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2021-01-06 21:12:47,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706129 states. [2021-01-06 21:13:03,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706129 to 100919. [2021-01-06 21:13:03,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100919 states. [2021-01-06 21:13:03,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100919 states to 100919 states and 149046 transitions. [2021-01-06 21:13:03,333 INFO L78 Accepts]: Start accepts. Automaton has 100919 states and 149046 transitions. Word has length 93 [2021-01-06 21:13:03,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:13:03,334 INFO L481 AbstractCegarLoop]: Abstraction has 100919 states and 149046 transitions. [2021-01-06 21:13:03,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 21:13:03,334 INFO L276 IsEmpty]: Start isEmpty. Operand 100919 states and 149046 transitions. [2021-01-06 21:13:03,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-01-06 21:13:03,335 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:13:03,335 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] [2021-01-06 21:13:03,335 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 21:13:03,335 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:13:03,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:13:03,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1205518302, now seen corresponding path program 1 times [2021-01-06 21:13:03,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:13:03,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440838437] [2021-01-06 21:13:03,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:13:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:13:03,390 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:13:03,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440838437] [2021-01-06 21:13:03,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:13:03,391 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:13:03,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292266777] [2021-01-06 21:13:03,391 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:13:03,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:13:03,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:13:03,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:13:03,392 INFO L87 Difference]: Start difference. First operand 100919 states and 149046 transitions. Second operand 3 states. [2021-01-06 21:13:19,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:13:19,100 INFO L93 Difference]: Finished difference Result 254267 states and 374072 transitions. [2021-01-06 21:13:19,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:13:19,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2021-01-06 21:13:19,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:13:19,400 INFO L225 Difference]: With dead ends: 254267 [2021-01-06 21:13:19,401 INFO L226 Difference]: Without dead ends: 153401 [2021-01-06 21:13:19,520 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:13:19,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153401 states. [2021-01-06 21:13:35,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153401 to 153399. [2021-01-06 21:13:35,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153399 states. [2021-01-06 21:13:36,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153399 states to 153399 states and 222006 transitions. [2021-01-06 21:13:36,033 INFO L78 Accepts]: Start accepts. Automaton has 153399 states and 222006 transitions. Word has length 95 [2021-01-06 21:13:36,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:13:36,033 INFO L481 AbstractCegarLoop]: Abstraction has 153399 states and 222006 transitions. [2021-01-06 21:13:36,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:13:36,033 INFO L276 IsEmpty]: Start isEmpty. Operand 153399 states and 222006 transitions. [2021-01-06 21:13:36,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-01-06 21:13:36,034 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:13:36,034 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] [2021-01-06 21:13:36,034 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 21:13:36,035 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:13:36,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:13:36,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1184515647, now seen corresponding path program 1 times [2021-01-06 21:13:36,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:13:36,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639505565] [2021-01-06 21:13:36,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:13:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:13:36,531 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:13:36,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639505565] [2021-01-06 21:13:36,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:13:36,532 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 21:13:36,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951072539] [2021-01-06 21:13:36,532 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 21:13:36,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:13:36,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 21:13:36,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-01-06 21:13:36,534 INFO L87 Difference]: Start difference. First operand 153399 states and 222006 transitions. Second operand 9 states. [2021-01-06 21:14:03,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:14:03,277 INFO L93 Difference]: Finished difference Result 382909 states and 555193 transitions. [2021-01-06 21:14:03,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 21:14:03,278 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2021-01-06 21:14:03,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:14:03,689 INFO L225 Difference]: With dead ends: 382909 [2021-01-06 21:14:03,690 INFO L226 Difference]: Without dead ends: 229563 [2021-01-06 21:14:03,855 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2021-01-06 21:14:04,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229563 states.