/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.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 11:22:48,392 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 11:22:48,395 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 11:22:48,452 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 11:22:48,452 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 11:22:48,457 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 11:22:48,461 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 11:22:48,466 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 11:22:48,470 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 11:22:48,476 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 11:22:48,481 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 11:22:48,483 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 11:22:48,483 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 11:22:48,487 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 11:22:48,490 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 11:22:48,493 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 11:22:48,494 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 11:22:48,497 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 11:22:48,505 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 11:22:48,513 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 11:22:48,515 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 11:22:48,517 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 11:22:48,518 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 11:22:48,520 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 11:22:48,529 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 11:22:48,529 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 11:22:48,530 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 11:22:48,532 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 11:22:48,533 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 11:22:48,534 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 11:22:48,534 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 11:22:48,535 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 11:22:48,538 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 11:22:48,538 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 11:22:48,539 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 11:22:48,539 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 11:22:48,543 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 11:22:48,544 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 11:22:48,544 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 11:22:48,552 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 11:22:48,553 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 11:22:48,554 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 11:22:48,599 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 11:22:48,599 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 11:22:48,603 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 11:22:48,604 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 11:22:48,604 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 11:22:48,604 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 11:22:48,604 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 11:22:48,605 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 11:22:48,605 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 11:22:48,605 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 11:22:48,606 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 11:22:48,606 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 11:22:48,606 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 11:22:48,607 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 11:22:48,607 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 11:22:48,607 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 11:22:48,607 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 11:22:48,607 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 11:22:48,608 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 11:22:48,608 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 11:22:48,608 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 11:22:48,608 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 11:22:48,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 11:22:48,608 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 11:22:48,609 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 11:22:48,609 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 [2020-12-23 11:22:49,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 11:22:49,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 11:22:49,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 11:22:49,143 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 11:22:49,143 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 11:22:49,144 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.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2020-12-23 11:22:49,220 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/674de3bbc/8328206adc6442e989a9c4a2b674f764/FLAGe9718f5e5 [2020-12-23 11:22:49,966 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 11:22:49,967 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2020-12-23 11:22:49,983 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/674de3bbc/8328206adc6442e989a9c4a2b674f764/FLAGe9718f5e5 [2020-12-23 11:22:50,212 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/674de3bbc/8328206adc6442e989a9c4a2b674f764 [2020-12-23 11:22:50,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 11:22:50,218 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 11:22:50,219 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 11:22:50,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 11:22:50,224 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 11:22:50,225 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 11:22:50" (1/1) ... [2020-12-23 11:22:50,227 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e04e9d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:22:50, skipping insertion in model container [2020-12-23 11:22:50,227 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 11:22:50" (1/1) ... [2020-12-23 11:22:50,236 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 11:22:50,288 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_28296~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[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~0,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~0,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~0,] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~0,] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6__m6~0,] left hand side expression in assignment: lhs: VariableLHS[~node6____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node7__m7~0,] left hand side expression in assignment: lhs: VariableLHS[~node7____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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_28441~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~1,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~1,] left hand side expression in assignment: lhs: VariableLHS[~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~1,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~1,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~1,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~1,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~1,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~1,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~1,] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~1,] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6__m6~1,] left hand side expression in assignment: lhs: VariableLHS[~node6__m6~1,] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node7__m7~1,] left hand side expression in assignment: lhs: VariableLHS[~node7__m7~1,] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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~1,] left hand side expression in assignment: lhs: VariableLHS[~__return_28693~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~1,] [2020-12-23 11:22:50,646 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.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[9972,9985] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~2,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~2,] left hand side expression in assignment: lhs: VariableLHS[~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~2,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~2,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~2,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~2,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~2,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~2,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~2,] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~2,] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6__m6~2,] left hand side expression in assignment: lhs: VariableLHS[~node6__m6~2,] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node7____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node7____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node7____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node6____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] [2020-12-23 11:22:50,710 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 11:22:50,728 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_28296~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[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~0,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~0,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~0,] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~0,] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6__m6~0,] left hand side expression in assignment: lhs: VariableLHS[~node6____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node7__m7~0,] left hand side expression in assignment: lhs: VariableLHS[~node7____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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_28441~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~1,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~1,] left hand side expression in assignment: lhs: VariableLHS[~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~1,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~1,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~1,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~1,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~1,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~1,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~1,] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~1,] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6__m6~1,] left hand side expression in assignment: lhs: VariableLHS[~node6__m6~1,] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node7__m7~1,] left hand side expression in assignment: lhs: VariableLHS[~node7__m7~1,] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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~1,] left hand side expression in assignment: lhs: VariableLHS[~__return_28693~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~1,] [2020-12-23 11:22:50,860 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.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[9972,9985] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~2,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~2,] left hand side expression in assignment: lhs: VariableLHS[~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~2,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~2,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~2,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~2,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~2,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~2,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~2,] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~2,] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6__m6~2,] left hand side expression in assignment: lhs: VariableLHS[~node6__m6~2,] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node7____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node7____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node7____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node6____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] [2020-12-23 11:22:50,905 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 11:22:50,931 INFO L208 MainTranslator]: Completed translation [2020-12-23 11:22:50,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:22:50 WrapperNode [2020-12-23 11:22:50,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 11:22:50,933 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 11:22:50,933 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 11:22:50,933 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 11:22:50,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:22:50" (1/1) ... [2020-12-23 11:22:50,960 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:22:50" (1/1) ... [2020-12-23 11:22:51,026 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 11:22:51,027 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 11:22:51,027 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 11:22:51,027 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 11:22:51,039 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:22:50" (1/1) ... [2020-12-23 11:22:51,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:22:50" (1/1) ... [2020-12-23 11:22:51,045 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:22:50" (1/1) ... [2020-12-23 11:22:51,046 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:22:50" (1/1) ... [2020-12-23 11:22:51,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:22:50" (1/1) ... [2020-12-23 11:22:51,113 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:22:50" (1/1) ... [2020-12-23 11:22:51,117 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:22:50" (1/1) ... [2020-12-23 11:22:51,124 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 11:22:51,125 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 11:22:51,126 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 11:22:51,126 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 11:22:51,127 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:22:50" (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 [2020-12-23 11:22:51,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 11:22:51,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 11:22:51,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 11:22:51,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 11:22:52,594 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 11:22:52,595 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2020-12-23 11:22:52,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 11:22:52 BoogieIcfgContainer [2020-12-23 11:22:52,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 11:22:52,599 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 11:22:52,600 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 11:22:52,604 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 11:22:52,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 11:22:50" (1/3) ... [2020-12-23 11:22:52,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29563f83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 11:22:52, skipping insertion in model container [2020-12-23 11:22:52,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:22:50" (2/3) ... [2020-12-23 11:22:52,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29563f83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 11:22:52, skipping insertion in model container [2020-12-23 11:22:52,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 11:22:52" (3/3) ... [2020-12-23 11:22:52,608 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2020-12-23 11:22:52,616 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 11:22:52,622 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 11:22:52,644 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 11:22:52,675 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 11:22:52,675 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 11:22:52,676 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 11:22:52,676 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 11:22:52,676 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 11:22:52,676 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 11:22:52,676 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 11:22:52,677 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 11:22:52,699 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states. [2020-12-23 11:22:52,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-12-23 11:22:52,712 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:22:52,713 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:22:52,713 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:22:52,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:22:52,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1361095482, now seen corresponding path program 1 times [2020-12-23 11:22:52,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:22:52,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920834088] [2020-12-23 11:22:52,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:22:53,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:22:53,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:22:53,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920834088] [2020-12-23 11:22:53,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:22:53,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:22:53,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112791163] [2020-12-23 11:22:53,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:22:53,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:22:53,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:22:53,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:22:53,381 INFO L87 Difference]: Start difference. First operand 201 states. Second operand 3 states. [2020-12-23 11:22:53,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:22:53,534 INFO L93 Difference]: Finished difference Result 391 states and 653 transitions. [2020-12-23 11:22:53,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:22:53,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2020-12-23 11:22:53,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:22:53,553 INFO L225 Difference]: With dead ends: 391 [2020-12-23 11:22:53,554 INFO L226 Difference]: Without dead ends: 301 [2020-12-23 11:22:53,558 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 [2020-12-23 11:22:53,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2020-12-23 11:22:53,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2020-12-23 11:22:53,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2020-12-23 11:22:53,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 431 transitions. [2020-12-23 11:22:53,637 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 431 transitions. Word has length 107 [2020-12-23 11:22:53,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:22:53,638 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 431 transitions. [2020-12-23 11:22:53,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:22:53,639 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 431 transitions. [2020-12-23 11:22:53,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-12-23 11:22:53,642 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:22:53,642 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:22:53,643 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 11:22:53,643 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:22:53,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:22:53,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1847794712, now seen corresponding path program 1 times [2020-12-23 11:22:53,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:22:53,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873176490] [2020-12-23 11:22:53,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:22:53,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:22:53,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:22:53,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873176490] [2020-12-23 11:22:53,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:22:53,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 11:22:53,983 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263939627] [2020-12-23 11:22:53,985 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 11:22:53,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:22:53,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 11:22:53,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:22:53,987 INFO L87 Difference]: Start difference. First operand 299 states and 431 transitions. Second operand 5 states. [2020-12-23 11:22:54,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:22:54,314 INFO L93 Difference]: Finished difference Result 522 states and 780 transitions. [2020-12-23 11:22:54,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 11:22:54,315 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2020-12-23 11:22:54,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:22:54,324 INFO L225 Difference]: With dead ends: 522 [2020-12-23 11:22:54,324 INFO L226 Difference]: Without dead ends: 299 [2020-12-23 11:22:54,330 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 [2020-12-23 11:22:54,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-12-23 11:22:54,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2020-12-23 11:22:54,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2020-12-23 11:22:54,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 428 transitions. [2020-12-23 11:22:54,377 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 428 transitions. Word has length 109 [2020-12-23 11:22:54,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:22:54,378 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 428 transitions. [2020-12-23 11:22:54,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 11:22:54,378 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 428 transitions. [2020-12-23 11:22:54,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-12-23 11:22:54,384 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:22:54,384 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:22:54,384 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 11:22:54,384 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:22:54,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:22:54,385 INFO L82 PathProgramCache]: Analyzing trace with hash 512568948, now seen corresponding path program 1 times [2020-12-23 11:22:54,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:22:54,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357117026] [2020-12-23 11:22:54,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:22:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:22:54,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:22:54,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357117026] [2020-12-23 11:22:54,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:22:54,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 11:22:54,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321667444] [2020-12-23 11:22:54,621 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 11:22:54,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:22:54,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 11:22:54,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-23 11:22:54,626 INFO L87 Difference]: Start difference. First operand 299 states and 428 transitions. Second operand 6 states. [2020-12-23 11:22:55,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:22:55,010 INFO L93 Difference]: Finished difference Result 743 states and 1115 transitions. [2020-12-23 11:22:55,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 11:22:55,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 110 [2020-12-23 11:22:55,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:22:55,014 INFO L225 Difference]: With dead ends: 743 [2020-12-23 11:22:55,014 INFO L226 Difference]: Without dead ends: 500 [2020-12-23 11:22:55,015 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 [2020-12-23 11:22:55,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2020-12-23 11:22:55,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 498. [2020-12-23 11:22:55,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2020-12-23 11:22:55,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 740 transitions. [2020-12-23 11:22:55,049 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 740 transitions. Word has length 110 [2020-12-23 11:22:55,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:22:55,050 INFO L481 AbstractCegarLoop]: Abstraction has 498 states and 740 transitions. [2020-12-23 11:22:55,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 11:22:55,050 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 740 transitions. [2020-12-23 11:22:55,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-12-23 11:22:55,052 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:22:55,053 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:22:55,053 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 11:22:55,053 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:22:55,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:22:55,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1977473420, now seen corresponding path program 1 times [2020-12-23 11:22:55,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:22:55,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329260277] [2020-12-23 11:22:55,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:22:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:22:55,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:22:55,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329260277] [2020-12-23 11:22:55,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:22:55,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 11:22:55,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685710044] [2020-12-23 11:22:55,234 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 11:22:55,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:22:55,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 11:22:55,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-23 11:22:55,235 INFO L87 Difference]: Start difference. First operand 498 states and 740 transitions. Second operand 6 states. [2020-12-23 11:22:55,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:22:55,570 INFO L93 Difference]: Finished difference Result 1252 states and 1917 transitions. [2020-12-23 11:22:55,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 11:22:55,571 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 111 [2020-12-23 11:22:55,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:22:55,576 INFO L225 Difference]: With dead ends: 1252 [2020-12-23 11:22:55,576 INFO L226 Difference]: Without dead ends: 826 [2020-12-23 11:22:55,577 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 [2020-12-23 11:22:55,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2020-12-23 11:22:55,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 824. [2020-12-23 11:22:55,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 824 states. [2020-12-23 11:22:55,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1247 transitions. [2020-12-23 11:22:55,627 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1247 transitions. Word has length 111 [2020-12-23 11:22:55,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:22:55,628 INFO L481 AbstractCegarLoop]: Abstraction has 824 states and 1247 transitions. [2020-12-23 11:22:55,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 11:22:55,628 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1247 transitions. [2020-12-23 11:22:55,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-12-23 11:22:55,630 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:22:55,630 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:22:55,631 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 11:22:55,631 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:22:55,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:22:55,631 INFO L82 PathProgramCache]: Analyzing trace with hash -18016652, now seen corresponding path program 1 times [2020-12-23 11:22:55,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:22:55,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460443039] [2020-12-23 11:22:55,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:22:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:22:55,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:22:55,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460443039] [2020-12-23 11:22:55,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:22:55,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 11:22:55,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842667899] [2020-12-23 11:22:55,804 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 11:22:55,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:22:55,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 11:22:55,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-23 11:22:55,810 INFO L87 Difference]: Start difference. First operand 824 states and 1247 transitions. Second operand 6 states. [2020-12-23 11:22:56,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:22:56,219 INFO L93 Difference]: Finished difference Result 2250 states and 3468 transitions. [2020-12-23 11:22:56,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 11:22:56,220 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2020-12-23 11:22:56,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:22:56,229 INFO L225 Difference]: With dead ends: 2250 [2020-12-23 11:22:56,229 INFO L226 Difference]: Without dead ends: 1494 [2020-12-23 11:22:56,231 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 [2020-12-23 11:22:56,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2020-12-23 11:22:56,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1492. [2020-12-23 11:22:56,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1492 states. [2020-12-23 11:22:56,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 2282 transitions. [2020-12-23 11:22:56,344 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 2282 transitions. Word has length 112 [2020-12-23 11:22:56,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:22:56,344 INFO L481 AbstractCegarLoop]: Abstraction has 1492 states and 2282 transitions. [2020-12-23 11:22:56,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 11:22:56,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 2282 transitions. [2020-12-23 11:22:56,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-12-23 11:22:56,347 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:22:56,347 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:22:56,347 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 11:22:56,347 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:22:56,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:22:56,348 INFO L82 PathProgramCache]: Analyzing trace with hash -728020480, now seen corresponding path program 1 times [2020-12-23 11:22:56,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:22:56,349 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350369766] [2020-12-23 11:22:56,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:22:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:22:56,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:22:56,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350369766] [2020-12-23 11:22:56,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:22:56,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 11:22:56,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371891492] [2020-12-23 11:22:56,494 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 11:22:56,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:22:56,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 11:22:56,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-23 11:22:56,496 INFO L87 Difference]: Start difference. First operand 1492 states and 2282 transitions. Second operand 6 states. [2020-12-23 11:22:57,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:22:57,069 INFO L93 Difference]: Finished difference Result 4098 states and 6338 transitions. [2020-12-23 11:22:57,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 11:22:57,070 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2020-12-23 11:22:57,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:22:57,085 INFO L225 Difference]: With dead ends: 4098 [2020-12-23 11:22:57,085 INFO L226 Difference]: Without dead ends: 2686 [2020-12-23 11:22:57,089 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 [2020-12-23 11:22:57,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2686 states. [2020-12-23 11:22:57,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2686 to 2684. [2020-12-23 11:22:57,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2684 states. [2020-12-23 11:22:57,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2684 states to 2684 states and 4121 transitions. [2020-12-23 11:22:57,336 INFO L78 Accepts]: Start accepts. Automaton has 2684 states and 4121 transitions. Word has length 113 [2020-12-23 11:22:57,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:22:57,336 INFO L481 AbstractCegarLoop]: Abstraction has 2684 states and 4121 transitions. [2020-12-23 11:22:57,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 11:22:57,337 INFO L276 IsEmpty]: Start isEmpty. Operand 2684 states and 4121 transitions. [2020-12-23 11:22:57,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-12-23 11:22:57,339 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:22:57,339 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:22:57,340 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 11:22:57,340 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:22:57,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:22:57,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1444052176, now seen corresponding path program 1 times [2020-12-23 11:22:57,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:22:57,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002747403] [2020-12-23 11:22:57,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:22:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:22:57,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:22:57,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002747403] [2020-12-23 11:22:57,506 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:22:57,509 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 11:22:57,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197438281] [2020-12-23 11:22:57,510 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 11:22:57,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:22:57,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 11:22:57,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:22:57,512 INFO L87 Difference]: Start difference. First operand 2684 states and 4121 transitions. Second operand 5 states. [2020-12-23 11:22:57,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:22:57,962 INFO L93 Difference]: Finished difference Result 5304 states and 8176 transitions. [2020-12-23 11:22:57,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 11:22:57,962 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2020-12-23 11:22:57,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:22:57,978 INFO L225 Difference]: With dead ends: 5304 [2020-12-23 11:22:57,979 INFO L226 Difference]: Without dead ends: 2684 [2020-12-23 11:22:57,988 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 [2020-12-23 11:22:57,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2020-12-23 11:22:58,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 2684. [2020-12-23 11:22:58,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2684 states. [2020-12-23 11:22:58,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2684 states to 2684 states and 4088 transitions. [2020-12-23 11:22:58,253 INFO L78 Accepts]: Start accepts. Automaton has 2684 states and 4088 transitions. Word has length 114 [2020-12-23 11:22:58,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:22:58,253 INFO L481 AbstractCegarLoop]: Abstraction has 2684 states and 4088 transitions. [2020-12-23 11:22:58,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 11:22:58,254 INFO L276 IsEmpty]: Start isEmpty. Operand 2684 states and 4088 transitions. [2020-12-23 11:22:58,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-12-23 11:22:58,258 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:22:58,258 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:22:58,258 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 11:22:58,259 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:22:58,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:22:58,259 INFO L82 PathProgramCache]: Analyzing trace with hash 968610000, now seen corresponding path program 1 times [2020-12-23 11:22:58,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:22:58,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390218533] [2020-12-23 11:22:58,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:22:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:22:58,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:22:58,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390218533] [2020-12-23 11:22:58,428 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:22:58,428 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 11:22:58,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618341771] [2020-12-23 11:22:58,429 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 11:22:58,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:22:58,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 11:22:58,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:22:58,430 INFO L87 Difference]: Start difference. First operand 2684 states and 4088 transitions. Second operand 5 states. [2020-12-23 11:22:58,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:22:58,844 INFO L93 Difference]: Finished difference Result 5308 states and 8115 transitions. [2020-12-23 11:22:58,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 11:22:58,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2020-12-23 11:22:58,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:22:58,858 INFO L225 Difference]: With dead ends: 5308 [2020-12-23 11:22:58,858 INFO L226 Difference]: Without dead ends: 2684 [2020-12-23 11:22:58,862 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 [2020-12-23 11:22:58,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2020-12-23 11:22:59,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 2684. [2020-12-23 11:22:59,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2684 states. [2020-12-23 11:22:59,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2684 states to 2684 states and 4055 transitions. [2020-12-23 11:22:59,059 INFO L78 Accepts]: Start accepts. Automaton has 2684 states and 4055 transitions. Word has length 115 [2020-12-23 11:22:59,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:22:59,060 INFO L481 AbstractCegarLoop]: Abstraction has 2684 states and 4055 transitions. [2020-12-23 11:22:59,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 11:22:59,060 INFO L276 IsEmpty]: Start isEmpty. Operand 2684 states and 4055 transitions. [2020-12-23 11:22:59,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-12-23 11:22:59,062 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:22:59,063 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:22:59,063 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 11:22:59,063 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:22:59,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:22:59,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1957898812, now seen corresponding path program 1 times [2020-12-23 11:22:59,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:22:59,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222010322] [2020-12-23 11:22:59,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:22:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:22:59,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:22:59,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222010322] [2020-12-23 11:22:59,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:22:59,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 11:22:59,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092443094] [2020-12-23 11:22:59,313 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 11:22:59,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:22:59,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 11:22:59,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-12-23 11:22:59,316 INFO L87 Difference]: Start difference. First operand 2684 states and 4055 transitions. Second operand 9 states. [2020-12-23 11:23:01,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:23:01,348 INFO L93 Difference]: Finished difference Result 20736 states and 31587 transitions. [2020-12-23 11:23:01,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 11:23:01,349 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2020-12-23 11:23:01,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:23:01,447 INFO L225 Difference]: With dead ends: 20736 [2020-12-23 11:23:01,447 INFO L226 Difference]: Without dead ends: 18334 [2020-12-23 11:23:01,456 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2020-12-23 11:23:01,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18334 states. [2020-12-23 11:23:02,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18334 to 3911. [2020-12-23 11:23:02,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3911 states. [2020-12-23 11:23:02,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3911 states to 3911 states and 5935 transitions. [2020-12-23 11:23:02,133 INFO L78 Accepts]: Start accepts. Automaton has 3911 states and 5935 transitions. Word has length 116 [2020-12-23 11:23:02,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:23:02,134 INFO L481 AbstractCegarLoop]: Abstraction has 3911 states and 5935 transitions. [2020-12-23 11:23:02,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 11:23:02,134 INFO L276 IsEmpty]: Start isEmpty. Operand 3911 states and 5935 transitions. [2020-12-23 11:23:02,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-12-23 11:23:02,137 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:23:02,137 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:23:02,137 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 11:23:02,137 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:23:02,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:23:02,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1903030168, now seen corresponding path program 1 times [2020-12-23 11:23:02,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:23:02,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441936384] [2020-12-23 11:23:02,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:23:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:23:02,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:23:02,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441936384] [2020-12-23 11:23:02,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:23:02,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 11:23:02,509 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004595287] [2020-12-23 11:23:02,509 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 11:23:02,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:23:02,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 11:23:02,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-12-23 11:23:02,515 INFO L87 Difference]: Start difference. First operand 3911 states and 5935 transitions. Second operand 9 states. [2020-12-23 11:23:05,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:23:05,147 INFO L93 Difference]: Finished difference Result 21692 states and 33063 transitions. [2020-12-23 11:23:05,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 11:23:05,148 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2020-12-23 11:23:05,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:23:05,200 INFO L225 Difference]: With dead ends: 21692 [2020-12-23 11:23:05,200 INFO L226 Difference]: Without dead ends: 19290 [2020-12-23 11:23:05,210 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2020-12-23 11:23:05,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19290 states. [2020-12-23 11:23:06,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19290 to 6502. [2020-12-23 11:23:06,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6502 states. [2020-12-23 11:23:06,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6502 states to 6502 states and 9907 transitions. [2020-12-23 11:23:06,411 INFO L78 Accepts]: Start accepts. Automaton has 6502 states and 9907 transitions. Word has length 116 [2020-12-23 11:23:06,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:23:06,412 INFO L481 AbstractCegarLoop]: Abstraction has 6502 states and 9907 transitions. [2020-12-23 11:23:06,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 11:23:06,412 INFO L276 IsEmpty]: Start isEmpty. Operand 6502 states and 9907 transitions. [2020-12-23 11:23:06,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-12-23 11:23:06,415 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:23:06,416 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:23:06,416 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 11:23:06,416 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:23:06,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:23:06,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1390282604, now seen corresponding path program 1 times [2020-12-23 11:23:06,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:23:06,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432532671] [2020-12-23 11:23:06,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:23:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:23:06,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:23:06,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432532671] [2020-12-23 11:23:06,661 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:23:06,661 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 11:23:06,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108803871] [2020-12-23 11:23:06,662 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 11:23:06,662 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:23:06,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 11:23:06,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-12-23 11:23:06,663 INFO L87 Difference]: Start difference. First operand 6502 states and 9907 transitions. Second operand 9 states. [2020-12-23 11:23:09,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:23:09,147 INFO L93 Difference]: Finished difference Result 22666 states and 34557 transitions. [2020-12-23 11:23:09,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 11:23:09,147 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2020-12-23 11:23:09,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:23:09,192 INFO L225 Difference]: With dead ends: 22666 [2020-12-23 11:23:09,193 INFO L226 Difference]: Without dead ends: 20264 [2020-12-23 11:23:09,201 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2020-12-23 11:23:09,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20264 states. [2020-12-23 11:23:10,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20264 to 7758. [2020-12-23 11:23:10,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7758 states. [2020-12-23 11:23:10,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7758 states to 7758 states and 11831 transitions. [2020-12-23 11:23:10,352 INFO L78 Accepts]: Start accepts. Automaton has 7758 states and 11831 transitions. Word has length 116 [2020-12-23 11:23:10,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:23:10,353 INFO L481 AbstractCegarLoop]: Abstraction has 7758 states and 11831 transitions. [2020-12-23 11:23:10,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 11:23:10,353 INFO L276 IsEmpty]: Start isEmpty. Operand 7758 states and 11831 transitions. [2020-12-23 11:23:10,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-12-23 11:23:10,357 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:23:10,357 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:23:10,357 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 11:23:10,358 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:23:10,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:23:10,358 INFO L82 PathProgramCache]: Analyzing trace with hash 2053503990, now seen corresponding path program 1 times [2020-12-23 11:23:10,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:23:10,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691685730] [2020-12-23 11:23:10,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:23:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:23:10,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:23:10,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691685730] [2020-12-23 11:23:10,586 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:23:10,586 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 11:23:10,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151633131] [2020-12-23 11:23:10,587 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 11:23:10,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:23:10,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 11:23:10,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-12-23 11:23:10,588 INFO L87 Difference]: Start difference. First operand 7758 states and 11831 transitions. Second operand 9 states. [2020-12-23 11:23:13,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:23:13,526 INFO L93 Difference]: Finished difference Result 23744 states and 36211 transitions. [2020-12-23 11:23:13,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 11:23:13,527 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2020-12-23 11:23:13,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:23:13,573 INFO L225 Difference]: With dead ends: 23744 [2020-12-23 11:23:13,574 INFO L226 Difference]: Without dead ends: 21342 [2020-12-23 11:23:13,582 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2020-12-23 11:23:13,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21342 states. [2020-12-23 11:23:14,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21342 to 8998. [2020-12-23 11:23:14,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8998 states. [2020-12-23 11:23:14,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8998 states to 8998 states and 13727 transitions. [2020-12-23 11:23:14,788 INFO L78 Accepts]: Start accepts. Automaton has 8998 states and 13727 transitions. Word has length 116 [2020-12-23 11:23:14,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:23:14,789 INFO L481 AbstractCegarLoop]: Abstraction has 8998 states and 13727 transitions. [2020-12-23 11:23:14,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 11:23:14,789 INFO L276 IsEmpty]: Start isEmpty. Operand 8998 states and 13727 transitions. [2020-12-23 11:23:14,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-12-23 11:23:14,792 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:23:14,792 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:23:14,792 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 11:23:14,793 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:23:14,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:23:14,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1093472964, now seen corresponding path program 1 times [2020-12-23 11:23:14,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:23:14,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121193668] [2020-12-23 11:23:14,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:23:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:23:14,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:23:14,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121193668] [2020-12-23 11:23:14,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:23:14,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:23:14,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578911274] [2020-12-23 11:23:14,862 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:23:14,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:23:14,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:23:14,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:23:14,863 INFO L87 Difference]: Start difference. First operand 8998 states and 13727 transitions. Second operand 3 states. [2020-12-23 11:23:17,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:23:17,212 INFO L93 Difference]: Finished difference Result 25482 states and 38769 transitions. [2020-12-23 11:23:17,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:23:17,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2020-12-23 11:23:17,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:23:17,241 INFO L225 Difference]: With dead ends: 25482 [2020-12-23 11:23:17,241 INFO L226 Difference]: Without dead ends: 16920 [2020-12-23 11:23:17,253 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 [2020-12-23 11:23:17,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16920 states. [2020-12-23 11:23:20,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16920 to 16694. [2020-12-23 11:23:20,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16694 states. [2020-12-23 11:23:20,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16694 states to 16694 states and 25135 transitions. [2020-12-23 11:23:20,029 INFO L78 Accepts]: Start accepts. Automaton has 16694 states and 25135 transitions. Word has length 116 [2020-12-23 11:23:20,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:23:20,029 INFO L481 AbstractCegarLoop]: Abstraction has 16694 states and 25135 transitions. [2020-12-23 11:23:20,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:23:20,029 INFO L276 IsEmpty]: Start isEmpty. Operand 16694 states and 25135 transitions. [2020-12-23 11:23:20,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-12-23 11:23:20,034 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:23:20,035 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:23:20,035 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 11:23:20,035 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:23:20,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:23:20,036 INFO L82 PathProgramCache]: Analyzing trace with hash -849395301, now seen corresponding path program 1 times [2020-12-23 11:23:20,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:23:20,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504345412] [2020-12-23 11:23:20,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:23:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:23:20,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:23:20,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504345412] [2020-12-23 11:23:20,147 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:23:20,148 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:23:20,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989075570] [2020-12-23 11:23:20,148 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:23:20,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:23:20,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:23:20,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:23:20,149 INFO L87 Difference]: Start difference. First operand 16694 states and 25135 transitions. Second operand 3 states. [2020-12-23 11:23:23,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:23:23,912 INFO L93 Difference]: Finished difference Result 44554 states and 67089 transitions. [2020-12-23 11:23:23,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:23:23,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2020-12-23 11:23:23,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:23:23,952 INFO L225 Difference]: With dead ends: 44554 [2020-12-23 11:23:23,953 INFO L226 Difference]: Without dead ends: 28296 [2020-12-23 11:23:23,977 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 [2020-12-23 11:23:24,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28296 states. [2020-12-23 11:23:27,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28296 to 28294. [2020-12-23 11:23:27,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28294 states. [2020-12-23 11:23:27,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28294 states to 28294 states and 42383 transitions. [2020-12-23 11:23:27,963 INFO L78 Accepts]: Start accepts. Automaton has 28294 states and 42383 transitions. Word has length 116 [2020-12-23 11:23:27,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:23:27,964 INFO L481 AbstractCegarLoop]: Abstraction has 28294 states and 42383 transitions. [2020-12-23 11:23:27,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:23:27,964 INFO L276 IsEmpty]: Start isEmpty. Operand 28294 states and 42383 transitions. [2020-12-23 11:23:27,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-12-23 11:23:27,968 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:23:27,968 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:23:27,969 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 11:23:27,969 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:23:27,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:23:27,969 INFO L82 PathProgramCache]: Analyzing trace with hash 197694076, now seen corresponding path program 1 times [2020-12-23 11:23:27,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:23:27,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885865648] [2020-12-23 11:23:27,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:23:28,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:23:28,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:23:28,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885865648] [2020-12-23 11:23:28,344 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:23:28,344 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 11:23:28,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514465632] [2020-12-23 11:23:28,344 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 11:23:28,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:23:28,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 11:23:28,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-12-23 11:23:28,346 INFO L87 Difference]: Start difference. First operand 28294 states and 42383 transitions. Second operand 9 states. [2020-12-23 11:23:37,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:23:37,834 INFO L93 Difference]: Finished difference Result 74570 states and 111901 transitions. [2020-12-23 11:23:37,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 11:23:37,835 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2020-12-23 11:23:37,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:23:37,903 INFO L225 Difference]: With dead ends: 74570 [2020-12-23 11:23:37,903 INFO L226 Difference]: Without dead ends: 67672 [2020-12-23 11:23:37,921 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-12-23 11:23:37,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67672 states. [2020-12-23 11:23:42,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67672 to 32950. [2020-12-23 11:23:42,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32950 states. [2020-12-23 11:23:42,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32950 states to 32950 states and 49359 transitions. [2020-12-23 11:23:42,960 INFO L78 Accepts]: Start accepts. Automaton has 32950 states and 49359 transitions. Word has length 116 [2020-12-23 11:23:42,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:23:42,961 INFO L481 AbstractCegarLoop]: Abstraction has 32950 states and 49359 transitions. [2020-12-23 11:23:42,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 11:23:42,961 INFO L276 IsEmpty]: Start isEmpty. Operand 32950 states and 49359 transitions. [2020-12-23 11:23:42,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-12-23 11:23:42,964 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:23:42,964 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:23:42,965 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 11:23:42,965 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:23:42,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:23:42,966 INFO L82 PathProgramCache]: Analyzing trace with hash 2050931402, now seen corresponding path program 1 times [2020-12-23 11:23:42,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:23:42,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105238279] [2020-12-23 11:23:42,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:23:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:23:43,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:23:43,166 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105238279] [2020-12-23 11:23:43,167 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:23:43,167 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 11:23:43,167 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453681928] [2020-12-23 11:23:43,167 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 11:23:43,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:23:43,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 11:23:43,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-12-23 11:23:43,168 INFO L87 Difference]: Start difference. First operand 32950 states and 49359 transitions. Second operand 9 states. [2020-12-23 11:23:54,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:23:54,844 INFO L93 Difference]: Finished difference Result 80166 states and 120303 transitions. [2020-12-23 11:23:54,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 11:23:54,845 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2020-12-23 11:23:54,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:23:54,925 INFO L225 Difference]: With dead ends: 80166 [2020-12-23 11:23:54,925 INFO L226 Difference]: Without dead ends: 73268 [2020-12-23 11:23:54,945 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2020-12-23 11:23:55,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73268 states. [2020-12-23 11:24:00,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73268 to 37640. [2020-12-23 11:24:00,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37640 states. [2020-12-23 11:24:00,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37640 states to 37640 states and 56387 transitions. [2020-12-23 11:24:00,819 INFO L78 Accepts]: Start accepts. Automaton has 37640 states and 56387 transitions. Word has length 116 [2020-12-23 11:24:00,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:24:00,819 INFO L481 AbstractCegarLoop]: Abstraction has 37640 states and 56387 transitions. [2020-12-23 11:24:00,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 11:24:00,819 INFO L276 IsEmpty]: Start isEmpty. Operand 37640 states and 56387 transitions. [2020-12-23 11:24:00,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-12-23 11:24:00,824 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:24:00,824 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:24:00,824 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 11:24:00,825 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:24:00,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:24:00,825 INFO L82 PathProgramCache]: Analyzing trace with hash 653892510, now seen corresponding path program 1 times [2020-12-23 11:24:00,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:24:00,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147767624] [2020-12-23 11:24:00,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:24:00,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:24:01,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:24:01,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147767624] [2020-12-23 11:24:01,023 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:24:01,023 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 11:24:01,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583999632] [2020-12-23 11:24:01,024 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 11:24:01,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:24:01,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 11:24:01,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-12-23 11:24:01,025 INFO L87 Difference]: Start difference. First operand 37640 states and 56387 transitions. Second operand 9 states. [2020-12-23 11:24:14,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:24:14,486 INFO L93 Difference]: Finished difference Result 85524 states and 128343 transitions. [2020-12-23 11:24:14,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 11:24:14,487 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2020-12-23 11:24:14,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:24:14,578 INFO L225 Difference]: With dead ends: 85524 [2020-12-23 11:24:14,578 INFO L226 Difference]: Without dead ends: 78626 [2020-12-23 11:24:14,601 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2020-12-23 11:24:14,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78626 states. [2020-12-23 11:24:21,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78626 to 42379. [2020-12-23 11:24:21,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42379 states. [2020-12-23 11:24:21,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42379 states to 42379 states and 63491 transitions. [2020-12-23 11:24:21,970 INFO L78 Accepts]: Start accepts. Automaton has 42379 states and 63491 transitions. Word has length 116 [2020-12-23 11:24:21,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:24:21,970 INFO L481 AbstractCegarLoop]: Abstraction has 42379 states and 63491 transitions. [2020-12-23 11:24:21,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 11:24:21,970 INFO L276 IsEmpty]: Start isEmpty. Operand 42379 states and 63491 transitions. [2020-12-23 11:24:21,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-12-23 11:24:21,976 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:24:21,976 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:24:21,976 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 11:24:21,976 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:24:21,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:24:21,977 INFO L82 PathProgramCache]: Analyzing trace with hash 695724750, now seen corresponding path program 1 times [2020-12-23 11:24:21,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:24:21,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264257833] [2020-12-23 11:24:21,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:24:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:24:22,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:24:22,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264257833] [2020-12-23 11:24:22,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:24:22,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 11:24:22,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844252593] [2020-12-23 11:24:22,313 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 11:24:22,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:24:22,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 11:24:22,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-12-23 11:24:22,314 INFO L87 Difference]: Start difference. First operand 42379 states and 63491 transitions. Second operand 10 states. [2020-12-23 11:24:39,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:24:39,622 INFO L93 Difference]: Finished difference Result 127846 states and 191029 transitions. [2020-12-23 11:24:39,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-23 11:24:39,622 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 117 [2020-12-23 11:24:39,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:24:39,733 INFO L225 Difference]: With dead ends: 127846 [2020-12-23 11:24:39,733 INFO L226 Difference]: Without dead ends: 85696 [2020-12-23 11:24:39,789 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2020-12-23 11:24:39,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85696 states. [2020-12-23 11:24:48,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85696 to 42379. [2020-12-23 11:24:48,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42379 states. [2020-12-23 11:24:48,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42379 states to 42379 states and 63485 transitions. [2020-12-23 11:24:48,277 INFO L78 Accepts]: Start accepts. Automaton has 42379 states and 63485 transitions. Word has length 117 [2020-12-23 11:24:48,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:24:48,277 INFO L481 AbstractCegarLoop]: Abstraction has 42379 states and 63485 transitions. [2020-12-23 11:24:48,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 11:24:48,277 INFO L276 IsEmpty]: Start isEmpty. Operand 42379 states and 63485 transitions. [2020-12-23 11:24:48,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-12-23 11:24:48,283 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:24:48,283 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:24:48,283 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 11:24:48,283 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:24:48,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:24:48,284 INFO L82 PathProgramCache]: Analyzing trace with hash -674648634, now seen corresponding path program 1 times [2020-12-23 11:24:48,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:24:48,284 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760459816] [2020-12-23 11:24:48,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:24:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:24:48,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:24:48,694 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760459816] [2020-12-23 11:24:48,694 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:24:48,694 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 11:24:48,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095373371] [2020-12-23 11:24:48,695 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 11:24:48,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:24:48,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 11:24:48,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-12-23 11:24:48,696 INFO L87 Difference]: Start difference. First operand 42379 states and 63485 transitions. Second operand 10 states. [2020-12-23 11:25:02,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:25:02,989 INFO L93 Difference]: Finished difference Result 106178 states and 158752 transitions. [2020-12-23 11:25:02,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-23 11:25:02,989 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 118 [2020-12-23 11:25:02,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:25:03,053 INFO L225 Difference]: With dead ends: 106178 [2020-12-23 11:25:03,053 INFO L226 Difference]: Without dead ends: 64013 [2020-12-23 11:25:03,084 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2020-12-23 11:25:03,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64013 states. [2020-12-23 11:25:11,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64013 to 42379. [2020-12-23 11:25:11,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42379 states. [2020-12-23 11:25:12,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42379 states to 42379 states and 63482 transitions. [2020-12-23 11:25:12,016 INFO L78 Accepts]: Start accepts. Automaton has 42379 states and 63482 transitions. Word has length 118 [2020-12-23 11:25:12,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:25:12,016 INFO L481 AbstractCegarLoop]: Abstraction has 42379 states and 63482 transitions. [2020-12-23 11:25:12,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 11:25:12,016 INFO L276 IsEmpty]: Start isEmpty. Operand 42379 states and 63482 transitions. [2020-12-23 11:25:12,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-12-23 11:25:12,020 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:25:12,021 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:25:12,021 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 11:25:12,021 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:25:12,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:25:12,021 INFO L82 PathProgramCache]: Analyzing trace with hash 995910944, now seen corresponding path program 1 times [2020-12-23 11:25:12,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:25:12,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240113845] [2020-12-23 11:25:12,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:25:12,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:25:12,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:25:12,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240113845] [2020-12-23 11:25:12,291 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:25:12,291 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 11:25:12,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981198130] [2020-12-23 11:25:12,292 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 11:25:12,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:25:12,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 11:25:12,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-12-23 11:25:12,293 INFO L87 Difference]: Start difference. First operand 42379 states and 63482 transitions. Second operand 9 states. [2020-12-23 11:25:27,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:25:27,138 INFO L93 Difference]: Finished difference Result 105467 states and 157969 transitions. [2020-12-23 11:25:27,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 11:25:27,139 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2020-12-23 11:25:27,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:25:27,204 INFO L225 Difference]: With dead ends: 105467 [2020-12-23 11:25:27,204 INFO L226 Difference]: Without dead ends: 63437 [2020-12-23 11:25:27,229 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2020-12-23 11:25:27,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63437 states. [2020-12-23 11:25:36,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63437 to 42379. [2020-12-23 11:25:36,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42379 states. [2020-12-23 11:25:36,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42379 states to 42379 states and 63481 transitions. [2020-12-23 11:25:36,912 INFO L78 Accepts]: Start accepts. Automaton has 42379 states and 63481 transitions. Word has length 118 [2020-12-23 11:25:36,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:25:36,913 INFO L481 AbstractCegarLoop]: Abstraction has 42379 states and 63481 transitions. [2020-12-23 11:25:36,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 11:25:36,913 INFO L276 IsEmpty]: Start isEmpty. Operand 42379 states and 63481 transitions. [2020-12-23 11:25:36,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-12-23 11:25:36,917 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:25:36,917 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:25:36,917 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 11:25:36,917 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:25:36,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:25:36,918 INFO L82 PathProgramCache]: Analyzing trace with hash 486666998, now seen corresponding path program 1 times [2020-12-23 11:25:36,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:25:36,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465523713] [2020-12-23 11:25:36,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:25:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:25:37,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:25:37,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465523713] [2020-12-23 11:25:37,174 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:25:37,175 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 11:25:37,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237282322] [2020-12-23 11:25:37,177 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 11:25:37,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:25:37,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 11:25:37,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-12-23 11:25:37,178 INFO L87 Difference]: Start difference. First operand 42379 states and 63481 transitions. Second operand 10 states. [2020-12-23 11:25:59,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:25:59,071 INFO L93 Difference]: Finished difference Result 127676 states and 190759 transitions. [2020-12-23 11:25:59,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-23 11:25:59,072 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 119 [2020-12-23 11:25:59,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:25:59,166 INFO L225 Difference]: With dead ends: 127676 [2020-12-23 11:25:59,166 INFO L226 Difference]: Without dead ends: 85681 [2020-12-23 11:25:59,195 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2020-12-23 11:25:59,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85681 states. [2020-12-23 11:26:09,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85681 to 42379. [2020-12-23 11:26:09,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42379 states. [2020-12-23 11:26:09,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42379 states to 42379 states and 63472 transitions. [2020-12-23 11:26:09,582 INFO L78 Accepts]: Start accepts. Automaton has 42379 states and 63472 transitions. Word has length 119 [2020-12-23 11:26:09,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:26:09,582 INFO L481 AbstractCegarLoop]: Abstraction has 42379 states and 63472 transitions. [2020-12-23 11:26:09,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 11:26:09,582 INFO L276 IsEmpty]: Start isEmpty. Operand 42379 states and 63472 transitions. [2020-12-23 11:26:09,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-12-23 11:26:09,585 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:26:09,585 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:26:09,585 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 11:26:09,585 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:26:09,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:26:09,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1272071619, now seen corresponding path program 1 times [2020-12-23 11:26:09,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:26:09,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603319345] [2020-12-23 11:26:09,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:26:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:26:09,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:26:09,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603319345] [2020-12-23 11:26:09,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:26:09,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 11:26:09,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460439470] [2020-12-23 11:26:09,883 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 11:26:09,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:26:09,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 11:26:09,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-12-23 11:26:09,884 INFO L87 Difference]: Start difference. First operand 42379 states and 63472 transitions. Second operand 10 states. [2020-12-23 11:26:27,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:26:27,700 INFO L93 Difference]: Finished difference Result 105963 states and 158410 transitions. [2020-12-23 11:26:27,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-23 11:26:27,701 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2020-12-23 11:26:27,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:26:27,783 INFO L225 Difference]: With dead ends: 105963 [2020-12-23 11:26:27,783 INFO L226 Difference]: Without dead ends: 64013 [2020-12-23 11:26:27,814 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2020-12-23 11:26:27,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64013 states. [2020-12-23 11:26:38,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64013 to 42379. [2020-12-23 11:26:38,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42379 states. [2020-12-23 11:26:38,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42379 states to 42379 states and 63452 transitions. [2020-12-23 11:26:38,641 INFO L78 Accepts]: Start accepts. Automaton has 42379 states and 63452 transitions. Word has length 120 [2020-12-23 11:26:38,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:26:38,641 INFO L481 AbstractCegarLoop]: Abstraction has 42379 states and 63452 transitions. [2020-12-23 11:26:38,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 11:26:38,642 INFO L276 IsEmpty]: Start isEmpty. Operand 42379 states and 63452 transitions. [2020-12-23 11:26:38,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-12-23 11:26:38,644 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:26:38,645 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:26:38,645 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 11:26:38,645 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:26:38,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:26:38,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1269513856, now seen corresponding path program 1 times [2020-12-23 11:26:38,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:26:38,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033694751] [2020-12-23 11:26:38,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:26:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:26:38,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:26:38,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033694751] [2020-12-23 11:26:38,895 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:26:38,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 11:26:38,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977679467] [2020-12-23 11:26:38,896 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 11:26:38,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:26:38,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 11:26:38,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-12-23 11:26:38,897 INFO L87 Difference]: Start difference. First operand 42379 states and 63452 transitions. Second operand 10 states.