/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 21:17:29,595 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 21:17:29,599 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 21:17:29,666 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 21:17:29,667 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 21:17:29,668 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 21:17:29,670 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 21:17:29,673 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 21:17:29,676 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 21:17:29,677 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 21:17:29,678 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 21:17:29,680 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 21:17:29,680 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 21:17:29,682 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 21:17:29,683 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 21:17:29,684 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 21:17:29,685 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 21:17:29,686 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 21:17:29,689 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 21:17:29,691 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 21:17:29,693 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 21:17:29,695 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 21:17:29,696 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 21:17:29,697 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 21:17:29,720 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 21:17:29,721 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 21:17:29,721 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 21:17:29,724 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 21:17:29,725 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 21:17:29,726 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 21:17:29,726 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 21:17:29,730 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 21:17:29,731 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 21:17:29,733 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 21:17:29,734 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 21:17:29,735 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 21:17:29,735 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 21:17:29,736 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 21:17:29,736 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 21:17:29,737 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 21:17:29,738 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 21:17:29,743 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 21:17:29,797 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 21:17:29,797 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 21:17:29,802 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 21:17:29,802 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 21:17:29,802 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 21:17:29,802 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 21:17:29,803 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 21:17:29,803 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 21:17:29,803 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 21:17:29,803 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 21:17:29,805 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 21:17:29,805 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 21:17:29,805 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 21:17:29,805 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 21:17:29,805 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 21:17:29,806 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 21:17:29,806 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 21:17:29,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 21:17:29,806 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 21:17:29,806 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 21:17:29,807 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 21:17:29,807 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 21:17:29,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 21:17:29,807 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 21:17:29,807 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 21:17:29,808 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 21:17:30,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 21:17:30,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 21:17:30,306 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 21:17:30,307 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 21:17:30,309 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 21:17:30,310 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2021-01-06 21:17:30,400 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/4c8684b03/015b5e469bc240b5a9e6f9ca8eb600ec/FLAG7b9b26e22 [2021-01-06 21:17:31,172 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 21:17:31,173 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2021-01-06 21:17:31,193 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/4c8684b03/015b5e469bc240b5a9e6f9ca8eb600ec/FLAG7b9b26e22 [2021-01-06 21:17:31,495 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/4c8684b03/015b5e469bc240b5a9e6f9ca8eb600ec [2021-01-06 21:17:31,502 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 21:17:31,506 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 21:17:31,510 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 21:17:31,510 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 21:17:31,515 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 21:17:31,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 09:17:31" (1/1) ... [2021-01-06 21:17:31,519 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f08c8a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:17:31, skipping insertion in model container [2021-01-06 21:17:31,519 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 09:17:31" (1/1) ... [2021-01-06 21:17:31,528 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 21:17:31,604 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~ep12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep31~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep32~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~init__r121~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r131~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r211~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r231~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r311~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r321~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r122~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r132~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r212~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r232~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r312~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r322~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_1921~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~newmax1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~newmax2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~newmax3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_2070~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~0,] [2021-01-06 21:17:31,835 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7348,7361] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] [2021-01-06 21:17:31,882 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 21:17:31,900 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~ep12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep31~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep32~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~init__r121~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r131~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r211~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r231~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r311~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r321~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r122~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r132~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r212~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r232~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r312~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r322~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_1921~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~newmax1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~newmax2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~newmax3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_2070~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~0,] [2021-01-06 21:17:31,970 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7348,7361] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] [2021-01-06 21:17:32,015 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 21:17:32,059 INFO L208 MainTranslator]: Completed translation [2021-01-06 21:17:32,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:17:32 WrapperNode [2021-01-06 21:17:32,059 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 21:17:32,061 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 21:17:32,061 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 21:17:32,061 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 21:17:32,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:17:32" (1/1) ... [2021-01-06 21:17:32,082 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:17:32" (1/1) ... [2021-01-06 21:17:32,140 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 21:17:32,143 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 21:17:32,143 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 21:17:32,145 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 21:17:32,164 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:17:32" (1/1) ... [2021-01-06 21:17:32,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:17:32" (1/1) ... [2021-01-06 21:17:32,169 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:17:32" (1/1) ... [2021-01-06 21:17:32,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:17:32" (1/1) ... [2021-01-06 21:17:32,181 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:17:32" (1/1) ... [2021-01-06 21:17:32,189 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:17:32" (1/1) ... [2021-01-06 21:17:32,193 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:17:32" (1/1) ... [2021-01-06 21:17:32,199 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 21:17:32,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 21:17:32,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 21:17:32,201 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 21:17:32,202 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:17:32" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 21:17:32,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 21:17:32,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 21:17:32,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 21:17:32,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 21:17:33,433 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 21:17:33,434 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-01-06 21:17:33,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 09:17:33 BoogieIcfgContainer [2021-01-06 21:17:33,436 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 21:17:33,438 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 21:17:33,438 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 21:17:33,442 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 21:17:33,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 09:17:31" (1/3) ... [2021-01-06 21:17:33,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b597565 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 09:17:33, skipping insertion in model container [2021-01-06 21:17:33,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:17:32" (2/3) ... [2021-01-06 21:17:33,444 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b597565 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 09:17:33, skipping insertion in model container [2021-01-06 21:17:33,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 09:17:33" (3/3) ... [2021-01-06 21:17:33,446 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2021-01-06 21:17:33,452 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 21:17:33,458 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 21:17:33,479 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 21:17:33,512 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 21:17:33,512 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 21:17:33,512 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 21:17:33,512 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 21:17:33,512 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 21:17:33,513 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 21:17:33,513 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 21:17:33,513 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 21:17:33,533 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2021-01-06 21:17:33,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-01-06 21:17:33,544 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:17:33,545 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] [2021-01-06 21:17:33,546 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:17:33,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:17:33,553 INFO L82 PathProgramCache]: Analyzing trace with hash -970283638, now seen corresponding path program 1 times [2021-01-06 21:17:33,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:17:33,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005554204] [2021-01-06 21:17:33,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:17:33,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:17:34,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:17:34,000 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005554204] [2021-01-06 21:17:34,001 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:17:34,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:17:34,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858069978] [2021-01-06 21:17:34,017 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:17:34,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:17:34,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:17:34,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:17:34,045 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 3 states. [2021-01-06 21:17:34,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:17:34,248 INFO L93 Difference]: Finished difference Result 335 states and 559 transitions. [2021-01-06 21:17:34,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:17:34,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2021-01-06 21:17:34,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:17:34,288 INFO L225 Difference]: With dead ends: 335 [2021-01-06 21:17:34,288 INFO L226 Difference]: Without dead ends: 231 [2021-01-06 21:17:34,293 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:17:34,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-01-06 21:17:34,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 228. [2021-01-06 21:17:34,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2021-01-06 21:17:34,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 359 transitions. [2021-01-06 21:17:34,397 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 359 transitions. Word has length 56 [2021-01-06 21:17:34,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:17:34,398 INFO L481 AbstractCegarLoop]: Abstraction has 228 states and 359 transitions. [2021-01-06 21:17:34,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:17:34,398 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 359 transitions. [2021-01-06 21:17:34,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-01-06 21:17:34,402 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:17:34,402 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:17:34,402 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 21:17:34,404 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:17:34,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:17:34,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1615417163, now seen corresponding path program 1 times [2021-01-06 21:17:34,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:17:34,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81671107] [2021-01-06 21:17:34,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:17:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:17:34,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:17:34,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81671107] [2021-01-06 21:17:34,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:17:34,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:17:34,558 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429498120] [2021-01-06 21:17:34,561 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:17:34,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:17:34,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:17:34,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:17:34,563 INFO L87 Difference]: Start difference. First operand 228 states and 359 transitions. Second operand 3 states. [2021-01-06 21:17:34,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:17:34,628 INFO L93 Difference]: Finished difference Result 566 states and 911 transitions. [2021-01-06 21:17:34,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:17:34,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2021-01-06 21:17:34,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:17:34,633 INFO L225 Difference]: With dead ends: 566 [2021-01-06 21:17:34,633 INFO L226 Difference]: Without dead ends: 389 [2021-01-06 21:17:34,636 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:17:34,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2021-01-06 21:17:34,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 385. [2021-01-06 21:17:34,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2021-01-06 21:17:34,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 614 transitions. [2021-01-06 21:17:34,684 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 614 transitions. Word has length 58 [2021-01-06 21:17:34,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:17:34,687 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 614 transitions. [2021-01-06 21:17:34,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:17:34,687 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 614 transitions. [2021-01-06 21:17:34,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-01-06 21:17:34,693 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:17:34,693 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:17:34,693 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 21:17:34,693 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:17:34,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:17:34,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1881805132, now seen corresponding path program 1 times [2021-01-06 21:17:34,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:17:34,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473238515] [2021-01-06 21:17:34,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:17:34,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:17:34,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:17:34,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473238515] [2021-01-06 21:17:34,929 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:17:34,929 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:17:34,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505070439] [2021-01-06 21:17:34,932 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:17:34,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:17:34,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:17:34,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:17:34,936 INFO L87 Difference]: Start difference. First operand 385 states and 614 transitions. Second operand 3 states. [2021-01-06 21:17:35,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:17:35,016 INFO L93 Difference]: Finished difference Result 1021 states and 1648 transitions. [2021-01-06 21:17:35,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:17:35,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2021-01-06 21:17:35,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:17:35,022 INFO L225 Difference]: With dead ends: 1021 [2021-01-06 21:17:35,022 INFO L226 Difference]: Without dead ends: 687 [2021-01-06 21:17:35,025 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:17:35,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2021-01-06 21:17:35,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 681. [2021-01-06 21:17:35,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2021-01-06 21:17:35,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 1090 transitions. [2021-01-06 21:17:35,118 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 1090 transitions. Word has length 60 [2021-01-06 21:17:35,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:17:35,118 INFO L481 AbstractCegarLoop]: Abstraction has 681 states and 1090 transitions. [2021-01-06 21:17:35,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:17:35,119 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 1090 transitions. [2021-01-06 21:17:35,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-01-06 21:17:35,124 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:17:35,124 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:17:35,125 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 21:17:35,125 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:17:35,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:17:35,126 INFO L82 PathProgramCache]: Analyzing trace with hash 333047117, now seen corresponding path program 1 times [2021-01-06 21:17:35,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:17:35,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362719689] [2021-01-06 21:17:35,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:17:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:17:35,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:17:35,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362719689] [2021-01-06 21:17:35,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:17:35,323 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:17:35,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112575881] [2021-01-06 21:17:35,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:17:35,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:17:35,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:17:35,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:17:35,325 INFO L87 Difference]: Start difference. First operand 681 states and 1090 transitions. Second operand 5 states. [2021-01-06 21:17:35,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:17:35,625 INFO L93 Difference]: Finished difference Result 2973 states and 4848 transitions. [2021-01-06 21:17:35,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 21:17:35,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2021-01-06 21:17:35,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:17:35,641 INFO L225 Difference]: With dead ends: 2973 [2021-01-06 21:17:35,642 INFO L226 Difference]: Without dead ends: 2343 [2021-01-06 21:17:35,645 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-06 21:17:35,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2021-01-06 21:17:35,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 1233. [2021-01-06 21:17:35,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1233 states. [2021-01-06 21:17:35,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1985 transitions. [2021-01-06 21:17:35,746 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1985 transitions. Word has length 62 [2021-01-06 21:17:35,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:17:35,747 INFO L481 AbstractCegarLoop]: Abstraction has 1233 states and 1985 transitions. [2021-01-06 21:17:35,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:17:35,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1985 transitions. [2021-01-06 21:17:35,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-06 21:17:35,749 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:17:35,749 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 21:17:35,749 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 21:17:35,750 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:17:35,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:17:35,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1672021844, now seen corresponding path program 1 times [2021-01-06 21:17:35,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:17:35,751 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083093197] [2021-01-06 21:17:35,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:17:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:17:35,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:17:35,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083093197] [2021-01-06 21:17:35,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:17:35,851 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:17:35,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683512077] [2021-01-06 21:17:35,852 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:17:35,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:17:35,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:17:35,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:17:35,853 INFO L87 Difference]: Start difference. First operand 1233 states and 1985 transitions. Second operand 4 states. [2021-01-06 21:17:36,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:17:36,072 INFO L93 Difference]: Finished difference Result 3613 states and 5881 transitions. [2021-01-06 21:17:36,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:17:36,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2021-01-06 21:17:36,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:17:36,088 INFO L225 Difference]: With dead ends: 3613 [2021-01-06 21:17:36,088 INFO L226 Difference]: Without dead ends: 2431 [2021-01-06 21:17:36,118 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:17:36,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2431 states. [2021-01-06 21:17:36,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2431 to 1823. [2021-01-06 21:17:36,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1823 states. [2021-01-06 21:17:36,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1823 states to 1823 states and 2946 transitions. [2021-01-06 21:17:36,256 INFO L78 Accepts]: Start accepts. Automaton has 1823 states and 2946 transitions. Word has length 63 [2021-01-06 21:17:36,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:17:36,256 INFO L481 AbstractCegarLoop]: Abstraction has 1823 states and 2946 transitions. [2021-01-06 21:17:36,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:17:36,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1823 states and 2946 transitions. [2021-01-06 21:17:36,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-01-06 21:17:36,259 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:17:36,259 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:17:36,259 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 21:17:36,259 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:17:36,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:17:36,260 INFO L82 PathProgramCache]: Analyzing trace with hash 235123444, now seen corresponding path program 1 times [2021-01-06 21:17:36,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:17:36,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532566871] [2021-01-06 21:17:36,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:17:36,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:17:36,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:17:36,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532566871] [2021-01-06 21:17:36,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:17:36,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:17:36,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086953378] [2021-01-06 21:17:36,355 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:17:36,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:17:36,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:17:36,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:17:36,357 INFO L87 Difference]: Start difference. First operand 1823 states and 2946 transitions. Second operand 4 states. [2021-01-06 21:17:36,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:17:36,685 INFO L93 Difference]: Finished difference Result 5459 states and 8871 transitions. [2021-01-06 21:17:36,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:17:36,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2021-01-06 21:17:36,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:17:36,706 INFO L225 Difference]: With dead ends: 5459 [2021-01-06 21:17:36,707 INFO L226 Difference]: Without dead ends: 3687 [2021-01-06 21:17:36,713 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 21:17:36,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3687 states. [2021-01-06 21:17:36,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3687 to 2667. [2021-01-06 21:17:36,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2667 states. [2021-01-06 21:17:36,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2667 states to 2667 states and 4306 transitions. [2021-01-06 21:17:36,928 INFO L78 Accepts]: Start accepts. Automaton has 2667 states and 4306 transitions. Word has length 64 [2021-01-06 21:17:36,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:17:36,928 INFO L481 AbstractCegarLoop]: Abstraction has 2667 states and 4306 transitions. [2021-01-06 21:17:36,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:17:36,928 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 4306 transitions. [2021-01-06 21:17:36,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-06 21:17:36,932 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:17:36,932 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 21:17:36,932 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 21:17:36,933 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:17:36,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:17:36,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1354495973, now seen corresponding path program 1 times [2021-01-06 21:17:36,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:17:36,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625551716] [2021-01-06 21:17:36,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:17:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:17:37,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:17:37,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625551716] [2021-01-06 21:17:37,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:17:37,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:17:37,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036213542] [2021-01-06 21:17:37,068 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:17:37,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:17:37,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:17:37,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:17:37,070 INFO L87 Difference]: Start difference. First operand 2667 states and 4306 transitions. Second operand 4 states. [2021-01-06 21:17:37,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:17:37,540 INFO L93 Difference]: Finished difference Result 8027 states and 13019 transitions. [2021-01-06 21:17:37,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:17:37,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2021-01-06 21:17:37,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:17:37,573 INFO L225 Difference]: With dead ends: 8027 [2021-01-06 21:17:37,573 INFO L226 Difference]: Without dead ends: 5411 [2021-01-06 21:17:37,580 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 21:17:37,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5411 states. [2021-01-06 21:17:37,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5411 to 3863. [2021-01-06 21:17:37,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3863 states. [2021-01-06 21:17:37,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3863 states to 3863 states and 6228 transitions. [2021-01-06 21:17:37,943 INFO L78 Accepts]: Start accepts. Automaton has 3863 states and 6228 transitions. Word has length 65 [2021-01-06 21:17:37,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:17:37,943 INFO L481 AbstractCegarLoop]: Abstraction has 3863 states and 6228 transitions. [2021-01-06 21:17:37,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:17:37,944 INFO L276 IsEmpty]: Start isEmpty. Operand 3863 states and 6228 transitions. [2021-01-06 21:17:37,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 21:17:37,947 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:17:37,947 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:17:37,947 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 21:17:37,947 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:17:37,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:17:37,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1658042238, now seen corresponding path program 1 times [2021-01-06 21:17:37,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:17:37,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672833109] [2021-01-06 21:17:37,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:17:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:17:38,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:17:38,007 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672833109] [2021-01-06 21:17:38,007 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:17:38,007 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:17:38,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988611968] [2021-01-06 21:17:38,008 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:17:38,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:17:38,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:17:38,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:17:38,009 INFO L87 Difference]: Start difference. First operand 3863 states and 6228 transitions. Second operand 3 states. [2021-01-06 21:17:38,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:17:38,420 INFO L93 Difference]: Finished difference Result 8640 states and 14034 transitions. [2021-01-06 21:17:38,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:17:38,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2021-01-06 21:17:38,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:17:38,455 INFO L225 Difference]: With dead ends: 8640 [2021-01-06 21:17:38,455 INFO L226 Difference]: Without dead ends: 5875 [2021-01-06 21:17:38,461 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:17:38,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5875 states. [2021-01-06 21:17:38,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5875 to 5873. [2021-01-06 21:17:38,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5873 states. [2021-01-06 21:17:38,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5873 states to 5873 states and 9472 transitions. [2021-01-06 21:17:38,928 INFO L78 Accepts]: Start accepts. Automaton has 5873 states and 9472 transitions. Word has length 66 [2021-01-06 21:17:38,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:17:38,929 INFO L481 AbstractCegarLoop]: Abstraction has 5873 states and 9472 transitions. [2021-01-06 21:17:38,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:17:38,929 INFO L276 IsEmpty]: Start isEmpty. Operand 5873 states and 9472 transitions. [2021-01-06 21:17:38,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 21:17:38,930 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:17:38,930 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:17:38,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 21:17:38,931 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:17:38,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:17:38,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1876407130, now seen corresponding path program 1 times [2021-01-06 21:17:38,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:17:38,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190360718] [2021-01-06 21:17:38,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:17:38,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:17:38,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:17:39,003 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190360718] [2021-01-06 21:17:39,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:17:39,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:17:39,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255938304] [2021-01-06 21:17:39,004 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:17:39,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:17:39,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:17:39,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:17:39,009 INFO L87 Difference]: Start difference. First operand 5873 states and 9472 transitions. Second operand 3 states. [2021-01-06 21:17:39,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:17:39,583 INFO L93 Difference]: Finished difference Result 12987 states and 20989 transitions. [2021-01-06 21:17:39,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:17:39,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2021-01-06 21:17:39,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:17:39,621 INFO L225 Difference]: With dead ends: 12987 [2021-01-06 21:17:39,621 INFO L226 Difference]: Without dead ends: 8817 [2021-01-06 21:17:39,629 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:17:39,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8817 states. [2021-01-06 21:17:40,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8817 to 8815. [2021-01-06 21:17:40,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8815 states. [2021-01-06 21:17:40,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8815 states to 8815 states and 14152 transitions. [2021-01-06 21:17:40,260 INFO L78 Accepts]: Start accepts. Automaton has 8815 states and 14152 transitions. Word has length 66 [2021-01-06 21:17:40,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:17:40,260 INFO L481 AbstractCegarLoop]: Abstraction has 8815 states and 14152 transitions. [2021-01-06 21:17:40,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:17:40,261 INFO L276 IsEmpty]: Start isEmpty. Operand 8815 states and 14152 transitions. [2021-01-06 21:17:40,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 21:17:40,262 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:17:40,262 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:17:40,262 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 21:17:40,263 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:17:40,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:17:40,263 INFO L82 PathProgramCache]: Analyzing trace with hash -430026452, now seen corresponding path program 1 times [2021-01-06 21:17:40,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:17:40,264 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933805084] [2021-01-06 21:17:40,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:17:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:17:40,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:17:40,321 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933805084] [2021-01-06 21:17:40,321 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:17:40,321 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:17:40,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583239127] [2021-01-06 21:17:40,322 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:17:40,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:17:40,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:17:40,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:17:40,326 INFO L87 Difference]: Start difference. First operand 8815 states and 14152 transitions. Second operand 3 states. [2021-01-06 21:17:41,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:17:41,089 INFO L93 Difference]: Finished difference Result 19164 states and 30838 transitions. [2021-01-06 21:17:41,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:17:41,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2021-01-06 21:17:41,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:17:41,132 INFO L225 Difference]: With dead ends: 19164 [2021-01-06 21:17:41,132 INFO L226 Difference]: Without dead ends: 12900 [2021-01-06 21:17:41,145 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:17:41,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12900 states. [2021-01-06 21:17:42,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12900 to 12898. [2021-01-06 21:17:42,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12898 states. [2021-01-06 21:17:42,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12898 states to 12898 states and 20599 transitions. [2021-01-06 21:17:42,047 INFO L78 Accepts]: Start accepts. Automaton has 12898 states and 20599 transitions. Word has length 66 [2021-01-06 21:17:42,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:17:42,047 INFO L481 AbstractCegarLoop]: Abstraction has 12898 states and 20599 transitions. [2021-01-06 21:17:42,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:17:42,052 INFO L276 IsEmpty]: Start isEmpty. Operand 12898 states and 20599 transitions. [2021-01-06 21:17:42,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-01-06 21:17:42,053 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:17:42,053 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:17:42,054 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 21:17:42,054 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:17:42,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:17:42,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1812850740, now seen corresponding path program 1 times [2021-01-06 21:17:42,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:17:42,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302891673] [2021-01-06 21:17:42,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:17:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:17:42,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:17:42,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302891673] [2021-01-06 21:17:42,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:17:42,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:17:42,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71028830] [2021-01-06 21:17:42,210 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:17:42,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:17:42,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:17:42,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:17:42,213 INFO L87 Difference]: Start difference. First operand 12898 states and 20599 transitions. Second operand 4 states. [2021-01-06 21:17:43,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:17:43,993 INFO L93 Difference]: Finished difference Result 37923 states and 60526 transitions. [2021-01-06 21:17:43,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:17:43,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2021-01-06 21:17:43,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:17:44,074 INFO L225 Difference]: With dead ends: 37923 [2021-01-06 21:17:44,074 INFO L226 Difference]: Without dead ends: 25034 [2021-01-06 21:17:44,101 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:17:44,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25034 states. [2021-01-06 21:17:45,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25034 to 25032. [2021-01-06 21:17:45,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25032 states. [2021-01-06 21:17:45,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25032 states to 25032 states and 39715 transitions. [2021-01-06 21:17:45,717 INFO L78 Accepts]: Start accepts. Automaton has 25032 states and 39715 transitions. Word has length 67 [2021-01-06 21:17:45,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:17:45,718 INFO L481 AbstractCegarLoop]: Abstraction has 25032 states and 39715 transitions. [2021-01-06 21:17:45,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:17:45,718 INFO L276 IsEmpty]: Start isEmpty. Operand 25032 states and 39715 transitions. [2021-01-06 21:17:45,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 21:17:45,719 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:17:45,719 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:17:45,720 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 21:17:45,720 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:17:45,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:17:45,721 INFO L82 PathProgramCache]: Analyzing trace with hash 457678524, now seen corresponding path program 1 times [2021-01-06 21:17:45,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:17:45,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988862964] [2021-01-06 21:17:45,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:17:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:17:45,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:17:45,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988862964] [2021-01-06 21:17:45,779 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:17:45,779 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:17:45,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98746981] [2021-01-06 21:17:45,780 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:17:45,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:17:45,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:17:45,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:17:45,781 INFO L87 Difference]: Start difference. First operand 25032 states and 39715 transitions. Second operand 3 states. [2021-01-06 21:17:47,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:17:47,558 INFO L93 Difference]: Finished difference Result 60515 states and 96528 transitions. [2021-01-06 21:17:47,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:17:47,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2021-01-06 21:17:47,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:17:47,667 INFO L225 Difference]: With dead ends: 60515 [2021-01-06 21:17:47,667 INFO L226 Difference]: Without dead ends: 35598 [2021-01-06 21:17:47,702 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:17:47,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35598 states. [2021-01-06 21:17:49,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35598 to 34322. [2021-01-06 21:17:49,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34322 states. [2021-01-06 21:17:49,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34322 states to 34322 states and 54382 transitions. [2021-01-06 21:17:49,641 INFO L78 Accepts]: Start accepts. Automaton has 34322 states and 54382 transitions. Word has length 68 [2021-01-06 21:17:49,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:17:49,642 INFO L481 AbstractCegarLoop]: Abstraction has 34322 states and 54382 transitions. [2021-01-06 21:17:49,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:17:49,642 INFO L276 IsEmpty]: Start isEmpty. Operand 34322 states and 54382 transitions. [2021-01-06 21:17:49,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 21:17:49,643 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:17:49,643 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:17:49,643 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 21:17:49,643 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:17:49,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:17:49,644 INFO L82 PathProgramCache]: Analyzing trace with hash 230797016, now seen corresponding path program 1 times [2021-01-06 21:17:49,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:17:49,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38002985] [2021-01-06 21:17:49,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:17:49,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:17:49,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:17:49,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38002985] [2021-01-06 21:17:49,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:17:49,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:17:49,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014239392] [2021-01-06 21:17:49,689 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:17:49,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:17:49,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:17:49,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:17:49,691 INFO L87 Difference]: Start difference. First operand 34322 states and 54382 transitions. Second operand 3 states. [2021-01-06 21:17:53,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:17:53,344 INFO L93 Difference]: Finished difference Result 102928 states and 163084 transitions. [2021-01-06 21:17:53,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:17:53,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2021-01-06 21:17:53,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:17:53,537 INFO L225 Difference]: With dead ends: 102928 [2021-01-06 21:17:53,537 INFO L226 Difference]: Without dead ends: 68634 [2021-01-06 21:17:53,604 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:17:53,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68634 states. [2021-01-06 21:17:56,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68634 to 34324. [2021-01-06 21:17:56,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34324 states. [2021-01-06 21:17:56,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34324 states to 34324 states and 54384 transitions. [2021-01-06 21:17:56,274 INFO L78 Accepts]: Start accepts. Automaton has 34324 states and 54384 transitions. Word has length 68 [2021-01-06 21:17:56,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:17:56,275 INFO L481 AbstractCegarLoop]: Abstraction has 34324 states and 54384 transitions. [2021-01-06 21:17:56,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:17:56,275 INFO L276 IsEmpty]: Start isEmpty. Operand 34324 states and 54384 transitions. [2021-01-06 21:17:56,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-06 21:17:56,276 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:17:56,276 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:17:56,277 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 21:17:56,277 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:17:56,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:17:56,277 INFO L82 PathProgramCache]: Analyzing trace with hash -986650261, now seen corresponding path program 1 times [2021-01-06 21:17:56,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:17:56,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638832] [2021-01-06 21:17:56,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:17:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:17:56,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:17:56,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638832] [2021-01-06 21:17:56,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:17:56,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:17:56,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124084061] [2021-01-06 21:17:56,378 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:17:56,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:17:56,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:17:56,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:17:56,379 INFO L87 Difference]: Start difference. First operand 34324 states and 54384 transitions. Second operand 4 states. [2021-01-06 21:18:00,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:18:00,525 INFO L93 Difference]: Finished difference Result 100866 states and 159708 transitions. [2021-01-06 21:18:00,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:18:00,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2021-01-06 21:18:00,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:18:00,683 INFO L225 Difference]: With dead ends: 100866 [2021-01-06 21:18:00,683 INFO L226 Difference]: Without dead ends: 66572 [2021-01-06 21:18:00,734 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:18:00,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66572 states. [2021-01-06 21:18:05,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66572 to 66570. [2021-01-06 21:18:05,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66570 states. [2021-01-06 21:18:05,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66570 states to 66570 states and 104812 transitions. [2021-01-06 21:18:05,194 INFO L78 Accepts]: Start accepts. Automaton has 66570 states and 104812 transitions. Word has length 69 [2021-01-06 21:18:05,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:18:05,195 INFO L481 AbstractCegarLoop]: Abstraction has 66570 states and 104812 transitions. [2021-01-06 21:18:05,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:18:05,195 INFO L276 IsEmpty]: Start isEmpty. Operand 66570 states and 104812 transitions. [2021-01-06 21:18:05,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-06 21:18:05,196 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:18:05,196 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:18:05,197 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 21:18:05,197 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:18:05,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:18:05,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1835064599, now seen corresponding path program 1 times [2021-01-06 21:18:05,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:18:05,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991128639] [2021-01-06 21:18:05,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:18:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:18:05,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:18:05,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991128639] [2021-01-06 21:18:05,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:18:05,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:18:05,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011478888] [2021-01-06 21:18:05,232 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:18:05,232 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:18:05,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:18:05,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:18:05,233 INFO L87 Difference]: Start difference. First operand 66570 states and 104812 transitions. Second operand 3 states. [2021-01-06 21:18:13,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:18:13,263 INFO L93 Difference]: Finished difference Result 199634 states and 314316 transitions. [2021-01-06 21:18:13,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:18:13,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2021-01-06 21:18:13,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:18:13,518 INFO L225 Difference]: With dead ends: 199634 [2021-01-06 21:18:13,518 INFO L226 Difference]: Without dead ends: 133108 [2021-01-06 21:18:13,598 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:18:13,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133108 states. [2021-01-06 21:18:18,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133108 to 66574. [2021-01-06 21:18:18,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66574 states. [2021-01-06 21:18:18,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66574 states to 66574 states and 104816 transitions. [2021-01-06 21:18:18,830 INFO L78 Accepts]: Start accepts. Automaton has 66574 states and 104816 transitions. Word has length 70 [2021-01-06 21:18:18,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:18:18,830 INFO L481 AbstractCegarLoop]: Abstraction has 66574 states and 104816 transitions. [2021-01-06 21:18:18,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:18:18,830 INFO L276 IsEmpty]: Start isEmpty. Operand 66574 states and 104816 transitions. [2021-01-06 21:18:18,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-06 21:18:18,832 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:18:18,832 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:18:18,832 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 21:18:18,832 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:18:18,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:18:18,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1009269311, now seen corresponding path program 1 times [2021-01-06 21:18:18,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:18:18,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76923150] [2021-01-06 21:18:18,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:18:18,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:18:18,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:18:18,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76923150] [2021-01-06 21:18:18,894 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:18:18,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:18:18,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936245851] [2021-01-06 21:18:18,895 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:18:18,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:18:18,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:18:18,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:18:18,896 INFO L87 Difference]: Start difference. First operand 66574 states and 104816 transitions. Second operand 3 states. [2021-01-06 21:18:25,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:18:25,263 INFO L93 Difference]: Finished difference Result 160570 states and 253694 transitions. [2021-01-06 21:18:25,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:18:25,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2021-01-06 21:18:25,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:18:25,409 INFO L225 Difference]: With dead ends: 160570 [2021-01-06 21:18:25,409 INFO L226 Difference]: Without dead ends: 94264 [2021-01-06 21:18:25,469 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:18:25,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94264 states. [2021-01-06 21:18:31,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94264 to 90934. [2021-01-06 21:18:31,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90934 states. [2021-01-06 21:18:31,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90934 states to 90934 states and 142722 transitions. [2021-01-06 21:18:31,815 INFO L78 Accepts]: Start accepts. Automaton has 90934 states and 142722 transitions. Word has length 70 [2021-01-06 21:18:31,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:18:31,816 INFO L481 AbstractCegarLoop]: Abstraction has 90934 states and 142722 transitions. [2021-01-06 21:18:31,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:18:31,816 INFO L276 IsEmpty]: Start isEmpty. Operand 90934 states and 142722 transitions. [2021-01-06 21:18:31,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-01-06 21:18:31,817 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:18:31,817 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:18:31,817 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 21:18:31,818 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:18:31,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:18:31,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1513559690, now seen corresponding path program 1 times [2021-01-06 21:18:31,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:18:31,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120696071] [2021-01-06 21:18:31,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:18:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:18:31,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:18:31,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120696071] [2021-01-06 21:18:31,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:18:31,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:18:31,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620500907] [2021-01-06 21:18:31,943 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:18:31,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:18:31,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:18:31,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:18:31,944 INFO L87 Difference]: Start difference. First operand 90934 states and 142722 transitions. Second operand 4 states. [2021-01-06 21:18:43,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:18:43,515 INFO L93 Difference]: Finished difference Result 266958 states and 418618 transitions. [2021-01-06 21:18:43,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:18:43,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2021-01-06 21:18:43,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:18:43,847 INFO L225 Difference]: With dead ends: 266958 [2021-01-06 21:18:43,848 INFO L226 Difference]: Without dead ends: 176072 [2021-01-06 21:18:43,943 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:18:44,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176072 states. [2021-01-06 21:18:56,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176072 to 176070. [2021-01-06 21:18:56,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176070 states. [2021-01-06 21:18:56,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176070 states to 176070 states and 274400 transitions. [2021-01-06 21:18:56,743 INFO L78 Accepts]: Start accepts. Automaton has 176070 states and 274400 transitions. Word has length 71 [2021-01-06 21:18:56,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:18:56,743 INFO L481 AbstractCegarLoop]: Abstraction has 176070 states and 274400 transitions. [2021-01-06 21:18:56,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:18:56,743 INFO L276 IsEmpty]: Start isEmpty. Operand 176070 states and 274400 transitions. [2021-01-06 21:18:56,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 21:18:56,745 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:18:56,746 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:18:56,746 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 21:18:56,746 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:18:56,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:18:56,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1184861910, now seen corresponding path program 1 times [2021-01-06 21:18:56,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:18:56,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83274939] [2021-01-06 21:18:56,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:18:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:18:56,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:18:56,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83274939] [2021-01-06 21:18:56,779 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:18:56,779 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:18:56,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039291374] [2021-01-06 21:18:56,781 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:18:56,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:18:56,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:18:56,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:18:56,782 INFO L87 Difference]: Start difference. First operand 176070 states and 274400 transitions. Second operand 3 states. [2021-01-06 21:19:20,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:19:20,374 INFO L93 Difference]: Finished difference Result 527798 states and 822654 transitions. [2021-01-06 21:19:20,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:19:20,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-01-06 21:19:20,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:19:21,259 INFO L225 Difference]: With dead ends: 527798 [2021-01-06 21:19:21,259 INFO L226 Difference]: Without dead ends: 352048 [2021-01-06 21:19:21,442 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:19:21,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352048 states. [2021-01-06 21:19:35,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352048 to 176078. [2021-01-06 21:19:35,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176078 states. [2021-01-06 21:19:36,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176078 states to 176078 states and 274408 transitions. [2021-01-06 21:19:36,107 INFO L78 Accepts]: Start accepts. Automaton has 176078 states and 274408 transitions. Word has length 72 [2021-01-06 21:19:36,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:19:36,107 INFO L481 AbstractCegarLoop]: Abstraction has 176078 states and 274408 transitions. [2021-01-06 21:19:36,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:19:36,107 INFO L276 IsEmpty]: Start isEmpty. Operand 176078 states and 274408 transitions. [2021-01-06 21:19:36,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 21:19:36,109 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:19:36,109 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:19:36,109 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 21:19:36,109 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:19:36,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:19:36,110 INFO L82 PathProgramCache]: Analyzing trace with hash -2001628748, now seen corresponding path program 1 times [2021-01-06 21:19:36,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:19:36,110 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346594187] [2021-01-06 21:19:36,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:19:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:19:36,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:19:36,166 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346594187] [2021-01-06 21:19:36,166 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:19:36,166 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:19:36,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184899805] [2021-01-06 21:19:36,167 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:19:36,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:19:36,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:19:36,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:19:36,168 INFO L87 Difference]: Start difference. First operand 176078 states and 274408 transitions. Second operand 3 states. [2021-01-06 21:19:54,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:19:54,961 INFO L93 Difference]: Finished difference Result 425402 states and 666050 transitions. [2021-01-06 21:19:54,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:19:54,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-01-06 21:19:54,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:19:55,701 INFO L225 Difference]: With dead ends: 425402 [2021-01-06 21:19:55,702 INFO L226 Difference]: Without dead ends: 249872 [2021-01-06 21:19:55,861 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:19:56,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249872 states.