/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_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 21:18:13,014 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 21:18:13,017 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 21:18:13,051 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 21:18:13,052 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 21:18:13,053 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 21:18:13,055 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 21:18:13,057 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 21:18:13,060 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 21:18:13,061 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 21:18:13,062 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 21:18:13,063 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 21:18:13,064 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 21:18:13,065 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 21:18:13,066 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 21:18:13,068 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 21:18:13,069 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 21:18:13,070 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 21:18:13,073 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 21:18:13,075 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 21:18:13,077 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 21:18:13,082 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 21:18:13,083 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 21:18:13,085 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 21:18:13,108 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 21:18:13,108 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 21:18:13,108 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 21:18:13,113 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 21:18:13,114 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 21:18:13,115 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 21:18:13,120 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 21:18:13,121 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 21:18:13,122 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 21:18:13,123 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 21:18:13,127 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 21:18:13,127 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 21:18:13,128 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 21:18:13,128 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 21:18:13,128 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 21:18:13,129 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 21:18:13,130 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 21:18:13,131 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 21:18:13,158 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 21:18:13,159 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 21:18:13,160 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 21:18:13,161 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 21:18:13,161 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 21:18:13,161 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 21:18:13,161 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 21:18:13,162 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 21:18:13,162 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 21:18:13,162 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 21:18:13,162 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 21:18:13,162 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 21:18:13,163 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 21:18:13,163 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 21:18:13,163 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 21:18:13,164 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 21:18:13,164 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 21:18:13,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 21:18:13,164 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 21:18:13,165 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 21:18:13,165 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 21:18:13,165 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 21:18:13,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 21:18:13,166 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 21:18:13,166 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 21:18:13,166 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 21:18:13,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 21:18:13,578 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 21:18:13,581 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 21:18:13,582 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 21:18:13,583 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 21:18:13,584 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2021-01-06 21:18:13,675 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/16efdbf21/df5e0e702e1f4b48b2f3757652e2ad8f/FLAGd2755dbc1 [2021-01-06 21:18:14,299 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 21:18:14,300 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2021-01-06 21:18:14,317 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/16efdbf21/df5e0e702e1f4b48b2f3757652e2ad8f/FLAGd2755dbc1 [2021-01-06 21:18:14,627 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/16efdbf21/df5e0e702e1f4b48b2f3757652e2ad8f [2021-01-06 21:18:14,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 21:18:14,638 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 21:18:14,641 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 21:18:14,642 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 21:18:14,645 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 21:18:14,646 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 09:18:14" (1/1) ... [2021-01-06 21:18:14,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ae7287e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:18:14, skipping insertion in model container [2021-01-06 21:18:14,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 09:18:14" (1/1) ... [2021-01-06 21:18:14,657 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 21:18:14,728 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[~newmax1~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[~newmax2~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[~newmax3~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_1296~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[~node1__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~node1__newmax~0,] 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[~node1__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~newmax1~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[~node2__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~r2~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[~node2__newmax~0,] 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[~node2__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~newmax2~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[~node3__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~r3~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[~node3__newmax~0,] 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[~node3__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~newmax3~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_1445~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~0,] [2021-01-06 21:18:14,959 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_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7516,7529] 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[~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 21:18:15,042 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 21:18:15,072 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[~newmax1~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[~newmax2~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[~newmax3~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_1296~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[~node1__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~node1__newmax~0,] 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[~node1__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~newmax1~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[~node2__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~r2~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[~node2__newmax~0,] 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[~node2__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~newmax2~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[~node3__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~r3~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[~node3__newmax~0,] 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[~node3__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~newmax3~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_1445~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~0,] [2021-01-06 21:18:15,130 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_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7516,7529] 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[~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 21:18:15,158 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 21:18:15,190 INFO L208 MainTranslator]: Completed translation [2021-01-06 21:18:15,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:18:15 WrapperNode [2021-01-06 21:18:15,191 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 21:18:15,192 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 21:18:15,193 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 21:18:15,193 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 21:18:15,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:18:15" (1/1) ... [2021-01-06 21:18:15,233 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:18:15" (1/1) ... [2021-01-06 21:18:15,306 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 21:18:15,310 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 21:18:15,310 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 21:18:15,311 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 21:18:15,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:18:15" (1/1) ... [2021-01-06 21:18:15,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:18:15" (1/1) ... [2021-01-06 21:18:15,333 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:18:15" (1/1) ... [2021-01-06 21:18:15,334 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:18:15" (1/1) ... [2021-01-06 21:18:15,359 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:18:15" (1/1) ... [2021-01-06 21:18:15,368 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:18:15" (1/1) ... [2021-01-06 21:18:15,370 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:18:15" (1/1) ... [2021-01-06 21:18:15,375 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 21:18:15,376 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 21:18:15,376 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 21:18:15,376 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 21:18:15,377 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:18:15" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 21:18:15,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 21:18:15,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 21:18:15,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 21:18:15,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 21:18:16,716 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 21:18:16,716 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-01-06 21:18:16,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 09:18:16 BoogieIcfgContainer [2021-01-06 21:18:16,719 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 21:18:16,721 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 21:18:16,721 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 21:18:16,725 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 21:18:16,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 09:18:14" (1/3) ... [2021-01-06 21:18:16,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d274d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 09:18:16, skipping insertion in model container [2021-01-06 21:18:16,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:18:15" (2/3) ... [2021-01-06 21:18:16,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d274d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 09:18:16, skipping insertion in model container [2021-01-06 21:18:16,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 09:18:16" (3/3) ... [2021-01-06 21:18:16,730 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2021-01-06 21:18:16,738 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 21:18:16,744 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 21:18:16,764 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 21:18:16,794 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 21:18:16,794 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 21:18:16,794 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 21:18:16,794 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 21:18:16,795 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 21:18:16,795 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 21:18:16,795 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 21:18:16,795 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 21:18:16,816 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states. [2021-01-06 21:18:16,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-01-06 21:18:16,827 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:18:16,828 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 21:18:16,829 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:18:16,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:18:16,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1975649421, now seen corresponding path program 1 times [2021-01-06 21:18:16,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:18:16,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835402127] [2021-01-06 21:18:16,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:18:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:18:17,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:18:17,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835402127] [2021-01-06 21:18:17,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:18:17,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:18:17,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928759623] [2021-01-06 21:18:17,420 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:18:17,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:18:17,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:18:17,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:18:17,439 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 3 states. [2021-01-06 21:18:17,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:18:17,567 INFO L93 Difference]: Finished difference Result 341 states and 571 transitions. [2021-01-06 21:18:17,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:18:17,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2021-01-06 21:18:17,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:18:17,588 INFO L225 Difference]: With dead ends: 341 [2021-01-06 21:18:17,588 INFO L226 Difference]: Without dead ends: 237 [2021-01-06 21:18:17,592 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:18:17,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-01-06 21:18:17,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 234. [2021-01-06 21:18:17,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2021-01-06 21:18:17,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 365 transitions. [2021-01-06 21:18:17,664 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 365 transitions. Word has length 62 [2021-01-06 21:18:17,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:18:17,665 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 365 transitions. [2021-01-06 21:18:17,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:18:17,665 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 365 transitions. [2021-01-06 21:18:17,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-01-06 21:18:17,673 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:18:17,673 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 21:18:17,674 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 21:18:17,677 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:18:17,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:18:17,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1826541876, now seen corresponding path program 1 times [2021-01-06 21:18:17,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:18:17,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673587108] [2021-01-06 21:18:17,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:18:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:18:17,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:18:17,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673587108] [2021-01-06 21:18:17,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:18:17,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:18:17,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094245226] [2021-01-06 21:18:17,831 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:18:17,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:18:17,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:18:17,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:18:17,833 INFO L87 Difference]: Start difference. First operand 234 states and 365 transitions. Second operand 3 states. [2021-01-06 21:18:17,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:18:17,895 INFO L93 Difference]: Finished difference Result 572 states and 917 transitions. [2021-01-06 21:18:17,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:18:17,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2021-01-06 21:18:17,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:18:17,904 INFO L225 Difference]: With dead ends: 572 [2021-01-06 21:18:17,905 INFO L226 Difference]: Without dead ends: 395 [2021-01-06 21:18:17,910 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:18:17,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2021-01-06 21:18:18,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 391. [2021-01-06 21:18:18,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2021-01-06 21:18:18,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 620 transitions. [2021-01-06 21:18:18,008 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 620 transitions. Word has length 64 [2021-01-06 21:18:18,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:18:18,009 INFO L481 AbstractCegarLoop]: Abstraction has 391 states and 620 transitions. [2021-01-06 21:18:18,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:18:18,009 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 620 transitions. [2021-01-06 21:18:18,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 21:18:18,013 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:18:18,013 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 21:18:18,013 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 21:18:18,013 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:18:18,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:18:18,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1385775307, now seen corresponding path program 1 times [2021-01-06 21:18:18,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:18:18,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146680226] [2021-01-06 21:18:18,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:18:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:18:18,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:18:18,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146680226] [2021-01-06 21:18:18,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:18:18,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:18:18,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414784202] [2021-01-06 21:18:18,122 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:18:18,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:18:18,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:18:18,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:18:18,124 INFO L87 Difference]: Start difference. First operand 391 states and 620 transitions. Second operand 3 states. [2021-01-06 21:18:18,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:18:18,193 INFO L93 Difference]: Finished difference Result 1027 states and 1654 transitions. [2021-01-06 21:18:18,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:18:18,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2021-01-06 21:18:18,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:18:18,198 INFO L225 Difference]: With dead ends: 1027 [2021-01-06 21:18:18,199 INFO L226 Difference]: Without dead ends: 693 [2021-01-06 21:18:18,201 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:18:18,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2021-01-06 21:18:18,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 687. [2021-01-06 21:18:18,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2021-01-06 21:18:18,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1096 transitions. [2021-01-06 21:18:18,245 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1096 transitions. Word has length 66 [2021-01-06 21:18:18,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:18:18,246 INFO L481 AbstractCegarLoop]: Abstraction has 687 states and 1096 transitions. [2021-01-06 21:18:18,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:18:18,246 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1096 transitions. [2021-01-06 21:18:18,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 21:18:18,249 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:18:18,250 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:18:18,250 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 21:18:18,250 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:18:18,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:18:18,251 INFO L82 PathProgramCache]: Analyzing trace with hash -190660810, now seen corresponding path program 1 times [2021-01-06 21:18:18,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:18:18,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227862164] [2021-01-06 21:18:18,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:18:18,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:18:18,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:18:18,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227862164] [2021-01-06 21:18:18,445 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:18:18,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:18:18,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005397238] [2021-01-06 21:18:18,447 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:18:18,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:18:18,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:18:18,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:18:18,448 INFO L87 Difference]: Start difference. First operand 687 states and 1096 transitions. Second operand 5 states. [2021-01-06 21:18:18,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:18:18,752 INFO L93 Difference]: Finished difference Result 2979 states and 4854 transitions. [2021-01-06 21:18:18,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 21:18:18,752 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2021-01-06 21:18:18,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:18:18,767 INFO L225 Difference]: With dead ends: 2979 [2021-01-06 21:18:18,768 INFO L226 Difference]: Without dead ends: 2349 [2021-01-06 21:18:18,770 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-06 21:18:18,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2021-01-06 21:18:18,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 1239. [2021-01-06 21:18:18,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1239 states. [2021-01-06 21:18:18,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1991 transitions. [2021-01-06 21:18:18,870 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1991 transitions. Word has length 68 [2021-01-06 21:18:18,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:18:18,871 INFO L481 AbstractCegarLoop]: Abstraction has 1239 states and 1991 transitions. [2021-01-06 21:18:18,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:18:18,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1991 transitions. [2021-01-06 21:18:18,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-06 21:18:18,873 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:18:18,873 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:18:18,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 21:18:18,873 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:18:18,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:18:18,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1678021987, now seen corresponding path program 1 times [2021-01-06 21:18:18,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:18:18,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941090119] [2021-01-06 21:18:18,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:18:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:18:19,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:18:19,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941090119] [2021-01-06 21:18:19,030 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:18:19,030 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:18:19,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964570770] [2021-01-06 21:18:19,031 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:18:19,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:18:19,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:18:19,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:18:19,033 INFO L87 Difference]: Start difference. First operand 1239 states and 1991 transitions. Second operand 4 states. [2021-01-06 21:18:19,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:18:19,266 INFO L93 Difference]: Finished difference Result 3619 states and 5887 transitions. [2021-01-06 21:18:19,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:18:19,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2021-01-06 21:18:19,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:18:19,281 INFO L225 Difference]: With dead ends: 3619 [2021-01-06 21:18:19,281 INFO L226 Difference]: Without dead ends: 2437 [2021-01-06 21:18:19,284 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 21:18:19,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states. [2021-01-06 21:18:19,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 1829. [2021-01-06 21:18:19,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1829 states. [2021-01-06 21:18:19,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2952 transitions. [2021-01-06 21:18:19,422 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2952 transitions. Word has length 69 [2021-01-06 21:18:19,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:18:19,422 INFO L481 AbstractCegarLoop]: Abstraction has 1829 states and 2952 transitions. [2021-01-06 21:18:19,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:18:19,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2952 transitions. [2021-01-06 21:18:19,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-06 21:18:19,424 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:18:19,425 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:18:19,425 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 21:18:19,425 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:18:19,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:18:19,426 INFO L82 PathProgramCache]: Analyzing trace with hash -537020195, now seen corresponding path program 1 times [2021-01-06 21:18:19,426 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:18:19,426 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088507175] [2021-01-06 21:18:19,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:18:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:18:19,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:18:19,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088507175] [2021-01-06 21:18:19,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:18:19,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:18:19,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906672385] [2021-01-06 21:18:19,596 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:18:19,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:18:19,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:18:19,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:18:19,599 INFO L87 Difference]: Start difference. First operand 1829 states and 2952 transitions. Second operand 4 states. [2021-01-06 21:18:19,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:18:19,943 INFO L93 Difference]: Finished difference Result 5465 states and 8877 transitions. [2021-01-06 21:18:19,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:18:19,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2021-01-06 21:18:19,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:18:19,965 INFO L225 Difference]: With dead ends: 5465 [2021-01-06 21:18:19,966 INFO L226 Difference]: Without dead ends: 3693 [2021-01-06 21:18:19,972 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 21:18:19,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3693 states. [2021-01-06 21:18:20,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3693 to 2673. [2021-01-06 21:18:20,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2673 states. [2021-01-06 21:18:20,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2673 states and 4312 transitions. [2021-01-06 21:18:20,258 INFO L78 Accepts]: Start accepts. Automaton has 2673 states and 4312 transitions. Word has length 70 [2021-01-06 21:18:20,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:18:20,258 INFO L481 AbstractCegarLoop]: Abstraction has 2673 states and 4312 transitions. [2021-01-06 21:18:20,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:18:20,259 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 4312 transitions. [2021-01-06 21:18:20,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-01-06 21:18:20,261 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:18:20,262 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:18:20,262 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 21:18:20,262 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:18:20,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:18:20,263 INFO L82 PathProgramCache]: Analyzing trace with hash 478855012, now seen corresponding path program 1 times [2021-01-06 21:18:20,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:18:20,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802967462] [2021-01-06 21:18:20,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:18:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:18:20,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:18:20,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802967462] [2021-01-06 21:18:20,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:18:20,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:18:20,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390536279] [2021-01-06 21:18:20,357 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:18:20,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:18:20,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:18:20,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:18:20,358 INFO L87 Difference]: Start difference. First operand 2673 states and 4312 transitions. Second operand 4 states. [2021-01-06 21:18:20,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:18:20,751 INFO L93 Difference]: Finished difference Result 7713 states and 12507 transitions. [2021-01-06 21:18:20,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:18:20,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2021-01-06 21:18:20,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:18:20,779 INFO L225 Difference]: With dead ends: 7713 [2021-01-06 21:18:20,779 INFO L226 Difference]: Without dead ends: 5097 [2021-01-06 21:18:20,785 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 21:18:20,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5097 states. [2021-01-06 21:18:21,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5097 to 3869. [2021-01-06 21:18:21,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3869 states. [2021-01-06 21:18:21,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3869 states to 3869 states and 6234 transitions. [2021-01-06 21:18:21,141 INFO L78 Accepts]: Start accepts. Automaton has 3869 states and 6234 transitions. Word has length 71 [2021-01-06 21:18:21,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:18:21,141 INFO L481 AbstractCegarLoop]: Abstraction has 3869 states and 6234 transitions. [2021-01-06 21:18:21,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:18:21,141 INFO L276 IsEmpty]: Start isEmpty. Operand 3869 states and 6234 transitions. [2021-01-06 21:18:21,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 21:18:21,150 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:18:21,150 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:18:21,151 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 21:18:21,151 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:18:21,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:18:21,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1637619353, now seen corresponding path program 1 times [2021-01-06 21:18:21,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:18:21,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244492247] [2021-01-06 21:18:21,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:18:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:18:21,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:18:21,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244492247] [2021-01-06 21:18:21,230 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:18:21,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:18:21,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481562717] [2021-01-06 21:18:21,231 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:18:21,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:18:21,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:18:21,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:18:21,232 INFO L87 Difference]: Start difference. First operand 3869 states and 6234 transitions. Second operand 3 states. [2021-01-06 21:18:21,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:18:21,648 INFO L93 Difference]: Finished difference Result 8646 states and 14040 transitions. [2021-01-06 21:18:21,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:18:21,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-01-06 21:18:21,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:18:21,680 INFO L225 Difference]: With dead ends: 8646 [2021-01-06 21:18:21,680 INFO L226 Difference]: Without dead ends: 5881 [2021-01-06 21:18:21,687 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:18:21,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5881 states. [2021-01-06 21:18:22,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5881 to 5879. [2021-01-06 21:18:22,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5879 states. [2021-01-06 21:18:22,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5879 states to 5879 states and 9478 transitions. [2021-01-06 21:18:22,213 INFO L78 Accepts]: Start accepts. Automaton has 5879 states and 9478 transitions. Word has length 72 [2021-01-06 21:18:22,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:18:22,213 INFO L481 AbstractCegarLoop]: Abstraction has 5879 states and 9478 transitions. [2021-01-06 21:18:22,213 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:18:22,213 INFO L276 IsEmpty]: Start isEmpty. Operand 5879 states and 9478 transitions. [2021-01-06 21:18:22,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 21:18:22,215 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:18:22,215 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:18:22,215 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 21:18:22,216 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:18:22,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:18:22,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1419254461, now seen corresponding path program 1 times [2021-01-06 21:18:22,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:18:22,218 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395985712] [2021-01-06 21:18:22,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:18:22,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:18:22,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:18:22,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395985712] [2021-01-06 21:18:22,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:18:22,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:18:22,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856061409] [2021-01-06 21:18:22,294 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:18:22,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:18:22,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:18:22,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:18:22,298 INFO L87 Difference]: Start difference. First operand 5879 states and 9478 transitions. Second operand 3 states. [2021-01-06 21:18:22,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:18:22,875 INFO L93 Difference]: Finished difference Result 12993 states and 20995 transitions. [2021-01-06 21:18:22,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:18:22,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-01-06 21:18:22,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:18:22,934 INFO L225 Difference]: With dead ends: 12993 [2021-01-06 21:18:22,934 INFO L226 Difference]: Without dead ends: 8823 [2021-01-06 21:18:22,943 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:18:22,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8823 states. [2021-01-06 21:18:23,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8823 to 8821. [2021-01-06 21:18:23,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8821 states. [2021-01-06 21:18:23,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8821 states to 8821 states and 14158 transitions. [2021-01-06 21:18:23,604 INFO L78 Accepts]: Start accepts. Automaton has 8821 states and 14158 transitions. Word has length 72 [2021-01-06 21:18:23,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:18:23,604 INFO L481 AbstractCegarLoop]: Abstraction has 8821 states and 14158 transitions. [2021-01-06 21:18:23,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:18:23,604 INFO L276 IsEmpty]: Start isEmpty. Operand 8821 states and 14158 transitions. [2021-01-06 21:18:23,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 21:18:23,606 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:18:23,606 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:18:23,606 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 21:18:23,606 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:18:23,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:18:23,607 INFO L82 PathProgramCache]: Analyzing trace with hash 569279253, now seen corresponding path program 1 times [2021-01-06 21:18:23,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:18:23,607 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518253669] [2021-01-06 21:18:23,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:18:23,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:18:23,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:18:23,659 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518253669] [2021-01-06 21:18:23,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:18:23,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:18:23,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169687495] [2021-01-06 21:18:23,660 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:18:23,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:18:23,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:18:23,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:18:23,662 INFO L87 Difference]: Start difference. First operand 8821 states and 14158 transitions. Second operand 3 states. [2021-01-06 21:18:24,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:18:24,525 INFO L93 Difference]: Finished difference Result 19170 states and 30844 transitions. [2021-01-06 21:18:24,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:18:24,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-01-06 21:18:24,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:18:24,568 INFO L225 Difference]: With dead ends: 19170 [2021-01-06 21:18:24,568 INFO L226 Difference]: Without dead ends: 12906 [2021-01-06 21:18:24,582 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:18:24,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12906 states. [2021-01-06 21:18:25,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12906 to 12904. [2021-01-06 21:18:25,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12904 states. [2021-01-06 21:18:25,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12904 states to 12904 states and 20605 transitions. [2021-01-06 21:18:25,495 INFO L78 Accepts]: Start accepts. Automaton has 12904 states and 20605 transitions. Word has length 72 [2021-01-06 21:18:25,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:18:25,495 INFO L481 AbstractCegarLoop]: Abstraction has 12904 states and 20605 transitions. [2021-01-06 21:18:25,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:18:25,496 INFO L276 IsEmpty]: Start isEmpty. Operand 12904 states and 20605 transitions. [2021-01-06 21:18:25,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-06 21:18:25,496 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:18:25,497 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:18:25,497 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 21:18:25,497 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:18:25,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:18:25,498 INFO L82 PathProgramCache]: Analyzing trace with hash -899144939, now seen corresponding path program 1 times [2021-01-06 21:18:25,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:18:25,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826980323] [2021-01-06 21:18:25,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:18:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:18:25,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:18:25,722 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826980323] [2021-01-06 21:18:25,722 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:18:25,722 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:18:25,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41309844] [2021-01-06 21:18:25,723 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:18:25,723 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:18:25,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:18:25,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:18:25,726 INFO L87 Difference]: Start difference. First operand 12904 states and 20605 transitions. Second operand 4 states. [2021-01-06 21:18:27,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:18:27,273 INFO L93 Difference]: Finished difference Result 37941 states and 60544 transitions. [2021-01-06 21:18:27,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:18:27,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2021-01-06 21:18:27,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:18:27,351 INFO L225 Difference]: With dead ends: 37941 [2021-01-06 21:18:27,351 INFO L226 Difference]: Without dead ends: 25046 [2021-01-06 21:18:27,375 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 21:18:27,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25046 states. [2021-01-06 21:18:28,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25046 to 25044. [2021-01-06 21:18:28,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25044 states. [2021-01-06 21:18:29,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25044 states to 25044 states and 39727 transitions. [2021-01-06 21:18:29,039 INFO L78 Accepts]: Start accepts. Automaton has 25044 states and 39727 transitions. Word has length 73 [2021-01-06 21:18:29,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:18:29,040 INFO L481 AbstractCegarLoop]: Abstraction has 25044 states and 39727 transitions. [2021-01-06 21:18:29,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:18:29,040 INFO L276 IsEmpty]: Start isEmpty. Operand 25044 states and 39727 transitions. [2021-01-06 21:18:29,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 21:18:29,041 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:18:29,041 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:18:29,041 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 21:18:29,042 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:18:29,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:18:29,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1735035679, now seen corresponding path program 1 times [2021-01-06 21:18:29,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:18:29,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789833997] [2021-01-06 21:18:29,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:18:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:18:29,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:18:29,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789833997] [2021-01-06 21:18:29,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:18:29,079 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:18:29,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021329871] [2021-01-06 21:18:29,079 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:18:29,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:18:29,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:18:29,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:18:29,080 INFO L87 Difference]: Start difference. First operand 25044 states and 39727 transitions. Second operand 3 states. [2021-01-06 21:18:31,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:18:31,906 INFO L93 Difference]: Finished difference Result 75094 states and 119119 transitions. [2021-01-06 21:18:31,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:18:31,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2021-01-06 21:18:31,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:18:32,063 INFO L225 Difference]: With dead ends: 75094 [2021-01-06 21:18:32,063 INFO L226 Difference]: Without dead ends: 50078 [2021-01-06 21:18:32,104 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:18:32,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50078 states. [2021-01-06 21:18:33,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50078 to 25046. [2021-01-06 21:18:33,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25046 states. [2021-01-06 21:18:33,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25046 states to 25046 states and 39729 transitions. [2021-01-06 21:18:33,996 INFO L78 Accepts]: Start accepts. Automaton has 25046 states and 39729 transitions. Word has length 74 [2021-01-06 21:18:33,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:18:33,996 INFO L481 AbstractCegarLoop]: Abstraction has 25046 states and 39729 transitions. [2021-01-06 21:18:33,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:18:33,996 INFO L276 IsEmpty]: Start isEmpty. Operand 25046 states and 39729 transitions. [2021-01-06 21:18:33,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 21:18:33,998 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:18:33,998 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:18:33,998 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 21:18:33,998 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:18:33,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:18:33,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1282212699, now seen corresponding path program 1 times [2021-01-06 21:18:33,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:18:33,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566162785] [2021-01-06 21:18:33,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:18:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:18:34,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:18:34,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566162785] [2021-01-06 21:18:34,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:18:34,047 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:18:34,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635877599] [2021-01-06 21:18:34,047 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:18:34,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:18:34,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:18:34,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:18:34,048 INFO L87 Difference]: Start difference. First operand 25046 states and 39729 transitions. Second operand 3 states. [2021-01-06 21:18:36,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:18:36,072 INFO L93 Difference]: Finished difference Result 60529 states and 96542 transitions. [2021-01-06 21:18:36,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:18:36,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2021-01-06 21:18:36,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:18:36,142 INFO L225 Difference]: With dead ends: 60529 [2021-01-06 21:18:36,142 INFO L226 Difference]: Without dead ends: 35612 [2021-01-06 21:18:36,181 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:18:36,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35612 states. [2021-01-06 21:18:38,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35612 to 34336. [2021-01-06 21:18:38,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34336 states. [2021-01-06 21:18:38,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34336 states to 34336 states and 54396 transitions. [2021-01-06 21:18:38,446 INFO L78 Accepts]: Start accepts. Automaton has 34336 states and 54396 transitions. Word has length 74 [2021-01-06 21:18:38,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:18:38,447 INFO L481 AbstractCegarLoop]: Abstraction has 34336 states and 54396 transitions. [2021-01-06 21:18:38,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:18:38,447 INFO L276 IsEmpty]: Start isEmpty. Operand 34336 states and 54396 transitions. [2021-01-06 21:18:38,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 21:18:38,448 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:18:38,448 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:18:38,449 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 21:18:38,449 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:18:38,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:18:38,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1471377814, now seen corresponding path program 1 times [2021-01-06 21:18:38,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:18:38,450 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157114920] [2021-01-06 21:18:38,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:18:38,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:18:38,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:18:38,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157114920] [2021-01-06 21:18:38,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:18:38,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:18:38,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276765652] [2021-01-06 21:18:38,523 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:18:38,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:18:38,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:18:38,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:18:38,524 INFO L87 Difference]: Start difference. First operand 34336 states and 54396 transitions. Second operand 3 states. [2021-01-06 21:18:42,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:18:42,235 INFO L93 Difference]: Finished difference Result 100709 states and 159458 transitions. [2021-01-06 21:18:42,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:18:42,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2021-01-06 21:18:42,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:18:42,353 INFO L225 Difference]: With dead ends: 100709 [2021-01-06 21:18:42,354 INFO L226 Difference]: Without dead ends: 66546 [2021-01-06 21:18:42,390 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:18:42,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66546 states. [2021-01-06 21:18:46,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66546 to 66544. [2021-01-06 21:18:46,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66544 states. [2021-01-06 21:18:46,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66544 states to 66544 states and 104661 transitions. [2021-01-06 21:18:46,655 INFO L78 Accepts]: Start accepts. Automaton has 66544 states and 104661 transitions. Word has length 75 [2021-01-06 21:18:46,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:18:46,655 INFO L481 AbstractCegarLoop]: Abstraction has 66544 states and 104661 transitions. [2021-01-06 21:18:46,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:18:46,656 INFO L276 IsEmpty]: Start isEmpty. Operand 66544 states and 104661 transitions. [2021-01-06 21:18:46,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 21:18:46,657 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:18:46,657 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:18:46,657 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 21:18:46,657 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:18:46,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:18:46,658 INFO L82 PathProgramCache]: Analyzing trace with hash 20351833, now seen corresponding path program 1 times [2021-01-06 21:18:46,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:18:46,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312484750] [2021-01-06 21:18:46,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:18:46,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:18:46,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:18:46,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312484750] [2021-01-06 21:18:46,767 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:18:46,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:18:46,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771369303] [2021-01-06 21:18:46,768 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:18:46,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:18:46,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:18:46,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:18:46,769 INFO L87 Difference]: Start difference. First operand 66544 states and 104661 transitions. Second operand 5 states. [2021-01-06 21:18:53,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:18:53,775 INFO L93 Difference]: Finished difference Result 187298 states and 294406 transitions. [2021-01-06 21:18:53,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:18:53,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2021-01-06 21:18:53,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:18:54,026 INFO L225 Difference]: With dead ends: 187298 [2021-01-06 21:18:54,026 INFO L226 Difference]: Without dead ends: 120768 [2021-01-06 21:18:54,282 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 21:18:54,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120768 states. [2021-01-06 21:19:01,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120768 to 120766. [2021-01-06 21:19:01,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120766 states. [2021-01-06 21:19:02,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120766 states to 120766 states and 188351 transitions. [2021-01-06 21:19:02,022 INFO L78 Accepts]: Start accepts. Automaton has 120766 states and 188351 transitions. Word has length 75 [2021-01-06 21:19:02,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:19:02,022 INFO L481 AbstractCegarLoop]: Abstraction has 120766 states and 188351 transitions. [2021-01-06 21:19:02,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:19:02,023 INFO L276 IsEmpty]: Start isEmpty. Operand 120766 states and 188351 transitions. [2021-01-06 21:19:02,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 21:19:02,024 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:19:02,025 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:19:02,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 21:19:02,025 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:19:02,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:19:02,026 INFO L82 PathProgramCache]: Analyzing trace with hash -259692172, now seen corresponding path program 1 times [2021-01-06 21:19:02,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:19:02,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380876831] [2021-01-06 21:19:02,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:19:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:19:02,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:19:02,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380876831] [2021-01-06 21:19:02,125 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:19:02,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:19:02,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955505508] [2021-01-06 21:19:02,126 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:19:02,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:19:02,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:19:02,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:19:02,127 INFO L87 Difference]: Start difference. First operand 120766 states and 188351 transitions. Second operand 4 states. [2021-01-06 21:19:16,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:19:16,407 INFO L93 Difference]: Finished difference Result 354543 states and 552356 transitions. [2021-01-06 21:19:16,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:19:16,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2021-01-06 21:19:16,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:19:16,888 INFO L225 Difference]: With dead ends: 354543 [2021-01-06 21:19:16,888 INFO L226 Difference]: Without dead ends: 233833 [2021-01-06 21:19:16,990 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 21:19:17,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233833 states. [2021-01-06 21:19:31,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233833 to 233831. [2021-01-06 21:19:31,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233831 states. [2021-01-06 21:19:32,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233831 states to 233831 states and 361969 transitions. [2021-01-06 21:19:32,433 INFO L78 Accepts]: Start accepts. Automaton has 233831 states and 361969 transitions. Word has length 75 [2021-01-06 21:19:32,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:19:32,434 INFO L481 AbstractCegarLoop]: Abstraction has 233831 states and 361969 transitions. [2021-01-06 21:19:32,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:19:32,434 INFO L276 IsEmpty]: Start isEmpty. Operand 233831 states and 361969 transitions. [2021-01-06 21:19:32,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 21:19:32,436 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:19:32,436 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:19:32,437 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 21:19:32,437 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:19:32,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:19:32,437 INFO L82 PathProgramCache]: Analyzing trace with hash -805359648, now seen corresponding path program 1 times [2021-01-06 21:19:32,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:19:32,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819124751] [2021-01-06 21:19:32,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:19:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:19:32,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:19:32,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819124751] [2021-01-06 21:19:32,483 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:19:32,483 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:19:32,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131875641] [2021-01-06 21:19:32,483 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:19:32,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:19:32,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:19:32,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:19:32,484 INFO L87 Difference]: Start difference. First operand 233831 states and 361969 transitions. Second operand 3 states. [2021-01-06 21:20:01,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:20:01,493 INFO L93 Difference]: Finished difference Result 701341 states and 1085674 transitions. [2021-01-06 21:20:01,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:20:01,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2021-01-06 21:20:01,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:20:02,740 INFO L225 Difference]: With dead ends: 701341 [2021-01-06 21:20:02,740 INFO L226 Difference]: Without dead ends: 467601 [2021-01-06 21:20:03,001 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:20:03,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467601 states. [2021-01-06 21:20:21,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467601 to 233841. [2021-01-06 21:20:21,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233841 states. [2021-01-06 21:20:22,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233841 states to 233841 states and 361979 transitions. [2021-01-06 21:20:22,576 INFO L78 Accepts]: Start accepts. Automaton has 233841 states and 361979 transitions. Word has length 76 [2021-01-06 21:20:22,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:20:22,578 INFO L481 AbstractCegarLoop]: Abstraction has 233841 states and 361979 transitions. [2021-01-06 21:20:22,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:20:22,592 INFO L276 IsEmpty]: Start isEmpty. Operand 233841 states and 361979 transitions. [2021-01-06 21:20:22,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 21:20:22,596 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:20:22,596 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:20:22,596 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 21:20:22,596 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:20:22,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:20:22,597 INFO L82 PathProgramCache]: Analyzing trace with hash 2070133608, now seen corresponding path program 1 times [2021-01-06 21:20:22,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:20:22,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299809041] [2021-01-06 21:20:22,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:20:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:20:22,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:20:22,655 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299809041] [2021-01-06 21:20:22,655 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:20:22,655 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:20:22,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557912905] [2021-01-06 21:20:22,657 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:20:22,657 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:20:22,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:20:22,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:20:22,658 INFO L87 Difference]: Start difference. First operand 233841 states and 361979 transitions. Second operand 3 states.