/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.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 21:19:54,058 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 21:19:54,062 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 21:19:54,099 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 21:19:54,100 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 21:19:54,102 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 21:19:54,104 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 21:19:54,107 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 21:19:54,109 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 21:19:54,110 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 21:19:54,112 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 21:19:54,113 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 21:19:54,114 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 21:19:54,115 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 21:19:54,116 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 21:19:54,118 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 21:19:54,133 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 21:19:54,140 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 21:19:54,145 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 21:19:54,148 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 21:19:54,151 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 21:19:54,157 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 21:19:54,159 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 21:19:54,160 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 21:19:54,170 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 21:19:54,171 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 21:19:54,171 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 21:19:54,172 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 21:19:54,173 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 21:19:54,178 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 21:19:54,179 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 21:19:54,180 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 21:19:54,181 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 21:19:54,182 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 21:19:54,184 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 21:19:54,185 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 21:19:54,185 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 21:19:54,186 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 21:19:54,186 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 21:19:54,187 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 21:19:54,195 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 21:19:54,196 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:19:54,253 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 21:19:54,253 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 21:19:54,258 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 21:19:54,258 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 21:19:54,258 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 21:19:54,259 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 21:19:54,259 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 21:19:54,262 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 21:19:54,262 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 21:19:54,262 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 21:19:54,263 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 21:19:54,263 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 21:19:54,263 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 21:19:54,263 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 21:19:54,264 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 21:19:54,264 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 21:19:54,264 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 21:19:54,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 21:19:54,264 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 21:19:54,265 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 21:19:54,265 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 21:19:54,265 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 21:19:54,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 21:19:54,265 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 21:19:54,265 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 21:19:54,265 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:19:54,779 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 21:19:54,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 21:19:54,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 21:19:54,816 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 21:19:54,817 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 21:19:54,818 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.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2021-01-06 21:19:54,895 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/20701c530/a637bd7302a24ed5a1a07e37f76ed3a2/FLAG83ed9a3aa [2021-01-06 21:19:55,620 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 21:19:55,621 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2021-01-06 21:19:55,646 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/20701c530/a637bd7302a24ed5a1a07e37f76ed3a2/FLAG83ed9a3aa [2021-01-06 21:19:55,936 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/20701c530/a637bd7302a24ed5a1a07e37f76ed3a2 [2021-01-06 21:19:55,939 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 21:19:55,942 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 21:19:55,945 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 21:19:55,945 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 21:19:55,949 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 21:19:55,950 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 09:19:55" (1/1) ... [2021-01-06 21:19:55,952 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e711de6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:19:55, skipping insertion in model container [2021-01-06 21:19:55,952 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 09:19:55" (1/1) ... [2021-01-06 21:19:55,960 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 21:19:56,004 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_1906~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[~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[~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[~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_2055~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:19:56,249 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.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[7402,7415] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_2162~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] [2021-01-06 21:19:56,295 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 21:19:56,333 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_1906~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[~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[~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[~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_2055~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:19:56,474 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.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[7402,7415] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_2162~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] [2021-01-06 21:19:56,506 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 21:19:56,540 INFO L208 MainTranslator]: Completed translation [2021-01-06 21:19:56,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:19:56 WrapperNode [2021-01-06 21:19:56,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 21:19:56,543 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 21:19:56,544 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 21:19:56,544 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 21:19:56,555 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:19:56" (1/1) ... [2021-01-06 21:19:56,591 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:19:56" (1/1) ... [2021-01-06 21:19:56,649 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 21:19:56,650 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 21:19:56,650 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 21:19:56,650 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 21:19:56,661 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:19:56" (1/1) ... [2021-01-06 21:19:56,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:19:56" (1/1) ... [2021-01-06 21:19:56,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:19:56" (1/1) ... [2021-01-06 21:19:56,665 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:19:56" (1/1) ... [2021-01-06 21:19:56,676 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:19:56" (1/1) ... [2021-01-06 21:19:56,684 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:19:56" (1/1) ... [2021-01-06 21:19:56,688 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:19:56" (1/1) ... [2021-01-06 21:19:56,694 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 21:19:56,695 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 21:19:56,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 21:19:56,726 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 21:19:56,727 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:19:56" (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:19:56,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 21:19:56,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 21:19:56,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 21:19:56,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 21:19:58,127 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 21:19:58,128 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-01-06 21:19:58,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 09:19:58 BoogieIcfgContainer [2021-01-06 21:19:58,132 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 21:19:58,135 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 21:19:58,136 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 21:19:58,140 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 21:19:58,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 09:19:55" (1/3) ... [2021-01-06 21:19:58,143 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e079490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 09:19:58, skipping insertion in model container [2021-01-06 21:19:58,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:19:56" (2/3) ... [2021-01-06 21:19:58,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e079490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 09:19:58, skipping insertion in model container [2021-01-06 21:19:58,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 09:19:58" (3/3) ... [2021-01-06 21:19:58,146 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2021-01-06 21:19:58,154 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 21:19:58,161 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 21:19:58,188 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 21:19:58,241 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 21:19:58,241 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 21:19:58,242 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 21:19:58,242 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 21:19:58,242 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 21:19:58,242 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 21:19:58,242 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 21:19:58,243 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 21:19:58,273 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2021-01-06 21:19:58,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-01-06 21:19:58,291 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:19:58,292 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:19:58,293 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:19:58,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:19:58,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1468963440, now seen corresponding path program 1 times [2021-01-06 21:19:58,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:19:58,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051026428] [2021-01-06 21:19:58,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:19:58,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:19:58,837 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:58,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051026428] [2021-01-06 21:19:58,840 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:19:58,840 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:19:58,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753633307] [2021-01-06 21:19:58,846 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:19:58,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:19:58,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:19:58,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:19:58,865 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 3 states. [2021-01-06 21:19:58,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:19:58,965 INFO L93 Difference]: Finished difference Result 311 states and 527 transitions. [2021-01-06 21:19:58,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:19:58,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2021-01-06 21:19:58,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:19:58,983 INFO L225 Difference]: With dead ends: 311 [2021-01-06 21:19:58,983 INFO L226 Difference]: Without dead ends: 213 [2021-01-06 21:19:58,987 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:19:59,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-01-06 21:19:59,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2021-01-06 21:19:59,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2021-01-06 21:19:59,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 329 transitions. [2021-01-06 21:19:59,077 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 329 transitions. Word has length 62 [2021-01-06 21:19:59,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:19:59,078 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 329 transitions. [2021-01-06 21:19:59,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:19:59,079 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 329 transitions. [2021-01-06 21:19:59,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-01-06 21:19:59,087 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:19:59,088 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:19:59,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 21:19:59,089 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:19:59,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:19:59,092 INFO L82 PathProgramCache]: Analyzing trace with hash -240910223, now seen corresponding path program 1 times [2021-01-06 21:19:59,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:19:59,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435463996] [2021-01-06 21:19:59,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:19:59,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:19:59,304 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:59,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435463996] [2021-01-06 21:19:59,305 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:19:59,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:19:59,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626461877] [2021-01-06 21:19:59,308 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:19:59,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:19:59,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:19:59,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:19:59,309 INFO L87 Difference]: Start difference. First operand 211 states and 329 transitions. Second operand 3 states. [2021-01-06 21:19:59,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:19:59,356 INFO L93 Difference]: Finished difference Result 503 states and 809 transitions. [2021-01-06 21:19:59,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:19:59,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2021-01-06 21:19:59,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:19:59,361 INFO L225 Difference]: With dead ends: 503 [2021-01-06 21:19:59,361 INFO L226 Difference]: Without dead ends: 349 [2021-01-06 21:19:59,363 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:59,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-01-06 21:19:59,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 347. [2021-01-06 21:19:59,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2021-01-06 21:19:59,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 552 transitions. [2021-01-06 21:19:59,400 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 552 transitions. Word has length 64 [2021-01-06 21:19:59,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:19:59,401 INFO L481 AbstractCegarLoop]: Abstraction has 347 states and 552 transitions. [2021-01-06 21:19:59,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:19:59,405 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 552 transitions. [2021-01-06 21:19:59,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 21:19:59,408 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:19:59,412 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:19:59,412 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 21:19:59,412 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:19:59,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:19:59,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1851209774, now seen corresponding path program 1 times [2021-01-06 21:19:59,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:19:59,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524369834] [2021-01-06 21:19:59,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:19:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:19:59,545 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:59,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524369834] [2021-01-06 21:19:59,546 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:19:59,546 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:19:59,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014587346] [2021-01-06 21:19:59,547 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:19:59,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:19:59,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:19:59,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:19:59,549 INFO L87 Difference]: Start difference. First operand 347 states and 552 transitions. Second operand 3 states. [2021-01-06 21:19:59,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:19:59,598 INFO L93 Difference]: Finished difference Result 895 states and 1450 transitions. [2021-01-06 21:19:59,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:19:59,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2021-01-06 21:19:59,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:19:59,603 INFO L225 Difference]: With dead ends: 895 [2021-01-06 21:19:59,603 INFO L226 Difference]: Without dead ends: 605 [2021-01-06 21:19:59,605 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:19:59,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2021-01-06 21:19:59,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 603. [2021-01-06 21:19:59,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2021-01-06 21:19:59,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 968 transitions. [2021-01-06 21:19:59,645 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 968 transitions. Word has length 66 [2021-01-06 21:19:59,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:19:59,646 INFO L481 AbstractCegarLoop]: Abstraction has 603 states and 968 transitions. [2021-01-06 21:19:59,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:19:59,646 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 968 transitions. [2021-01-06 21:19:59,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 21:19:59,648 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:19:59,648 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:19:59,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 21:19:59,649 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:19:59,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:19:59,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1666116403, now seen corresponding path program 1 times [2021-01-06 21:19:59,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:19:59,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659724888] [2021-01-06 21:19:59,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:19:59,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:19:59,867 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:59,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659724888] [2021-01-06 21:19:59,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:19:59,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:19:59,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316720951] [2021-01-06 21:19:59,869 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:19:59,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:19:59,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:19:59,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:19:59,871 INFO L87 Difference]: Start difference. First operand 603 states and 968 transitions. Second operand 5 states. [2021-01-06 21:20:00,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:20:00,207 INFO L93 Difference]: Finished difference Result 3079 states and 5038 transitions. [2021-01-06 21:20:00,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 21:20:00,208 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2021-01-06 21:20:00,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:20:00,233 INFO L225 Difference]: With dead ends: 3079 [2021-01-06 21:20:00,234 INFO L226 Difference]: Without dead ends: 2533 [2021-01-06 21:20:00,236 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:20:00,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2533 states. [2021-01-06 21:20:00,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2533 to 1131. [2021-01-06 21:20:00,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1131 states. [2021-01-06 21:20:00,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1828 transitions. [2021-01-06 21:20:00,320 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1828 transitions. Word has length 68 [2021-01-06 21:20:00,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:20:00,321 INFO L481 AbstractCegarLoop]: Abstraction has 1131 states and 1828 transitions. [2021-01-06 21:20:00,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:20:00,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1828 transitions. [2021-01-06 21:20:00,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-06 21:20:00,323 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:20:00,323 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:20:00,324 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 21:20:00,324 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:20:00,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:20:00,325 INFO L82 PathProgramCache]: Analyzing trace with hash 47496755, now seen corresponding path program 1 times [2021-01-06 21:20:00,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:20:00,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267354159] [2021-01-06 21:20:00,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:20:00,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:20:00,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:20:00,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267354159] [2021-01-06 21:20:00,456 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:20:00,456 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:20:00,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858772697] [2021-01-06 21:20:00,457 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:20:00,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:20:00,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:20:00,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:20:00,460 INFO L87 Difference]: Start difference. First operand 1131 states and 1828 transitions. Second operand 4 states. [2021-01-06 21:20:00,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:20:00,699 INFO L93 Difference]: Finished difference Result 4121 states and 6711 transitions. [2021-01-06 21:20:00,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:20:00,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2021-01-06 21:20:00,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:20:00,721 INFO L225 Difference]: With dead ends: 4121 [2021-01-06 21:20:00,721 INFO L226 Difference]: Without dead ends: 3047 [2021-01-06 21:20:00,724 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:20:00,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3047 states. [2021-01-06 21:20:00,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3047 to 2080. [2021-01-06 21:20:00,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2080 states. [2021-01-06 21:20:00,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2080 states to 2080 states and 3364 transitions. [2021-01-06 21:20:00,906 INFO L78 Accepts]: Start accepts. Automaton has 2080 states and 3364 transitions. Word has length 69 [2021-01-06 21:20:00,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:20:00,907 INFO L481 AbstractCegarLoop]: Abstraction has 2080 states and 3364 transitions. [2021-01-06 21:20:00,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:20:00,908 INFO L276 IsEmpty]: Start isEmpty. Operand 2080 states and 3364 transitions. [2021-01-06 21:20:00,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-06 21:20:00,911 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:20:00,911 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:20:00,912 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 21:20:00,912 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:20:00,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:20:00,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1156873170, now seen corresponding path program 1 times [2021-01-06 21:20:00,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:20:00,913 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268230556] [2021-01-06 21:20:00,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:20:00,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:20:01,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:20:01,011 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268230556] [2021-01-06 21:20:01,012 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:20:01,012 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:20:01,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996322136] [2021-01-06 21:20:01,013 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:20:01,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:20:01,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:20:01,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:20:01,014 INFO L87 Difference]: Start difference. First operand 2080 states and 3364 transitions. Second operand 3 states. [2021-01-06 21:20:01,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:20:01,215 INFO L93 Difference]: Finished difference Result 4970 states and 8089 transitions. [2021-01-06 21:20:01,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:20:01,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2021-01-06 21:20:01,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:20:01,232 INFO L225 Difference]: With dead ends: 4970 [2021-01-06 21:20:01,232 INFO L226 Difference]: Without dead ends: 2947 [2021-01-06 21:20:01,236 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:20:01,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2947 states. [2021-01-06 21:20:01,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2947 to 2945. [2021-01-06 21:20:01,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2945 states. [2021-01-06 21:20:01,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2945 states to 2945 states and 4783 transitions. [2021-01-06 21:20:01,435 INFO L78 Accepts]: Start accepts. Automaton has 2945 states and 4783 transitions. Word has length 70 [2021-01-06 21:20:01,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:20:01,435 INFO L481 AbstractCegarLoop]: Abstraction has 2945 states and 4783 transitions. [2021-01-06 21:20:01,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:20:01,436 INFO L276 IsEmpty]: Start isEmpty. Operand 2945 states and 4783 transitions. [2021-01-06 21:20:01,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-06 21:20:01,437 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:20:01,437 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:20:01,437 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 21:20:01,438 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:20:01,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:20:01,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1843763252, now seen corresponding path program 1 times [2021-01-06 21:20:01,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:20:01,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722240381] [2021-01-06 21:20:01,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:20:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:20:01,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:20:01,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722240381] [2021-01-06 21:20:01,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:20:01,489 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:20:01,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377017182] [2021-01-06 21:20:01,490 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:20:01,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:20:01,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:20:01,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:20:01,491 INFO L87 Difference]: Start difference. First operand 2945 states and 4783 transitions. Second operand 3 states. [2021-01-06 21:20:01,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:20:01,701 INFO L93 Difference]: Finished difference Result 5677 states and 9250 transitions. [2021-01-06 21:20:01,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:20:01,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2021-01-06 21:20:01,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:20:01,725 INFO L225 Difference]: With dead ends: 5677 [2021-01-06 21:20:01,726 INFO L226 Difference]: Without dead ends: 4055 [2021-01-06 21:20:01,730 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:20:01,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4055 states. [2021-01-06 21:20:02,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4055 to 4053. [2021-01-06 21:20:02,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4053 states. [2021-01-06 21:20:02,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4053 states to 4053 states and 6559 transitions. [2021-01-06 21:20:02,019 INFO L78 Accepts]: Start accepts. Automaton has 4053 states and 6559 transitions. Word has length 70 [2021-01-06 21:20:02,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:20:02,019 INFO L481 AbstractCegarLoop]: Abstraction has 4053 states and 6559 transitions. [2021-01-06 21:20:02,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:20:02,020 INFO L276 IsEmpty]: Start isEmpty. Operand 4053 states and 6559 transitions. [2021-01-06 21:20:02,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-06 21:20:02,020 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:20:02,021 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:20:02,021 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 21:20:02,021 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:20:02,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:20:02,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1414453242, now seen corresponding path program 1 times [2021-01-06 21:20:02,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:20:02,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995315969] [2021-01-06 21:20:02,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:20:02,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:20:02,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:20:02,113 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995315969] [2021-01-06 21:20:02,113 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:20:02,113 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:20:02,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756950752] [2021-01-06 21:20:02,114 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:20:02,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:20:02,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:20:02,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:20:02,115 INFO L87 Difference]: Start difference. First operand 4053 states and 6559 transitions. Second operand 4 states. [2021-01-06 21:20:02,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:20:02,697 INFO L93 Difference]: Finished difference Result 13149 states and 21349 transitions. [2021-01-06 21:20:02,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:20:02,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2021-01-06 21:20:02,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:20:02,747 INFO L225 Difference]: With dead ends: 13149 [2021-01-06 21:20:02,748 INFO L226 Difference]: Without dead ends: 9171 [2021-01-06 21:20:02,755 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:20:02,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9171 states. [2021-01-06 21:20:03,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9171 to 6434. [2021-01-06 21:20:03,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6434 states. [2021-01-06 21:20:03,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6434 states to 6434 states and 10368 transitions. [2021-01-06 21:20:03,242 INFO L78 Accepts]: Start accepts. Automaton has 6434 states and 10368 transitions. Word has length 70 [2021-01-06 21:20:03,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:20:03,243 INFO L481 AbstractCegarLoop]: Abstraction has 6434 states and 10368 transitions. [2021-01-06 21:20:03,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:20:03,243 INFO L276 IsEmpty]: Start isEmpty. Operand 6434 states and 10368 transitions. [2021-01-06 21:20:03,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-06 21:20:03,244 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:20:03,244 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:20:03,244 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 21:20:03,244 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:20:03,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:20:03,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1510229994, now seen corresponding path program 1 times [2021-01-06 21:20:03,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:20:03,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883716787] [2021-01-06 21:20:03,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:20:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:20:03,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:20:03,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883716787] [2021-01-06 21:20:03,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:20:03,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:20:03,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489945846] [2021-01-06 21:20:03,299 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:20:03,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:20:03,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:20:03,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:20:03,300 INFO L87 Difference]: Start difference. First operand 6434 states and 10368 transitions. Second operand 3 states. [2021-01-06 21:20:03,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:20:03,866 INFO L93 Difference]: Finished difference Result 12442 states and 20091 transitions. [2021-01-06 21:20:03,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:20:03,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2021-01-06 21:20:03,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:20:03,898 INFO L225 Difference]: With dead ends: 12442 [2021-01-06 21:20:03,898 INFO L226 Difference]: Without dead ends: 8786 [2021-01-06 21:20:03,907 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:20:03,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8786 states. [2021-01-06 21:20:04,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8786 to 8784. [2021-01-06 21:20:04,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8784 states. [2021-01-06 21:20:04,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8784 states to 8784 states and 14070 transitions. [2021-01-06 21:20:04,478 INFO L78 Accepts]: Start accepts. Automaton has 8784 states and 14070 transitions. Word has length 70 [2021-01-06 21:20:04,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:20:04,479 INFO L481 AbstractCegarLoop]: Abstraction has 8784 states and 14070 transitions. [2021-01-06 21:20:04,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:20:04,479 INFO L276 IsEmpty]: Start isEmpty. Operand 8784 states and 14070 transitions. [2021-01-06 21:20:04,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-01-06 21:20:04,480 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:20:04,480 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:20:04,480 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 21:20:04,481 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:20:04,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:20:04,481 INFO L82 PathProgramCache]: Analyzing trace with hash 844989402, now seen corresponding path program 1 times [2021-01-06 21:20:04,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:20:04,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174472074] [2021-01-06 21:20:04,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:20:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:20:04,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:20:04,639 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174472074] [2021-01-06 21:20:04,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:20:04,639 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:20:04,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771719116] [2021-01-06 21:20:04,640 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:20:04,640 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:20:04,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:20:04,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:20:04,641 INFO L87 Difference]: Start difference. First operand 8784 states and 14070 transitions. Second operand 4 states. [2021-01-06 21:20:05,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:20:05,867 INFO L93 Difference]: Finished difference Result 28569 states and 45861 transitions. [2021-01-06 21:20:05,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:20:05,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2021-01-06 21:20:05,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:20:05,931 INFO L225 Difference]: With dead ends: 28569 [2021-01-06 21:20:05,932 INFO L226 Difference]: Without dead ends: 19876 [2021-01-06 21:20:05,954 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:20:05,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19876 states. [2021-01-06 21:20:07,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19876 to 13833. [2021-01-06 21:20:07,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13833 states. [2021-01-06 21:20:07,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13833 states to 13833 states and 22023 transitions. [2021-01-06 21:20:07,071 INFO L78 Accepts]: Start accepts. Automaton has 13833 states and 22023 transitions. Word has length 71 [2021-01-06 21:20:07,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:20:07,072 INFO L481 AbstractCegarLoop]: Abstraction has 13833 states and 22023 transitions. [2021-01-06 21:20:07,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:20:07,072 INFO L276 IsEmpty]: Start isEmpty. Operand 13833 states and 22023 transitions. [2021-01-06 21:20:07,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-06 21:20:07,073 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:20:07,073 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:20:07,073 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 21:20:07,074 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:20:07,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:20:07,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1231314837, now seen corresponding path program 1 times [2021-01-06 21:20:07,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:20:07,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229155589] [2021-01-06 21:20:07,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:20:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:20:07,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:20:07,264 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229155589] [2021-01-06 21:20:07,264 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:20:07,264 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:20:07,264 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582578338] [2021-01-06 21:20:07,265 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:20:07,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:20:07,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:20:07,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:20:07,267 INFO L87 Difference]: Start difference. First operand 13833 states and 22023 transitions. Second operand 4 states. [2021-01-06 21:20:09,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:20:09,123 INFO L93 Difference]: Finished difference Result 40913 states and 65086 transitions. [2021-01-06 21:20:09,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:20:09,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2021-01-06 21:20:09,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:20:09,205 INFO L225 Difference]: With dead ends: 40913 [2021-01-06 21:20:09,205 INFO L226 Difference]: Without dead ends: 27089 [2021-01-06 21:20:09,285 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:20:09,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27089 states. [2021-01-06 21:20:11,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27089 to 27087. [2021-01-06 21:20:11,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27087 states. [2021-01-06 21:20:11,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27087 states to 27087 states and 42872 transitions. [2021-01-06 21:20:11,514 INFO L78 Accepts]: Start accepts. Automaton has 27087 states and 42872 transitions. Word has length 73 [2021-01-06 21:20:11,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:20:11,514 INFO L481 AbstractCegarLoop]: Abstraction has 27087 states and 42872 transitions. [2021-01-06 21:20:11,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:20:11,514 INFO L276 IsEmpty]: Start isEmpty. Operand 27087 states and 42872 transitions. [2021-01-06 21:20:11,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 21:20:11,515 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:20:11,516 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:20:11,516 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 21:20:11,516 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:20:11,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:20:11,517 INFO L82 PathProgramCache]: Analyzing trace with hash -940832745, now seen corresponding path program 1 times [2021-01-06 21:20:11,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:20:11,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42573419] [2021-01-06 21:20:11,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:20:11,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:20:11,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:20:11,678 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42573419] [2021-01-06 21:20:11,678 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:20:11,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:20:11,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383023003] [2021-01-06 21:20:11,679 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:20:11,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:20:11,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:20:11,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:20:11,680 INFO L87 Difference]: Start difference. First operand 27087 states and 42872 transitions. Second operand 3 states. [2021-01-06 21:20:14,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:20:14,161 INFO L93 Difference]: Finished difference Result 81223 states and 128554 transitions. [2021-01-06 21:20:14,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:20:14,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2021-01-06 21:20:14,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:20:14,301 INFO L225 Difference]: With dead ends: 81223 [2021-01-06 21:20:14,302 INFO L226 Difference]: Without dead ends: 54164 [2021-01-06 21:20:14,352 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:20:14,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54164 states. [2021-01-06 21:20:16,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54164 to 27089. [2021-01-06 21:20:16,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27089 states. [2021-01-06 21:20:16,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27089 states to 27089 states and 42874 transitions. [2021-01-06 21:20:16,364 INFO L78 Accepts]: Start accepts. Automaton has 27089 states and 42874 transitions. Word has length 74 [2021-01-06 21:20:16,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:20:16,364 INFO L481 AbstractCegarLoop]: Abstraction has 27089 states and 42874 transitions. [2021-01-06 21:20:16,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:20:16,365 INFO L276 IsEmpty]: Start isEmpty. Operand 27089 states and 42874 transitions. [2021-01-06 21:20:16,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 21:20:16,366 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:20:16,366 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:20:16,366 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 21:20:16,366 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:20:16,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:20:16,367 INFO L82 PathProgramCache]: Analyzing trace with hash 826320946, now seen corresponding path program 1 times [2021-01-06 21:20:16,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:20:16,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746874532] [2021-01-06 21:20:16,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:20:16,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:20:16,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:20:16,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746874532] [2021-01-06 21:20:16,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:20:16,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:20:16,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494238456] [2021-01-06 21:20:16,416 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:20:16,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:20:16,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:20:16,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:20:16,417 INFO L87 Difference]: Start difference. First operand 27089 states and 42874 transitions. Second operand 3 states. [2021-01-06 21:20:18,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:20:18,912 INFO L93 Difference]: Finished difference Result 63195 states and 99826 transitions. [2021-01-06 21:20:18,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:20:18,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2021-01-06 21:20:18,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:20:19,025 INFO L225 Difference]: With dead ends: 63195 [2021-01-06 21:20:19,025 INFO L226 Difference]: Without dead ends: 36235 [2021-01-06 21:20:19,076 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:20:19,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36235 states. [2021-01-06 21:20:21,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36235 to 35323. [2021-01-06 21:20:21,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35323 states. [2021-01-06 21:20:21,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35323 states to 35323 states and 55204 transitions. [2021-01-06 21:20:21,349 INFO L78 Accepts]: Start accepts. Automaton has 35323 states and 55204 transitions. Word has length 74 [2021-01-06 21:20:21,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:20:21,350 INFO L481 AbstractCegarLoop]: Abstraction has 35323 states and 55204 transitions. [2021-01-06 21:20:21,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:20:21,350 INFO L276 IsEmpty]: Start isEmpty. Operand 35323 states and 55204 transitions. [2021-01-06 21:20:21,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 21:20:21,351 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:20:21,351 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:20:21,351 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 21:20:21,351 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:20:21,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:20:21,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1329573307, now seen corresponding path program 1 times [2021-01-06 21:20:21,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:20:21,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846291576] [2021-01-06 21:20:21,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:20:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:20:21,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:20:21,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846291576] [2021-01-06 21:20:21,424 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:20:21,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:20:21,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152724509] [2021-01-06 21:20:21,425 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:20:21,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:20:21,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:20:21,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:20:21,426 INFO L87 Difference]: Start difference. First operand 35323 states and 55204 transitions. Second operand 3 states. [2021-01-06 21:20:25,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:20:25,220 INFO L93 Difference]: Finished difference Result 103330 states and 161322 transitions. [2021-01-06 21:20:25,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:20:25,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2021-01-06 21:20:25,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:20:25,314 INFO L225 Difference]: With dead ends: 103330 [2021-01-06 21:20:25,314 INFO L226 Difference]: Without dead ends: 68180 [2021-01-06 21:20:25,348 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:20:25,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68180 states. [2021-01-06 21:20:29,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68180 to 68178. [2021-01-06 21:20:29,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68178 states. [2021-01-06 21:20:29,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68178 states to 68178 states and 105617 transitions. [2021-01-06 21:20:29,767 INFO L78 Accepts]: Start accepts. Automaton has 68178 states and 105617 transitions. Word has length 75 [2021-01-06 21:20:29,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:20:29,767 INFO L481 AbstractCegarLoop]: Abstraction has 68178 states and 105617 transitions. [2021-01-06 21:20:29,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:20:29,768 INFO L276 IsEmpty]: Start isEmpty. Operand 68178 states and 105617 transitions. [2021-01-06 21:20:29,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 21:20:29,770 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:20:29,770 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:20:29,770 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 21:20:29,770 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:20:29,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:20:29,771 INFO L82 PathProgramCache]: Analyzing trace with hash -121452674, now seen corresponding path program 1 times [2021-01-06 21:20:29,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:20:29,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941442394] [2021-01-06 21:20:29,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:20:29,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:20:29,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:20:29,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941442394] [2021-01-06 21:20:29,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:20:29,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:20:29,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586292513] [2021-01-06 21:20:29,880 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:20:29,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:20:29,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:20:29,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:20:29,881 INFO L87 Difference]: Start difference. First operand 68178 states and 105617 transitions. Second operand 5 states. [2021-01-06 21:20:38,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:20:38,073 INFO L93 Difference]: Finished difference Result 197409 states and 305821 transitions. [2021-01-06 21:20:38,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:20:38,074 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2021-01-06 21:20:38,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:20:38,319 INFO L225 Difference]: With dead ends: 197409 [2021-01-06 21:20:38,320 INFO L226 Difference]: Without dead ends: 129245 [2021-01-06 21:20:38,400 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:20:38,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129245 states. [2021-01-06 21:20:46,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129245 to 129243. [2021-01-06 21:20:46,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129243 states. [2021-01-06 21:20:46,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129243 states to 129243 states and 198894 transitions. [2021-01-06 21:20:46,957 INFO L78 Accepts]: Start accepts. Automaton has 129243 states and 198894 transitions. Word has length 75 [2021-01-06 21:20:46,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:20:46,957 INFO L481 AbstractCegarLoop]: Abstraction has 129243 states and 198894 transitions. [2021-01-06 21:20:46,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:20:46,958 INFO L276 IsEmpty]: Start isEmpty. Operand 129243 states and 198894 transitions. [2021-01-06 21:20:46,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 21:20:46,967 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:20:46,968 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:20:46,968 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 21:20:46,968 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:20:46,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:20:46,982 INFO L82 PathProgramCache]: Analyzing trace with hash 816290506, now seen corresponding path program 1 times [2021-01-06 21:20:46,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:20:46,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028765986] [2021-01-06 21:20:46,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:20:47,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:20:47,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:20:47,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028765986] [2021-01-06 21:20:47,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:20:47,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:20:47,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154086641] [2021-01-06 21:20:47,112 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:20:47,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:20:47,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:20:47,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:20:47,113 INFO L87 Difference]: Start difference. First operand 129243 states and 198894 transitions. Second operand 4 states. [2021-01-06 21:21:03,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:21:03,362 INFO L93 Difference]: Finished difference Result 378534 states and 581681 transitions. [2021-01-06 21:21:03,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:21:03,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2021-01-06 21:21:03,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:21:03,904 INFO L225 Difference]: With dead ends: 378534 [2021-01-06 21:21:03,904 INFO L226 Difference]: Without dead ends: 249347 [2021-01-06 21:21:04,044 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:21:04,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249347 states. [2021-01-06 21:21:20,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249347 to 249345. [2021-01-06 21:21:20,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249345 states. [2021-01-06 21:21:21,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249345 states to 249345 states and 380463 transitions. [2021-01-06 21:21:21,374 INFO L78 Accepts]: Start accepts. Automaton has 249345 states and 380463 transitions. Word has length 75 [2021-01-06 21:21:21,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:21:21,375 INFO L481 AbstractCegarLoop]: Abstraction has 249345 states and 380463 transitions. [2021-01-06 21:21:21,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:21:21,375 INFO L276 IsEmpty]: Start isEmpty. Operand 249345 states and 380463 transitions. [2021-01-06 21:21:21,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 21:21:21,378 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:21:21,378 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:21:21,378 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 21:21:21,378 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:21:21,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:21:21,378 INFO L82 PathProgramCache]: Analyzing trace with hash -353140970, now seen corresponding path program 1 times [2021-01-06 21:21:21,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:21:21,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543379442] [2021-01-06 21:21:21,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:21:21,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:21:21,415 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:21:21,416 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543379442] [2021-01-06 21:21:21,416 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:21:21,416 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:21:21,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845347479] [2021-01-06 21:21:21,416 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:21:21,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:21:21,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:21:21,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:21:21,417 INFO L87 Difference]: Start difference. First operand 249345 states and 380463 transitions. Second operand 3 states.