/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_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 20:18:11,497 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 20:18:11,500 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 20:18:11,554 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 20:18:11,555 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 20:18:11,559 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 20:18:11,563 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 20:18:11,569 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 20:18:11,572 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 20:18:11,580 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 20:18:11,585 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 20:18:11,587 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 20:18:11,587 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 20:18:11,591 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 20:18:11,593 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 20:18:11,595 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 20:18:11,596 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 20:18:11,601 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 20:18:11,622 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 20:18:11,627 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 20:18:11,631 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 20:18:11,634 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 20:18:11,637 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 20:18:11,638 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 20:18:11,647 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 20:18:11,647 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 20:18:11,648 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 20:18:11,650 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 20:18:11,651 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 20:18:11,652 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 20:18:11,652 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 20:18:11,653 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 20:18:11,655 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 20:18:11,656 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 20:18:11,658 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 20:18:11,658 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 20:18:11,659 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 20:18:11,659 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 20:18:11,659 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 20:18:11,660 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 20:18:11,661 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 20:18:11,662 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 20:18:11,715 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 20:18:11,715 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 20:18:11,721 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 20:18:11,721 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 20:18:11,721 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 20:18:11,723 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 20:18:11,723 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 20:18:11,723 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 20:18:11,724 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 20:18:11,724 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 20:18:11,725 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 20:18:11,725 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 20:18:11,726 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 20:18:11,726 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 20:18:11,726 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 20:18:11,726 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 20:18:11,726 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 20:18:11,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 20:18:11,729 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 20:18:11,730 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 20:18:11,730 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 20:18:11,731 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 20:18:11,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 20:18:11,732 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 20:18:11,732 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 20:18:11,732 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 20:18:12,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 20:18:12,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 20:18:12,178 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 20:18:12,180 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 20:18:12,181 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 20:18:12,182 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2021-01-06 20:18:12,275 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/6885087c6/e03fbb5d921a49328f36bd5db7286c95/FLAGf23585c96 [2021-01-06 20:18:13,130 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 20:18:13,131 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2021-01-06 20:18:13,152 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/6885087c6/e03fbb5d921a49328f36bd5db7286c95/FLAGf23585c96 [2021-01-06 20:18:13,385 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/6885087c6/e03fbb5d921a49328f36bd5db7286c95 [2021-01-06 20:18:13,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 20:18:13,391 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 20:18:13,393 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 20:18:13,393 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 20:18:13,397 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 20:18:13,398 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 08:18:13" (1/1) ... [2021-01-06 20:18:13,400 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@433496c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:18:13, skipping insertion in model container [2021-01-06 20:18:13,400 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 08:18:13" (1/1) ... [2021-01-06 20:18:13,409 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 20:18:13,453 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[~ep12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep31~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep32~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~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[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~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[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~init__r121~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r131~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r211~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r231~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r311~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r321~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r122~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r132~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r212~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r232~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r312~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r322~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_1756~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_1887~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~0,] [2021-01-06 20:18:13,717 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_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[6663,6676] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p32_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_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p23_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_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p13_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_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_1985~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] [2021-01-06 20:18:13,758 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 20:18:13,776 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[~ep12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep31~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep32~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~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[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~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[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~init__r121~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r131~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r211~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r231~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r311~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r321~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r122~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r132~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r212~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r232~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r312~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r322~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_1756~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_1887~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~0,] [2021-01-06 20:18:13,845 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_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[6663,6676] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p32_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_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p23_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_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p13_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_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_1985~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] [2021-01-06 20:18:13,884 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 20:18:13,917 INFO L208 MainTranslator]: Completed translation [2021-01-06 20:18:13,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:18:13 WrapperNode [2021-01-06 20:18:13,918 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 20:18:13,920 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 20:18:13,920 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 20:18:13,920 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 20:18:13,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:18:13" (1/1) ... [2021-01-06 20:18:13,945 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:18:13" (1/1) ... [2021-01-06 20:18:14,012 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 20:18:14,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 20:18:14,013 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 20:18:14,013 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 20:18:14,026 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:18:13" (1/1) ... [2021-01-06 20:18:14,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:18:13" (1/1) ... [2021-01-06 20:18:14,035 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:18:13" (1/1) ... [2021-01-06 20:18:14,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:18:13" (1/1) ... [2021-01-06 20:18:14,056 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:18:13" (1/1) ... [2021-01-06 20:18:14,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:18:13" (1/1) ... [2021-01-06 20:18:14,085 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:18:13" (1/1) ... [2021-01-06 20:18:14,092 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 20:18:14,094 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 20:18:14,094 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 20:18:14,094 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 20:18:14,095 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:18:13" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 20:18:14,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 20:18:14,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 20:18:14,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 20:18:14,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 20:18:15,380 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 20:18:15,381 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-01-06 20:18:15,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 08:18:15 BoogieIcfgContainer [2021-01-06 20:18:15,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 20:18:15,385 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 20:18:15,386 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 20:18:15,390 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 20:18:15,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 08:18:13" (1/3) ... [2021-01-06 20:18:15,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f3270b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 08:18:15, skipping insertion in model container [2021-01-06 20:18:15,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:18:13" (2/3) ... [2021-01-06 20:18:15,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f3270b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 08:18:15, skipping insertion in model container [2021-01-06 20:18:15,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 08:18:15" (3/3) ... [2021-01-06 20:18:15,394 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2021-01-06 20:18:15,401 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 20:18:15,408 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 20:18:15,429 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 20:18:15,458 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 20:18:15,458 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 20:18:15,459 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 20:18:15,459 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 20:18:15,459 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 20:18:15,459 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 20:18:15,459 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 20:18:15,459 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 20:18:15,480 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2021-01-06 20:18:15,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-06 20:18:15,491 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:18:15,492 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] [2021-01-06 20:18:15,493 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:18:15,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:18:15,500 INFO L82 PathProgramCache]: Analyzing trace with hash 794226412, now seen corresponding path program 1 times [2021-01-06 20:18:15,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:18:15,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575031544] [2021-01-06 20:18:15,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:18:15,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:18:16,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:18:16,075 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575031544] [2021-01-06 20:18:16,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:18:16,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:18:16,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765697893] [2021-01-06 20:18:16,083 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:18:16,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:18:16,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:18:16,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:18:16,103 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 3 states. [2021-01-06 20:18:16,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:18:16,220 INFO L93 Difference]: Finished difference Result 282 states and 479 transitions. [2021-01-06 20:18:16,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:18:16,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2021-01-06 20:18:16,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:18:16,238 INFO L225 Difference]: With dead ends: 282 [2021-01-06 20:18:16,238 INFO L226 Difference]: Without dead ends: 195 [2021-01-06 20:18:16,243 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:18:16,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-01-06 20:18:16,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 193. [2021-01-06 20:18:16,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2021-01-06 20:18:16,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 307 transitions. [2021-01-06 20:18:16,335 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 307 transitions. Word has length 51 [2021-01-06 20:18:16,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:18:16,336 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 307 transitions. [2021-01-06 20:18:16,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:18:16,336 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 307 transitions. [2021-01-06 20:18:16,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-01-06 20:18:16,339 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:18:16,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] [2021-01-06 20:18:16,340 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 20:18:16,340 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:18:16,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:18:16,341 INFO L82 PathProgramCache]: Analyzing trace with hash -797280551, now seen corresponding path program 1 times [2021-01-06 20:18:16,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:18:16,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628915572] [2021-01-06 20:18:16,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:18:16,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:18:16,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:18:16,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628915572] [2021-01-06 20:18:16,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:18:16,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:18:16,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560365825] [2021-01-06 20:18:16,515 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:18:16,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:18:16,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:18:16,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:18:16,519 INFO L87 Difference]: Start difference. First operand 193 states and 307 transitions. Second operand 3 states. [2021-01-06 20:18:16,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:18:16,615 INFO L93 Difference]: Finished difference Result 469 states and 763 transitions. [2021-01-06 20:18:16,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:18:16,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2021-01-06 20:18:16,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:18:16,625 INFO L225 Difference]: With dead ends: 469 [2021-01-06 20:18:16,625 INFO L226 Difference]: Without dead ends: 324 [2021-01-06 20:18:16,627 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:18:16,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-01-06 20:18:16,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 322. [2021-01-06 20:18:16,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2021-01-06 20:18:16,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 519 transitions. [2021-01-06 20:18:16,675 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 519 transitions. Word has length 53 [2021-01-06 20:18:16,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:18:16,676 INFO L481 AbstractCegarLoop]: Abstraction has 322 states and 519 transitions. [2021-01-06 20:18:16,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:18:16,676 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 519 transitions. [2021-01-06 20:18:16,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-01-06 20:18:16,680 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:18:16,680 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] [2021-01-06 20:18:16,681 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 20:18:16,681 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:18:16,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:18:16,682 INFO L82 PathProgramCache]: Analyzing trace with hash 59105759, now seen corresponding path program 1 times [2021-01-06 20:18:16,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:18:16,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650716359] [2021-01-06 20:18:16,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:18:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:18:16,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:18:16,820 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650716359] [2021-01-06 20:18:16,820 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:18:16,821 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:18:16,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182261826] [2021-01-06 20:18:16,821 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:18:16,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:18:16,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:18:16,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:18:16,823 INFO L87 Difference]: Start difference. First operand 322 states and 519 transitions. Second operand 3 states. [2021-01-06 20:18:16,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:18:16,888 INFO L93 Difference]: Finished difference Result 597 states and 975 transitions. [2021-01-06 20:18:16,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:18:16,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2021-01-06 20:18:16,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:18:16,892 INFO L225 Difference]: With dead ends: 597 [2021-01-06 20:18:16,892 INFO L226 Difference]: Without dead ends: 452 [2021-01-06 20:18:16,899 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:18:16,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2021-01-06 20:18:16,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 450. [2021-01-06 20:18:16,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2021-01-06 20:18:17,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 729 transitions. [2021-01-06 20:18:17,001 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 729 transitions. Word has length 55 [2021-01-06 20:18:17,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:18:17,002 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 729 transitions. [2021-01-06 20:18:17,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:18:17,002 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 729 transitions. [2021-01-06 20:18:17,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-01-06 20:18:17,008 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:18:17,008 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] [2021-01-06 20:18:17,009 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 20:18:17,009 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:18:17,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:18:17,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1104417908, now seen corresponding path program 1 times [2021-01-06 20:18:17,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:18:17,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122499545] [2021-01-06 20:18:17,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:18:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:18:17,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:18:17,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122499545] [2021-01-06 20:18:17,155 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:18:17,155 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:18:17,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730888959] [2021-01-06 20:18:17,156 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:18:17,156 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:18:17,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:18:17,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:18:17,157 INFO L87 Difference]: Start difference. First operand 450 states and 729 transitions. Second operand 3 states. [2021-01-06 20:18:17,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:18:17,250 INFO L93 Difference]: Finished difference Result 1166 states and 1905 transitions. [2021-01-06 20:18:17,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:18:17,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2021-01-06 20:18:17,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:18:17,258 INFO L225 Difference]: With dead ends: 1166 [2021-01-06 20:18:17,258 INFO L226 Difference]: Without dead ends: 787 [2021-01-06 20:18:17,265 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:18:17,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2021-01-06 20:18:17,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 785. [2021-01-06 20:18:17,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2021-01-06 20:18:17,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1271 transitions. [2021-01-06 20:18:17,315 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1271 transitions. Word has length 55 [2021-01-06 20:18:17,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:18:17,316 INFO L481 AbstractCegarLoop]: Abstraction has 785 states and 1271 transitions. [2021-01-06 20:18:17,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:18:17,316 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1271 transitions. [2021-01-06 20:18:17,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-01-06 20:18:17,318 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:18:17,318 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] [2021-01-06 20:18:17,319 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 20:18:17,319 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:18:17,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:18:17,320 INFO L82 PathProgramCache]: Analyzing trace with hash -179259079, now seen corresponding path program 1 times [2021-01-06 20:18:17,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:18:17,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860471292] [2021-01-06 20:18:17,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:18:17,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:18:17,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:18:17,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860471292] [2021-01-06 20:18:17,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:18:17,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 20:18:17,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905944020] [2021-01-06 20:18:17,526 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:18:17,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:18:17,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:18:17,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:18:17,527 INFO L87 Difference]: Start difference. First operand 785 states and 1271 transitions. Second operand 5 states. [2021-01-06 20:18:17,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:18:17,848 INFO L93 Difference]: Finished difference Result 3092 states and 5109 transitions. [2021-01-06 20:18:17,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 20:18:17,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2021-01-06 20:18:17,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:18:17,867 INFO L225 Difference]: With dead ends: 3092 [2021-01-06 20:18:17,868 INFO L226 Difference]: Without dead ends: 2378 [2021-01-06 20:18:17,870 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-01-06 20:18:17,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2378 states. [2021-01-06 20:18:17,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 1426. [2021-01-06 20:18:17,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1426 states. [2021-01-06 20:18:17,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 2317 transitions. [2021-01-06 20:18:18,000 INFO L78 Accepts]: Start accepts. Automaton has 1426 states and 2317 transitions. Word has length 57 [2021-01-06 20:18:18,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:18:18,000 INFO L481 AbstractCegarLoop]: Abstraction has 1426 states and 2317 transitions. [2021-01-06 20:18:18,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:18:18,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 2317 transitions. [2021-01-06 20:18:18,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-01-06 20:18:18,003 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:18:18,003 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] [2021-01-06 20:18:18,003 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 20:18:18,003 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:18:18,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:18:18,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1324568371, now seen corresponding path program 1 times [2021-01-06 20:18:18,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:18:18,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476279558] [2021-01-06 20:18:18,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:18:18,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:18:18,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:18:18,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476279558] [2021-01-06 20:18:18,160 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:18:18,161 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 20:18:18,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000700465] [2021-01-06 20:18:18,162 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 20:18:18,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:18:18,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 20:18:18,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 20:18:18,165 INFO L87 Difference]: Start difference. First operand 1426 states and 2317 transitions. Second operand 4 states. [2021-01-06 20:18:18,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:18:18,458 INFO L93 Difference]: Finished difference Result 4193 states and 6904 transitions. [2021-01-06 20:18:18,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 20:18:18,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2021-01-06 20:18:18,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:18:18,477 INFO L225 Difference]: With dead ends: 4193 [2021-01-06 20:18:18,477 INFO L226 Difference]: Without dead ends: 2840 [2021-01-06 20:18:18,481 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:18:18,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2840 states. [2021-01-06 20:18:18,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2840 to 2121. [2021-01-06 20:18:18,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2121 states. [2021-01-06 20:18:18,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 3460 transitions. [2021-01-06 20:18:18,706 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 3460 transitions. Word has length 58 [2021-01-06 20:18:18,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:18:18,708 INFO L481 AbstractCegarLoop]: Abstraction has 2121 states and 3460 transitions. [2021-01-06 20:18:18,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 20:18:18,709 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 3460 transitions. [2021-01-06 20:18:18,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-01-06 20:18:18,711 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:18:18,712 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:18:18,712 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 20:18:18,712 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:18:18,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:18:18,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1037107898, now seen corresponding path program 1 times [2021-01-06 20:18:18,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:18:18,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504050873] [2021-01-06 20:18:18,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:18:18,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:18:18,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:18:18,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504050873] [2021-01-06 20:18:18,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:18:18,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:18:18,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696662590] [2021-01-06 20:18:18,812 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:18:18,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:18:18,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:18:18,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:18:18,813 INFO L87 Difference]: Start difference. First operand 2121 states and 3460 transitions. Second operand 3 states. [2021-01-06 20:18:19,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:18:19,040 INFO L93 Difference]: Finished difference Result 4115 states and 6746 transitions. [2021-01-06 20:18:19,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:18:19,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2021-01-06 20:18:19,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:18:19,058 INFO L225 Difference]: With dead ends: 4115 [2021-01-06 20:18:19,058 INFO L226 Difference]: Without dead ends: 2973 [2021-01-06 20:18:19,062 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:18:19,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2973 states. [2021-01-06 20:18:19,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 2971. [2021-01-06 20:18:19,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2971 states. [2021-01-06 20:18:19,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2971 states to 2971 states and 4832 transitions. [2021-01-06 20:18:19,337 INFO L78 Accepts]: Start accepts. Automaton has 2971 states and 4832 transitions. Word has length 58 [2021-01-06 20:18:19,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:18:19,337 INFO L481 AbstractCegarLoop]: Abstraction has 2971 states and 4832 transitions. [2021-01-06 20:18:19,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:18:19,338 INFO L276 IsEmpty]: Start isEmpty. Operand 2971 states and 4832 transitions. [2021-01-06 20:18:19,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-01-06 20:18:19,340 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:18:19,340 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] [2021-01-06 20:18:19,340 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 20:18:19,341 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:18:19,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:18:19,341 INFO L82 PathProgramCache]: Analyzing trace with hash 405262074, now seen corresponding path program 1 times [2021-01-06 20:18:19,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:18:19,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63963318] [2021-01-06 20:18:19,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:18:19,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:18:19,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:18:19,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63963318] [2021-01-06 20:18:19,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:18:19,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:18:19,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484934294] [2021-01-06 20:18:19,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:18:19,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:18:19,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:18:19,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:18:19,413 INFO L87 Difference]: Start difference. First operand 2971 states and 4832 transitions. Second operand 3 states. [2021-01-06 20:18:19,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:18:19,723 INFO L93 Difference]: Finished difference Result 6393 states and 10544 transitions. [2021-01-06 20:18:19,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:18:19,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2021-01-06 20:18:19,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:18:19,748 INFO L225 Difference]: With dead ends: 6393 [2021-01-06 20:18:19,748 INFO L226 Difference]: Without dead ends: 4307 [2021-01-06 20:18:19,753 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:18:19,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4307 states. [2021-01-06 20:18:20,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4307 to 4305. [2021-01-06 20:18:20,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4305 states. [2021-01-06 20:18:20,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4305 states to 4305 states and 7033 transitions. [2021-01-06 20:18:20,119 INFO L78 Accepts]: Start accepts. Automaton has 4305 states and 7033 transitions. Word has length 58 [2021-01-06 20:18:20,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:18:20,119 INFO L481 AbstractCegarLoop]: Abstraction has 4305 states and 7033 transitions. [2021-01-06 20:18:20,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:18:20,119 INFO L276 IsEmpty]: Start isEmpty. Operand 4305 states and 7033 transitions. [2021-01-06 20:18:20,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-01-06 20:18:20,120 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:18:20,120 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] [2021-01-06 20:18:20,121 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 20:18:20,121 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:18:20,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:18:20,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1830107264, now seen corresponding path program 1 times [2021-01-06 20:18:20,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:18:20,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236004369] [2021-01-06 20:18:20,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:18:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:18:20,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:18:20,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236004369] [2021-01-06 20:18:20,197 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:18:20,197 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 20:18:20,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594814092] [2021-01-06 20:18:20,198 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 20:18:20,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:18:20,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 20:18:20,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 20:18:20,206 INFO L87 Difference]: Start difference. First operand 4305 states and 7033 transitions. Second operand 4 states. [2021-01-06 20:18:20,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:18:20,927 INFO L93 Difference]: Finished difference Result 13696 states and 22476 transitions. [2021-01-06 20:18:20,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 20:18:20,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2021-01-06 20:18:20,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:18:21,007 INFO L225 Difference]: With dead ends: 13696 [2021-01-06 20:18:21,007 INFO L226 Difference]: Without dead ends: 9467 [2021-01-06 20:18:21,019 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:18:21,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9467 states. [2021-01-06 20:18:21,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9467 to 6857. [2021-01-06 20:18:21,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6857 states. [2021-01-06 20:18:21,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6857 states to 6857 states and 11155 transitions. [2021-01-06 20:18:21,711 INFO L78 Accepts]: Start accepts. Automaton has 6857 states and 11155 transitions. Word has length 59 [2021-01-06 20:18:21,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:18:21,712 INFO L481 AbstractCegarLoop]: Abstraction has 6857 states and 11155 transitions. [2021-01-06 20:18:21,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 20:18:21,712 INFO L276 IsEmpty]: Start isEmpty. Operand 6857 states and 11155 transitions. [2021-01-06 20:18:21,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-01-06 20:18:21,713 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:18:21,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] [2021-01-06 20:18:21,713 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 20:18:21,713 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:18:21,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:18:21,715 INFO L82 PathProgramCache]: Analyzing trace with hash 845362164, now seen corresponding path program 1 times [2021-01-06 20:18:21,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:18:21,715 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866520164] [2021-01-06 20:18:21,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:18:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:18:21,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:18:21,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866520164] [2021-01-06 20:18:21,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:18:21,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 20:18:21,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641228398] [2021-01-06 20:18:21,826 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 20:18:21,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:18:21,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 20:18:21,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 20:18:21,830 INFO L87 Difference]: Start difference. First operand 6857 states and 11155 transitions. Second operand 4 states. [2021-01-06 20:18:23,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:18:23,002 INFO L93 Difference]: Finished difference Result 22265 states and 36347 transitions. [2021-01-06 20:18:23,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 20:18:23,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2021-01-06 20:18:23,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:18:23,045 INFO L225 Difference]: With dead ends: 22265 [2021-01-06 20:18:23,045 INFO L226 Difference]: Without dead ends: 15484 [2021-01-06 20:18:23,058 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 20:18:23,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15484 states. [2021-01-06 20:18:24,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15484 to 10709. [2021-01-06 20:18:24,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10709 states. [2021-01-06 20:18:24,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10709 states to 10709 states and 17341 transitions. [2021-01-06 20:18:24,088 INFO L78 Accepts]: Start accepts. Automaton has 10709 states and 17341 transitions. Word has length 60 [2021-01-06 20:18:24,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:18:24,089 INFO L481 AbstractCegarLoop]: Abstraction has 10709 states and 17341 transitions. [2021-01-06 20:18:24,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 20:18:24,089 INFO L276 IsEmpty]: Start isEmpty. Operand 10709 states and 17341 transitions. [2021-01-06 20:18:24,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-01-06 20:18:24,090 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:18:24,090 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] [2021-01-06 20:18:24,090 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 20:18:24,091 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:18:24,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:18:24,091 INFO L82 PathProgramCache]: Analyzing trace with hash -873091579, now seen corresponding path program 1 times [2021-01-06 20:18:24,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:18:24,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534811408] [2021-01-06 20:18:24,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:18:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:18:24,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:18:24,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534811408] [2021-01-06 20:18:24,193 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:18:24,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 20:18:24,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140723401] [2021-01-06 20:18:24,194 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 20:18:24,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:18:24,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 20:18:24,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 20:18:24,195 INFO L87 Difference]: Start difference. First operand 10709 states and 17341 transitions. Second operand 4 states. [2021-01-06 20:18:25,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:18:25,729 INFO L93 Difference]: Finished difference Result 31489 states and 51018 transitions. [2021-01-06 20:18:25,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 20:18:25,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2021-01-06 20:18:25,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:18:25,790 INFO L225 Difference]: With dead ends: 31489 [2021-01-06 20:18:25,790 INFO L226 Difference]: Without dead ends: 20789 [2021-01-06 20:18:25,809 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:18:25,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20789 states. [2021-01-06 20:18:27,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20789 to 20787. [2021-01-06 20:18:27,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20787 states. [2021-01-06 20:18:27,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20787 states to 20787 states and 33465 transitions. [2021-01-06 20:18:27,245 INFO L78 Accepts]: Start accepts. Automaton has 20787 states and 33465 transitions. Word has length 62 [2021-01-06 20:18:27,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:18:27,246 INFO L481 AbstractCegarLoop]: Abstraction has 20787 states and 33465 transitions. [2021-01-06 20:18:27,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 20:18:27,246 INFO L276 IsEmpty]: Start isEmpty. Operand 20787 states and 33465 transitions. [2021-01-06 20:18:27,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-06 20:18:27,247 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:18:27,247 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] [2021-01-06 20:18:27,247 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 20:18:27,247 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:18:27,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:18:27,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1318607911, now seen corresponding path program 1 times [2021-01-06 20:18:27,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:18:27,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782386119] [2021-01-06 20:18:27,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:18:27,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:18:27,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:18:27,282 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782386119] [2021-01-06 20:18:27,282 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:18:27,282 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:18:27,282 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302004443] [2021-01-06 20:18:27,283 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:18:27,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:18:27,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:18:27,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:18:27,284 INFO L87 Difference]: Start difference. First operand 20787 states and 33465 transitions. Second operand 3 states. [2021-01-06 20:18:30,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:18:30,265 INFO L93 Difference]: Finished difference Result 62323 states and 100333 transitions. [2021-01-06 20:18:30,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:18:30,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2021-01-06 20:18:30,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:18:30,394 INFO L225 Difference]: With dead ends: 62323 [2021-01-06 20:18:30,395 INFO L226 Difference]: Without dead ends: 41564 [2021-01-06 20:18:30,445 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:18:30,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41564 states. [2021-01-06 20:18:32,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41564 to 20789. [2021-01-06 20:18:32,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20789 states. [2021-01-06 20:18:32,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20789 states to 20789 states and 33467 transitions. [2021-01-06 20:18:32,399 INFO L78 Accepts]: Start accepts. Automaton has 20789 states and 33467 transitions. Word has length 63 [2021-01-06 20:18:32,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:18:32,399 INFO L481 AbstractCegarLoop]: Abstraction has 20789 states and 33467 transitions. [2021-01-06 20:18:32,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:18:32,399 INFO L276 IsEmpty]: Start isEmpty. Operand 20789 states and 33467 transitions. [2021-01-06 20:18:32,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-01-06 20:18:32,400 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:18:32,401 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] [2021-01-06 20:18:32,401 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 20:18:32,401 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:18:32,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:18:32,402 INFO L82 PathProgramCache]: Analyzing trace with hash 2111847173, now seen corresponding path program 1 times [2021-01-06 20:18:32,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:18:32,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009545035] [2021-01-06 20:18:32,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:18:32,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:18:32,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:18:32,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009545035] [2021-01-06 20:18:32,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:18:32,464 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:18:32,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829979008] [2021-01-06 20:18:32,465 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:18:32,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:18:32,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:18:32,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:18:32,466 INFO L87 Difference]: Start difference. First operand 20789 states and 33467 transitions. Second operand 3 states. [2021-01-06 20:18:35,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:18:35,306 INFO L93 Difference]: Finished difference Result 60975 states and 98244 transitions. [2021-01-06 20:18:35,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:18:35,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2021-01-06 20:18:35,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:18:35,379 INFO L225 Difference]: With dead ends: 60975 [2021-01-06 20:18:35,380 INFO L226 Difference]: Without dead ends: 40330 [2021-01-06 20:18:35,409 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:18:35,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40330 states. [2021-01-06 20:18:38,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40330 to 40328. [2021-01-06 20:18:38,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40328 states. [2021-01-06 20:18:38,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40328 states to 40328 states and 64525 transitions. [2021-01-06 20:18:38,363 INFO L78 Accepts]: Start accepts. Automaton has 40328 states and 64525 transitions. Word has length 64 [2021-01-06 20:18:38,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:18:38,364 INFO L481 AbstractCegarLoop]: Abstraction has 40328 states and 64525 transitions. [2021-01-06 20:18:38,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:18:38,364 INFO L276 IsEmpty]: Start isEmpty. Operand 40328 states and 64525 transitions. [2021-01-06 20:18:38,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-01-06 20:18:38,365 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:18:38,365 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] [2021-01-06 20:18:38,365 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 20:18:38,365 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:18:38,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:18:38,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1880384222, now seen corresponding path program 1 times [2021-01-06 20:18:38,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:18:38,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461729665] [2021-01-06 20:18:38,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:18:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:18:38,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:18:38,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461729665] [2021-01-06 20:18:38,473 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:18:38,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 20:18:38,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135177663] [2021-01-06 20:18:38,474 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:18:38,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:18:38,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:18:38,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:18:38,475 INFO L87 Difference]: Start difference. First operand 40328 states and 64525 transitions. Second operand 5 states. [2021-01-06 20:18:43,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:18:43,805 INFO L93 Difference]: Finished difference Result 118320 states and 189414 transitions. [2021-01-06 20:18:43,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 20:18:43,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2021-01-06 20:18:43,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:18:43,932 INFO L225 Difference]: With dead ends: 118320 [2021-01-06 20:18:43,932 INFO L226 Difference]: Without dead ends: 78006 [2021-01-06 20:18:43,966 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:18:44,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78006 states. [2021-01-06 20:18:49,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78006 to 78004. [2021-01-06 20:18:49,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78004 states. [2021-01-06 20:18:49,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78004 states to 78004 states and 124007 transitions. [2021-01-06 20:18:49,546 INFO L78 Accepts]: Start accepts. Automaton has 78004 states and 124007 transitions. Word has length 64 [2021-01-06 20:18:49,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:18:49,546 INFO L481 AbstractCegarLoop]: Abstraction has 78004 states and 124007 transitions. [2021-01-06 20:18:49,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:18:49,546 INFO L276 IsEmpty]: Start isEmpty. Operand 78004 states and 124007 transitions. [2021-01-06 20:18:49,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-01-06 20:18:49,548 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:18:49,548 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] [2021-01-06 20:18:49,548 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 20:18:49,548 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:18:49,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:18:49,549 INFO L82 PathProgramCache]: Analyzing trace with hash -812500730, now seen corresponding path program 1 times [2021-01-06 20:18:49,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:18:49,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561205191] [2021-01-06 20:18:49,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:18:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:18:49,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:18:49,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561205191] [2021-01-06 20:18:49,631 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:18:49,631 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 20:18:49,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114777281] [2021-01-06 20:18:49,632 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 20:18:49,632 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:18:49,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 20:18:49,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 20:18:49,633 INFO L87 Difference]: Start difference. First operand 78004 states and 124007 transitions. Second operand 4 states. [2021-01-06 20:19:00,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:19:00,471 INFO L93 Difference]: Finished difference Result 228939 states and 364040 transitions. [2021-01-06 20:19:00,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 20:19:00,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2021-01-06 20:19:00,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:19:00,768 INFO L225 Difference]: With dead ends: 228939 [2021-01-06 20:19:00,768 INFO L226 Difference]: Without dead ends: 150991 [2021-01-06 20:19:01,012 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:19:01,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150991 states. [2021-01-06 20:19:12,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150991 to 150989. [2021-01-06 20:19:12,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150989 states. [2021-01-06 20:19:12,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150989 states to 150989 states and 238321 transitions. [2021-01-06 20:19:12,937 INFO L78 Accepts]: Start accepts. Automaton has 150989 states and 238321 transitions. Word has length 64 [2021-01-06 20:19:12,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:19:12,937 INFO L481 AbstractCegarLoop]: Abstraction has 150989 states and 238321 transitions. [2021-01-06 20:19:12,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 20:19:12,938 INFO L276 IsEmpty]: Start isEmpty. Operand 150989 states and 238321 transitions. [2021-01-06 20:19:12,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-06 20:19:12,944 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:19:12,944 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] [2021-01-06 20:19:12,944 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 20:19:12,944 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:19:12,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:19:12,946 INFO L82 PathProgramCache]: Analyzing trace with hash 2044581434, now seen corresponding path program 1 times [2021-01-06 20:19:12,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:19:12,947 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404342238] [2021-01-06 20:19:12,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:19:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:19:13,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:19:13,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404342238] [2021-01-06 20:19:13,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:19:13,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:19:13,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260997914] [2021-01-06 20:19:13,015 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:19:13,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:19:13,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:19:13,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:19:13,017 INFO L87 Difference]: Start difference. First operand 150989 states and 238321 transitions. Second operand 3 states. [2021-01-06 20:19:35,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:19:35,256 INFO L93 Difference]: Finished difference Result 452815 states and 714730 transitions. [2021-01-06 20:19:35,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:19:35,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2021-01-06 20:19:35,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:19:36,106 INFO L225 Difference]: With dead ends: 452815 [2021-01-06 20:19:36,107 INFO L226 Difference]: Without dead ends: 301917 [2021-01-06 20:19:36,282 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:19:36,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301917 states. [2021-01-06 20:19:49,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301917 to 150999. [2021-01-06 20:19:49,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150999 states. [2021-01-06 20:19:49,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150999 states to 150999 states and 238331 transitions. [2021-01-06 20:19:49,970 INFO L78 Accepts]: Start accepts. Automaton has 150999 states and 238331 transitions. Word has length 65 [2021-01-06 20:19:49,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:19:49,970 INFO L481 AbstractCegarLoop]: Abstraction has 150999 states and 238331 transitions. [2021-01-06 20:19:49,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:19:49,970 INFO L276 IsEmpty]: Start isEmpty. Operand 150999 states and 238331 transitions. [2021-01-06 20:19:49,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 20:19:49,972 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:19:49,973 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] [2021-01-06 20:19:49,973 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 20:19:49,973 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:19:49,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:19:49,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1842690183, now seen corresponding path program 1 times [2021-01-06 20:19:49,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:19:49,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187130183] [2021-01-06 20:19:49,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:19:50,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:19:50,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:19:50,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187130183] [2021-01-06 20:19:50,120 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:19:50,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 20:19:50,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826558532] [2021-01-06 20:19:50,121 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:19:50,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:19:50,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:19:50,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:19:50,123 INFO L87 Difference]: Start difference. First operand 150999 states and 238331 transitions. Second operand 5 states.