/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 20:21:11,479 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 20:21:11,484 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 20:21:11,547 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 20:21:11,548 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 20:21:11,553 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 20:21:11,557 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 20:21:11,563 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 20:21:11,567 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 20:21:11,576 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 20:21:11,581 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 20:21:11,583 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 20:21:11,583 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 20:21:11,587 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 20:21:11,589 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 20:21:11,591 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 20:21:11,592 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 20:21:11,597 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 20:21:11,605 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 20:21:11,613 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 20:21:11,618 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 20:21:11,619 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 20:21:11,622 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 20:21:11,623 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 20:21:11,636 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 20:21:11,637 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 20:21:11,637 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 20:21:11,638 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 20:21:11,639 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 20:21:11,640 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 20:21:11,641 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 20:21:11,642 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 20:21:11,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 20:21:11,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 20:21:11,645 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 20:21:11,645 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 20:21:11,646 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 20:21:11,646 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 20:21:11,646 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 20:21:11,647 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 20:21:11,648 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 20:21:11,649 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 20:21:11,676 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 20:21:11,676 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 20:21:11,678 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 20:21:11,678 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 20:21:11,679 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 20:21:11,679 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 20:21:11,679 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 20:21:11,679 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 20:21:11,679 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 20:21:11,680 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 20:21:11,680 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 20:21:11,680 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 20:21:11,680 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 20:21:11,681 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 20:21:11,681 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 20:21:11,681 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 20:21:11,681 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 20:21:11,681 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 20:21:11,682 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 20:21:11,682 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 20:21:11,682 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 20:21:11,682 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 20:21:11,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 20:21:11,683 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 20:21:11,683 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 20:21:11,683 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 20:21:12,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 20:21:12,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 20:21:12,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 20:21:12,112 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 20:21:12,113 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 20:21:12,114 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2021-01-06 20:21:12,210 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/4ca1b7668/8b7f23fa2dec4e96b8c89b1d803814a6/FLAG0c87faa8e [2021-01-06 20:21:12,957 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 20:21:12,957 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2021-01-06 20:21:12,973 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/4ca1b7668/8b7f23fa2dec4e96b8c89b1d803814a6/FLAG0c87faa8e [2021-01-06 20:21:13,237 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/4ca1b7668/8b7f23fa2dec4e96b8c89b1d803814a6 [2021-01-06 20:21:13,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 20:21:13,250 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 20:21:13,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 20:21:13,255 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 20:21:13,260 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 20:21:13,262 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 08:21:13" (1/1) ... [2021-01-06 20:21:13,264 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@adc4bce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:21:13, skipping insertion in model container [2021-01-06 20:21:13,264 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 08:21:13" (1/1) ... [2021-01-06 20:21:13,273 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 20:21:13,347 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~ep12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep31~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep32~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~init__r121~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r131~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r211~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r231~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r311~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r321~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r122~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r132~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r212~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r232~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r312~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r322~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_1757~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_1888~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~0,] [2021-01-06 20:21:13,586 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[6831,6844] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_1986~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] [2021-01-06 20:21:13,650 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 20:21:13,683 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~ep12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep31~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep32~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~init__r121~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r131~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r211~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r231~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r311~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r321~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r122~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r132~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r212~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r232~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r312~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r322~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_1757~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_1888~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~0,] [2021-01-06 20:21:13,833 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[6831,6844] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_1986~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] [2021-01-06 20:21:13,907 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 20:21:13,953 INFO L208 MainTranslator]: Completed translation [2021-01-06 20:21:13,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:21:13 WrapperNode [2021-01-06 20:21:13,953 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 20:21:13,955 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 20:21:13,955 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 20:21:13,955 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 20:21:13,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:21:13" (1/1) ... [2021-01-06 20:21:13,978 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:21:13" (1/1) ... [2021-01-06 20:21:14,023 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 20:21:14,025 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 20:21:14,025 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 20:21:14,025 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 20:21:14,035 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:21:13" (1/1) ... [2021-01-06 20:21:14,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:21:13" (1/1) ... [2021-01-06 20:21:14,040 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:21:13" (1/1) ... [2021-01-06 20:21:14,041 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:21:13" (1/1) ... [2021-01-06 20:21:14,051 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:21:13" (1/1) ... [2021-01-06 20:21:14,058 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:21:13" (1/1) ... [2021-01-06 20:21:14,067 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:21:13" (1/1) ... [2021-01-06 20:21:14,082 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 20:21:14,083 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 20:21:14,083 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 20:21:14,084 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 20:21:14,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:21:13" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 20:21:14,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 20:21:14,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 20:21:14,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 20:21:14,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 20:21:15,221 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 20:21:15,222 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-01-06 20:21:15,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 08:21:15 BoogieIcfgContainer [2021-01-06 20:21:15,224 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 20:21:15,227 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 20:21:15,227 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 20:21:15,231 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 20:21:15,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 08:21:13" (1/3) ... [2021-01-06 20:21:15,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b01df6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 08:21:15, skipping insertion in model container [2021-01-06 20:21:15,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:21:13" (2/3) ... [2021-01-06 20:21:15,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b01df6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 08:21:15, skipping insertion in model container [2021-01-06 20:21:15,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 08:21:15" (3/3) ... [2021-01-06 20:21:15,243 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2021-01-06 20:21:15,251 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 20:21:15,257 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 20:21:15,284 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 20:21:15,332 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 20:21:15,332 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 20:21:15,332 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 20:21:15,333 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 20:21:15,333 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 20:21:15,333 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 20:21:15,333 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 20:21:15,333 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 20:21:15,352 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states. [2021-01-06 20:21:15,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-01-06 20:21:15,362 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:21:15,363 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:21:15,363 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:21:15,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:21:15,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1933157835, now seen corresponding path program 1 times [2021-01-06 20:21:15,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:21:15,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007488662] [2021-01-06 20:21:15,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:21:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:21:15,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:21:15,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007488662] [2021-01-06 20:21:15,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:21:15,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:21:15,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540382210] [2021-01-06 20:21:15,862 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:21:15,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:21:15,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:21:15,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:21:15,887 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 3 states. [2021-01-06 20:21:16,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:21:16,095 INFO L93 Difference]: Finished difference Result 278 states and 475 transitions. [2021-01-06 20:21:16,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:21:16,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2021-01-06 20:21:16,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:21:16,138 INFO L225 Difference]: With dead ends: 278 [2021-01-06 20:21:16,139 INFO L226 Difference]: Without dead ends: 191 [2021-01-06 20:21:16,145 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:21:16,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-01-06 20:21:16,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2021-01-06 20:21:16,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2021-01-06 20:21:16,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 297 transitions. [2021-01-06 20:21:16,285 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 297 transitions. Word has length 57 [2021-01-06 20:21:16,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:21:16,286 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 297 transitions. [2021-01-06 20:21:16,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:21:16,287 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 297 transitions. [2021-01-06 20:21:16,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-01-06 20:21:16,294 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:21:16,294 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:21:16,296 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 20:21:16,296 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:21:16,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:21:16,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1883490782, now seen corresponding path program 1 times [2021-01-06 20:21:16,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:21:16,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750199268] [2021-01-06 20:21:16,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:21:16,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:21:16,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:21:16,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750199268] [2021-01-06 20:21:16,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:21:16,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:21:16,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850087757] [2021-01-06 20:21:16,483 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:21:16,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:21:16,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:21:16,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:21:16,485 INFO L87 Difference]: Start difference. First operand 189 states and 297 transitions. Second operand 3 states. [2021-01-06 20:21:16,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:21:16,546 INFO L93 Difference]: Finished difference Result 445 states and 721 transitions. [2021-01-06 20:21:16,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:21:16,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2021-01-06 20:21:16,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:21:16,557 INFO L225 Difference]: With dead ends: 445 [2021-01-06 20:21:16,557 INFO L226 Difference]: Without dead ends: 310 [2021-01-06 20:21:16,559 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:21:16,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-01-06 20:21:16,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2021-01-06 20:21:16,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2021-01-06 20:21:16,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 493 transitions. [2021-01-06 20:21:16,622 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 493 transitions. Word has length 59 [2021-01-06 20:21:16,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:21:16,623 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 493 transitions. [2021-01-06 20:21:16,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:21:16,623 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 493 transitions. [2021-01-06 20:21:16,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-01-06 20:21:16,628 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:21:16,629 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] [2021-01-06 20:21:16,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 20:21:16,629 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:21:16,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:21:16,630 INFO L82 PathProgramCache]: Analyzing trace with hash -111872728, now seen corresponding path program 1 times [2021-01-06 20:21:16,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:21:16,631 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845463828] [2021-01-06 20:21:16,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:21:16,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:21:16,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:21:16,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845463828] [2021-01-06 20:21:16,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:21:16,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:21:16,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805534620] [2021-01-06 20:21:16,803 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:21:16,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:21:16,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:21:16,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:21:16,805 INFO L87 Difference]: Start difference. First operand 308 states and 493 transitions. Second operand 3 states. [2021-01-06 20:21:16,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:21:16,849 INFO L93 Difference]: Finished difference Result 563 states and 917 transitions. [2021-01-06 20:21:16,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:21:16,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2021-01-06 20:21:16,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:21:16,853 INFO L225 Difference]: With dead ends: 563 [2021-01-06 20:21:16,853 INFO L226 Difference]: Without dead ends: 428 [2021-01-06 20:21:16,855 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:21:16,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2021-01-06 20:21:16,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 426. [2021-01-06 20:21:16,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2021-01-06 20:21:16,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 687 transitions. [2021-01-06 20:21:16,885 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 687 transitions. Word has length 61 [2021-01-06 20:21:16,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:21:16,885 INFO L481 AbstractCegarLoop]: Abstraction has 426 states and 687 transitions. [2021-01-06 20:21:16,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:21:16,886 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 687 transitions. [2021-01-06 20:21:16,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-01-06 20:21:16,887 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:21:16,887 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] [2021-01-06 20:21:16,887 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 20:21:16,887 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:21:16,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:21:16,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1275396395, now seen corresponding path program 1 times [2021-01-06 20:21:16,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:21:16,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586946073] [2021-01-06 20:21:16,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:21:16,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:21:17,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:21:17,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586946073] [2021-01-06 20:21:17,006 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:21:17,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:21:17,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403252550] [2021-01-06 20:21:17,008 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:21:17,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:21:17,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:21:17,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:21:17,011 INFO L87 Difference]: Start difference. First operand 426 states and 687 transitions. Second operand 3 states. [2021-01-06 20:21:17,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:21:17,099 INFO L93 Difference]: Finished difference Result 1082 states and 1767 transitions. [2021-01-06 20:21:17,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:21:17,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2021-01-06 20:21:17,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:21:17,105 INFO L225 Difference]: With dead ends: 1082 [2021-01-06 20:21:17,105 INFO L226 Difference]: Without dead ends: 733 [2021-01-06 20:21:17,112 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:21:17,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2021-01-06 20:21:17,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 731. [2021-01-06 20:21:17,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2021-01-06 20:21:17,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1181 transitions. [2021-01-06 20:21:17,163 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1181 transitions. Word has length 61 [2021-01-06 20:21:17,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:21:17,164 INFO L481 AbstractCegarLoop]: Abstraction has 731 states and 1181 transitions. [2021-01-06 20:21:17,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:21:17,164 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1181 transitions. [2021-01-06 20:21:17,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-06 20:21:17,165 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:21:17,165 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:21:17,166 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 20:21:17,166 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:21:17,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:21:17,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1280827262, now seen corresponding path program 1 times [2021-01-06 20:21:17,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:21:17,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37080477] [2021-01-06 20:21:17,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:21:17,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:21:17,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:21:17,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37080477] [2021-01-06 20:21:17,299 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:21:17,299 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 20:21:17,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398526578] [2021-01-06 20:21:17,302 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:21:17,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:21:17,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:21:17,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:21:17,305 INFO L87 Difference]: Start difference. First operand 731 states and 1181 transitions. Second operand 5 states. [2021-01-06 20:21:17,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:21:17,552 INFO L93 Difference]: Finished difference Result 3004 states and 4923 transitions. [2021-01-06 20:21:17,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:21:17,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2021-01-06 20:21:17,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:21:17,568 INFO L225 Difference]: With dead ends: 3004 [2021-01-06 20:21:17,568 INFO L226 Difference]: Without dead ends: 2350 [2021-01-06 20:21:17,571 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:21:17,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2350 states. [2021-01-06 20:21:17,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2350 to 1385. [2021-01-06 20:21:17,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1385 states. [2021-01-06 20:21:17,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 2237 transitions. [2021-01-06 20:21:17,689 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 2237 transitions. Word has length 63 [2021-01-06 20:21:17,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:21:17,693 INFO L481 AbstractCegarLoop]: Abstraction has 1385 states and 2237 transitions. [2021-01-06 20:21:17,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:21:17,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 2237 transitions. [2021-01-06 20:21:17,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-01-06 20:21:17,695 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:21:17,695 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:21:17,696 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 20:21:17,696 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:21:17,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:21:17,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1113443658, now seen corresponding path program 1 times [2021-01-06 20:21:17,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:21:17,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334990433] [2021-01-06 20:21:17,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:21:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:21:17,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:21:17,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334990433] [2021-01-06 20:21:17,842 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:21:17,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 20:21:17,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733319859] [2021-01-06 20:21:17,843 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 20:21:17,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:21:17,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 20:21:17,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 20:21:17,846 INFO L87 Difference]: Start difference. First operand 1385 states and 2237 transitions. Second operand 4 states. [2021-01-06 20:21:18,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:21:18,119 INFO L93 Difference]: Finished difference Result 4443 states and 7230 transitions. [2021-01-06 20:21:18,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 20:21:18,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2021-01-06 20:21:18,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:21:18,138 INFO L225 Difference]: With dead ends: 4443 [2021-01-06 20:21:18,138 INFO L226 Difference]: Without dead ends: 3137 [2021-01-06 20:21:18,142 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 20:21:18,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3137 states. [2021-01-06 20:21:18,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3137 to 2575. [2021-01-06 20:21:18,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2575 states. [2021-01-06 20:21:18,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2575 states to 2575 states and 4153 transitions. [2021-01-06 20:21:18,333 INFO L78 Accepts]: Start accepts. Automaton has 2575 states and 4153 transitions. Word has length 64 [2021-01-06 20:21:18,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:21:18,334 INFO L481 AbstractCegarLoop]: Abstraction has 2575 states and 4153 transitions. [2021-01-06 20:21:18,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 20:21:18,334 INFO L276 IsEmpty]: Start isEmpty. Operand 2575 states and 4153 transitions. [2021-01-06 20:21:18,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-01-06 20:21:18,336 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:21:18,337 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:21:18,338 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 20:21:18,339 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:21:18,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:21:18,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1248232611, now seen corresponding path program 1 times [2021-01-06 20:21:18,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:21:18,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306431892] [2021-01-06 20:21:18,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:21:18,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:21:18,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:21:18,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306431892] [2021-01-06 20:21:18,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:21:18,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:21:18,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347335363] [2021-01-06 20:21:18,480 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:21:18,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:21:18,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:21:18,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:21:18,482 INFO L87 Difference]: Start difference. First operand 2575 states and 4153 transitions. Second operand 3 states. [2021-01-06 20:21:18,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:21:18,699 INFO L93 Difference]: Finished difference Result 4939 states and 8007 transitions. [2021-01-06 20:21:18,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:21:18,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2021-01-06 20:21:18,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:21:18,718 INFO L225 Difference]: With dead ends: 4939 [2021-01-06 20:21:18,718 INFO L226 Difference]: Without dead ends: 3555 [2021-01-06 20:21:18,724 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:21:18,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3555 states. [2021-01-06 20:21:19,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3555 to 3553. [2021-01-06 20:21:19,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3553 states. [2021-01-06 20:21:19,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3553 states to 3553 states and 5707 transitions. [2021-01-06 20:21:19,022 INFO L78 Accepts]: Start accepts. Automaton has 3553 states and 5707 transitions. Word has length 64 [2021-01-06 20:21:19,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:21:19,022 INFO L481 AbstractCegarLoop]: Abstraction has 3553 states and 5707 transitions. [2021-01-06 20:21:19,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:21:19,023 INFO L276 IsEmpty]: Start isEmpty. Operand 3553 states and 5707 transitions. [2021-01-06 20:21:19,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-01-06 20:21:19,025 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:21:19,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] [2021-01-06 20:21:19,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 20:21:19,026 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:21:19,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:21:19,026 INFO L82 PathProgramCache]: Analyzing trace with hash 616386787, now seen corresponding path program 1 times [2021-01-06 20:21:19,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:21:19,027 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137585886] [2021-01-06 20:21:19,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:21:19,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:21:19,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:21:19,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137585886] [2021-01-06 20:21:19,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:21:19,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:21:19,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437621994] [2021-01-06 20:21:19,095 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:21:19,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:21:19,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:21:19,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:21:19,096 INFO L87 Difference]: Start difference. First operand 3553 states and 5707 transitions. Second operand 3 states. [2021-01-06 20:21:19,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:21:19,432 INFO L93 Difference]: Finished difference Result 8360 states and 13539 transitions. [2021-01-06 20:21:19,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:21:19,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2021-01-06 20:21:19,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:21:19,460 INFO L225 Difference]: With dead ends: 8360 [2021-01-06 20:21:19,461 INFO L226 Difference]: Without dead ends: 4889 [2021-01-06 20:21:19,467 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:21:19,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4889 states. [2021-01-06 20:21:19,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4889 to 4887. [2021-01-06 20:21:19,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4887 states. [2021-01-06 20:21:19,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4887 states to 4887 states and 7908 transitions. [2021-01-06 20:21:19,835 INFO L78 Accepts]: Start accepts. Automaton has 4887 states and 7908 transitions. Word has length 64 [2021-01-06 20:21:19,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:21:19,836 INFO L481 AbstractCegarLoop]: Abstraction has 4887 states and 7908 transitions. [2021-01-06 20:21:19,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:21:19,836 INFO L276 IsEmpty]: Start isEmpty. Operand 4887 states and 7908 transitions. [2021-01-06 20:21:19,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-06 20:21:19,837 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:21:19,837 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:21:19,837 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 20:21:19,837 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:21:19,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:21:19,838 INFO L82 PathProgramCache]: Analyzing trace with hash -214961207, now seen corresponding path program 1 times [2021-01-06 20:21:19,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:21:19,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262052511] [2021-01-06 20:21:19,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:21:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:21:19,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:21:19,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262052511] [2021-01-06 20:21:19,946 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:21:19,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 20:21:19,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887753266] [2021-01-06 20:21:19,947 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 20:21:19,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:21:19,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 20:21:19,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 20:21:19,949 INFO L87 Difference]: Start difference. First operand 4887 states and 7908 transitions. Second operand 4 states. [2021-01-06 20:21:20,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:21:20,542 INFO L93 Difference]: Finished difference Result 13998 states and 22772 transitions. [2021-01-06 20:21:20,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 20:21:20,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2021-01-06 20:21:20,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:21:20,613 INFO L225 Difference]: With dead ends: 13998 [2021-01-06 20:21:20,615 INFO L226 Difference]: Without dead ends: 9193 [2021-01-06 20:21:20,625 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:21:20,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9193 states. [2021-01-06 20:21:21,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9193 to 7815. [2021-01-06 20:21:21,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7815 states. [2021-01-06 20:21:21,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7815 states to 7815 states and 12584 transitions. [2021-01-06 20:21:21,239 INFO L78 Accepts]: Start accepts. Automaton has 7815 states and 12584 transitions. Word has length 65 [2021-01-06 20:21:21,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:21:21,240 INFO L481 AbstractCegarLoop]: Abstraction has 7815 states and 12584 transitions. [2021-01-06 20:21:21,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 20:21:21,240 INFO L276 IsEmpty]: Start isEmpty. Operand 7815 states and 12584 transitions. [2021-01-06 20:21:21,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 20:21:21,241 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:21:21,241 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:21:21,241 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 20:21:21,241 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:21:21,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:21:21,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1872749021, now seen corresponding path program 1 times [2021-01-06 20:21:21,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:21:21,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728230119] [2021-01-06 20:21:21,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:21:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:21:21,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:21:21,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728230119] [2021-01-06 20:21:21,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:21:21,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 20:21:21,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177034563] [2021-01-06 20:21:21,352 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 20:21:21,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:21:21,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 20:21:21,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 20:21:21,357 INFO L87 Difference]: Start difference. First operand 7815 states and 12584 transitions. Second operand 4 states. [2021-01-06 20:21:22,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:21:22,335 INFO L93 Difference]: Finished difference Result 22755 states and 36805 transitions. [2021-01-06 20:21:22,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 20:21:22,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2021-01-06 20:21:22,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:21:22,377 INFO L225 Difference]: With dead ends: 22755 [2021-01-06 20:21:22,378 INFO L226 Difference]: Without dead ends: 15022 [2021-01-06 20:21:22,390 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 20:21:22,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15022 states. [2021-01-06 20:21:23,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15022 to 12299. [2021-01-06 20:21:23,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12299 states. [2021-01-06 20:21:23,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12299 states to 12299 states and 19696 transitions. [2021-01-06 20:21:23,373 INFO L78 Accepts]: Start accepts. Automaton has 12299 states and 19696 transitions. Word has length 66 [2021-01-06 20:21:23,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:21:23,373 INFO L481 AbstractCegarLoop]: Abstraction has 12299 states and 19696 transitions. [2021-01-06 20:21:23,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 20:21:23,374 INFO L276 IsEmpty]: Start isEmpty. Operand 12299 states and 19696 transitions. [2021-01-06 20:21:23,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 20:21:23,375 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:21:23,375 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 20:21:23,375 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 20:21:23,376 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:21:23,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:21:23,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1396799506, now seen corresponding path program 1 times [2021-01-06 20:21:23,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:21:23,377 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442452845] [2021-01-06 20:21:23,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:21:23,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:21:23,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:21:23,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442452845] [2021-01-06 20:21:23,560 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:21:23,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 20:21:23,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506762156] [2021-01-06 20:21:23,561 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:21:23,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:21:23,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:21:23,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:21:23,563 INFO L87 Difference]: Start difference. First operand 12299 states and 19696 transitions. Second operand 5 states. [2021-01-06 20:21:24,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:21:24,931 INFO L93 Difference]: Finished difference Result 29256 states and 47101 transitions. [2021-01-06 20:21:24,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:21:24,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2021-01-06 20:21:24,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:21:24,991 INFO L225 Difference]: With dead ends: 29256 [2021-01-06 20:21:24,992 INFO L226 Difference]: Without dead ends: 17039 [2021-01-06 20:21:25,008 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:21:25,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17039 states. [2021-01-06 20:21:25,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17039 to 12299. [2021-01-06 20:21:25,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12299 states. [2021-01-06 20:21:25,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12299 states to 12299 states and 19546 transitions. [2021-01-06 20:21:25,855 INFO L78 Accepts]: Start accepts. Automaton has 12299 states and 19546 transitions. Word has length 68 [2021-01-06 20:21:25,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:21:25,856 INFO L481 AbstractCegarLoop]: Abstraction has 12299 states and 19546 transitions. [2021-01-06 20:21:25,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:21:25,856 INFO L276 IsEmpty]: Start isEmpty. Operand 12299 states and 19546 transitions. [2021-01-06 20:21:25,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-01-06 20:21:25,857 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:21:25,857 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 20:21:25,857 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 20:21:25,857 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:21:25,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:21:25,858 INFO L82 PathProgramCache]: Analyzing trace with hash -164512453, now seen corresponding path program 1 times [2021-01-06 20:21:25,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:21:25,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005461854] [2021-01-06 20:21:25,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:21:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:21:25,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:21:25,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005461854] [2021-01-06 20:21:25,993 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:21:25,994 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 20:21:25,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030189483] [2021-01-06 20:21:25,998 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 20:21:25,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:21:25,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 20:21:25,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 20:21:26,000 INFO L87 Difference]: Start difference. First operand 12299 states and 19546 transitions. Second operand 4 states. [2021-01-06 20:21:27,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:21:27,725 INFO L93 Difference]: Finished difference Result 36403 states and 57839 transitions. [2021-01-06 20:21:27,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 20:21:27,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2021-01-06 20:21:27,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:21:27,875 INFO L225 Difference]: With dead ends: 36403 [2021-01-06 20:21:27,875 INFO L226 Difference]: Without dead ends: 24113 [2021-01-06 20:21:27,892 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:21:27,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24113 states. [2021-01-06 20:21:29,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24113 to 24111. [2021-01-06 20:21:29,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24111 states. [2021-01-06 20:21:29,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24111 states to 24111 states and 38102 transitions. [2021-01-06 20:21:29,444 INFO L78 Accepts]: Start accepts. Automaton has 24111 states and 38102 transitions. Word has length 71 [2021-01-06 20:21:29,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:21:29,444 INFO L481 AbstractCegarLoop]: Abstraction has 24111 states and 38102 transitions. [2021-01-06 20:21:29,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 20:21:29,445 INFO L276 IsEmpty]: Start isEmpty. Operand 24111 states and 38102 transitions. [2021-01-06 20:21:29,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 20:21:29,446 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:21:29,446 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 20:21:29,446 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 20:21:29,446 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:21:29,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:21:29,447 INFO L82 PathProgramCache]: Analyzing trace with hash 667892135, now seen corresponding path program 1 times [2021-01-06 20:21:29,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:21:29,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573286523] [2021-01-06 20:21:29,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:21:29,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:21:29,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:21:29,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573286523] [2021-01-06 20:21:29,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:21:29,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:21:29,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137185226] [2021-01-06 20:21:29,491 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:21:29,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:21:29,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:21:29,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:21:29,492 INFO L87 Difference]: Start difference. First operand 24111 states and 38102 transitions. Second operand 3 states. [2021-01-06 20:21:32,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:21:32,134 INFO L93 Difference]: Finished difference Result 72295 states and 114244 transitions. [2021-01-06 20:21:32,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:21:32,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-01-06 20:21:32,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:21:32,227 INFO L225 Difference]: With dead ends: 72295 [2021-01-06 20:21:32,228 INFO L226 Difference]: Without dead ends: 48212 [2021-01-06 20:21:32,277 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:21:32,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48212 states. [2021-01-06 20:21:34,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48212 to 24113. [2021-01-06 20:21:34,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24113 states. [2021-01-06 20:21:34,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24113 states to 24113 states and 38104 transitions. [2021-01-06 20:21:34,214 INFO L78 Accepts]: Start accepts. Automaton has 24113 states and 38104 transitions. Word has length 72 [2021-01-06 20:21:34,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:21:34,214 INFO L481 AbstractCegarLoop]: Abstraction has 24113 states and 38104 transitions. [2021-01-06 20:21:34,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:21:34,214 INFO L276 IsEmpty]: Start isEmpty. Operand 24113 states and 38104 transitions. [2021-01-06 20:21:34,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-06 20:21:34,216 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:21:34,216 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 20:21:34,216 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 20:21:34,216 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:21:34,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:21:34,217 INFO L82 PathProgramCache]: Analyzing trace with hash -808520295, now seen corresponding path program 1 times [2021-01-06 20:21:34,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:21:34,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407760266] [2021-01-06 20:21:34,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:21:34,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:21:34,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:21:34,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407760266] [2021-01-06 20:21:34,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:21:34,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:21:34,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616684756] [2021-01-06 20:21:34,289 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:21:34,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:21:34,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:21:34,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:21:34,290 INFO L87 Difference]: Start difference. First operand 24113 states and 38104 transitions. Second operand 3 states. [2021-01-06 20:21:37,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:21:37,520 INFO L93 Difference]: Finished difference Result 70655 states and 111703 transitions. [2021-01-06 20:21:37,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:21:37,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2021-01-06 20:21:37,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:21:37,617 INFO L225 Difference]: With dead ends: 70655 [2021-01-06 20:21:37,617 INFO L226 Difference]: Without dead ends: 46698 [2021-01-06 20:21:37,644 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:21:37,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46698 states. [2021-01-06 20:21:40,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46698 to 46696. [2021-01-06 20:21:40,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46696 states. [2021-01-06 20:21:41,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46696 states to 46696 states and 73259 transitions. [2021-01-06 20:21:41,053 INFO L78 Accepts]: Start accepts. Automaton has 46696 states and 73259 transitions. Word has length 73 [2021-01-06 20:21:41,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:21:41,054 INFO L481 AbstractCegarLoop]: Abstraction has 46696 states and 73259 transitions. [2021-01-06 20:21:41,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:21:41,054 INFO L276 IsEmpty]: Start isEmpty. Operand 46696 states and 73259 transitions. [2021-01-06 20:21:41,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-06 20:21:41,055 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:21:41,055 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 20:21:41,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 20:21:41,056 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:21:41,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:21:41,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1547459556, now seen corresponding path program 1 times [2021-01-06 20:21:41,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:21:41,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636641965] [2021-01-06 20:21:41,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:21:41,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:21:41,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:21:41,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636641965] [2021-01-06 20:21:41,201 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:21:41,201 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 20:21:41,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425882718] [2021-01-06 20:21:41,201 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:21:41,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:21:41,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:21:41,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:21:41,202 INFO L87 Difference]: Start difference. First operand 46696 states and 73259 transitions. Second operand 5 states. [2021-01-06 20:21:47,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:21:47,057 INFO L93 Difference]: Finished difference Result 137988 states and 216428 transitions. [2021-01-06 20:21:47,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 20:21:47,057 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2021-01-06 20:21:47,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:21:47,207 INFO L225 Difference]: With dead ends: 137988 [2021-01-06 20:21:47,207 INFO L226 Difference]: Without dead ends: 91306 [2021-01-06 20:21:47,255 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:21:47,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91306 states. [2021-01-06 20:21:53,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91306 to 91304. [2021-01-06 20:21:53,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91304 states. [2021-01-06 20:21:53,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91304 states to 91304 states and 142371 transitions. [2021-01-06 20:21:53,796 INFO L78 Accepts]: Start accepts. Automaton has 91304 states and 142371 transitions. Word has length 73 [2021-01-06 20:21:53,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:21:53,796 INFO L481 AbstractCegarLoop]: Abstraction has 91304 states and 142371 transitions. [2021-01-06 20:21:53,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:21:53,797 INFO L276 IsEmpty]: Start isEmpty. Operand 91304 states and 142371 transitions. [2021-01-06 20:21:53,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-06 20:21:53,798 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:21:53,798 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:21:53,798 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 20:21:53,798 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:21:53,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:21:53,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1975872346, now seen corresponding path program 1 times [2021-01-06 20:21:53,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:21:53,799 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565288765] [2021-01-06 20:21:53,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:21:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:21:53,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:21:53,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565288765] [2021-01-06 20:21:53,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:21:53,927 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 20:21:53,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969368273] [2021-01-06 20:21:53,927 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 20:21:53,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:21:53,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 20:21:53,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 20:21:53,928 INFO L87 Difference]: Start difference. First operand 91304 states and 142371 transitions. Second operand 4 states. [2021-01-06 20:22:06,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:22:06,131 INFO L93 Difference]: Finished difference Result 267879 states and 417692 transitions. [2021-01-06 20:22:06,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 20:22:06,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2021-01-06 20:22:06,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:22:06,668 INFO L225 Difference]: With dead ends: 267879 [2021-01-06 20:22:06,668 INFO L226 Difference]: Without dead ends: 176631 [2021-01-06 20:22:06,744 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:22:06,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176631 states. [2021-01-06 20:22:19,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176631 to 176629. [2021-01-06 20:22:19,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176629 states. [2021-01-06 20:22:19,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176629 states to 176629 states and 273369 transitions. [2021-01-06 20:22:19,499 INFO L78 Accepts]: Start accepts. Automaton has 176629 states and 273369 transitions. Word has length 73 [2021-01-06 20:22:19,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:22:19,499 INFO L481 AbstractCegarLoop]: Abstraction has 176629 states and 273369 transitions. [2021-01-06 20:22:19,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 20:22:19,500 INFO L276 IsEmpty]: Start isEmpty. Operand 176629 states and 273369 transitions. [2021-01-06 20:22:19,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 20:22:19,502 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:22:19,502 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 20:22:19,503 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 20:22:19,503 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:22:19,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:22:19,503 INFO L82 PathProgramCache]: Analyzing trace with hash -2004902810, now seen corresponding path program 1 times [2021-01-06 20:22:19,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:22:19,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996588597] [2021-01-06 20:22:19,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:22:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:22:19,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:22:19,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996588597] [2021-01-06 20:22:19,536 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:22:19,537 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:22:19,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234503912] [2021-01-06 20:22:19,537 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:22:19,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:22:19,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:22:19,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:22:19,538 INFO L87 Difference]: Start difference. First operand 176629 states and 273369 transitions. Second operand 3 states. [2021-01-06 20:22:43,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:22:43,884 INFO L93 Difference]: Finished difference Result 529735 states and 819874 transitions. [2021-01-06 20:22:43,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:22:43,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2021-01-06 20:22:43,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:22:44,858 INFO L225 Difference]: With dead ends: 529735 [2021-01-06 20:22:44,858 INFO L226 Difference]: Without dead ends: 353197 [2021-01-06 20:22:45,061 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:22:45,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353197 states. [2021-01-06 20:23:00,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353197 to 176639. [2021-01-06 20:23:00,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176639 states. [2021-01-06 20:23:00,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176639 states to 176639 states and 273379 transitions. [2021-01-06 20:23:00,783 INFO L78 Accepts]: Start accepts. Automaton has 176639 states and 273379 transitions. Word has length 74 [2021-01-06 20:23:00,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:23:00,784 INFO L481 AbstractCegarLoop]: Abstraction has 176639 states and 273379 transitions. [2021-01-06 20:23:00,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:23:00,784 INFO L276 IsEmpty]: Start isEmpty. Operand 176639 states and 273379 transitions. [2021-01-06 20:23:00,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 20:23:00,799 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:23:00,799 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 20:23:00,799 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 20:23:00,799 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:23:00,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:23:00,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1175997191, now seen corresponding path program 1 times [2021-01-06 20:23:00,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:23:00,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180215772] [2021-01-06 20:23:00,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:23:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:23:00,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:23:00,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180215772] [2021-01-06 20:23:00,895 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:23:00,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 20:23:00,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080415086] [2021-01-06 20:23:00,902 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 20:23:00,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:23:00,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 20:23:00,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 20:23:00,903 INFO L87 Difference]: Start difference. First operand 176639 states and 273379 transitions. Second operand 4 states. [2021-01-06 20:23:28,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:23:28,791 INFO L93 Difference]: Finished difference Result 517835 states and 801320 transitions. [2021-01-06 20:23:28,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 20:23:28,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2021-01-06 20:23:28,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:23:29,760 INFO L225 Difference]: With dead ends: 517835 [2021-01-06 20:23:29,760 INFO L226 Difference]: Without dead ends: 341297 [2021-01-06 20:23:29,932 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:23:30,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341297 states.