/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 20:19:20,194 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 20:19:20,198 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 20:19:20,237 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 20:19:20,237 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 20:19:20,239 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 20:19:20,241 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 20:19:20,244 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 20:19:20,247 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 20:19:20,249 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 20:19:20,250 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 20:19:20,251 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 20:19:20,252 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 20:19:20,254 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 20:19:20,255 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 20:19:20,257 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 20:19:20,258 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 20:19:20,259 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 20:19:20,262 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 20:19:20,265 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 20:19:20,267 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 20:19:20,270 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 20:19:20,271 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 20:19:20,273 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 20:19:20,284 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 20:19:20,285 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 20:19:20,285 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 20:19:20,289 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 20:19:20,293 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 20:19:20,297 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 20:19:20,298 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 20:19:20,299 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 20:19:20,301 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 20:19:20,303 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 20:19:20,306 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 20:19:20,306 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 20:19:20,307 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 20:19:20,308 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 20:19:20,308 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 20:19:20,327 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 20:19:20,328 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 20:19:20,329 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 20:19:20,368 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 20:19:20,368 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 20:19:20,370 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 20:19:20,370 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 20:19:20,371 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 20:19:20,371 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 20:19:20,371 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 20:19:20,371 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 20:19:20,372 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 20:19:20,372 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 20:19:20,372 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 20:19:20,372 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 20:19:20,373 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 20:19:20,373 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 20:19:20,373 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 20:19:20,374 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 20:19:20,374 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 20:19:20,374 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 20:19:20,375 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 20:19:20,375 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 20:19:20,375 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 20:19:20,375 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 20:19:20,376 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 20:19:20,376 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 20:19:20,376 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 20:19:20,376 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 20:19:20,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 20:19:20,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 20:19:20,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 20:19:20,801 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 20:19:20,802 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 20:19:20,803 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2021-01-06 20:19:20,881 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/4379c3ed8/47d97b2cd7d04837999398f9804354f4/FLAG6f9cc724a [2021-01-06 20:19:21,576 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 20:19:21,577 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2021-01-06 20:19:21,604 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/4379c3ed8/47d97b2cd7d04837999398f9804354f4/FLAG6f9cc724a [2021-01-06 20:19:21,886 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/4379c3ed8/47d97b2cd7d04837999398f9804354f4 [2021-01-06 20:19:21,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 20:19:21,892 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 20:19:21,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 20:19:21,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 20:19:21,899 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 20:19:21,900 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 08:19:21" (1/1) ... [2021-01-06 20:19:21,901 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@440c22b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:19:21, skipping insertion in model container [2021-01-06 20:19:21,902 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 08:19:21" (1/1) ... [2021-01-06 20:19:21,917 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 20:19:21,998 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~ep12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep31~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep32~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~init__r121~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r131~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r211~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r231~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r311~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r321~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r122~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r132~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r212~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r232~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r312~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r322~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_1179~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_1310~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~0,] [2021-01-06 20:19:22,319 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[6831,6844] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_1387~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] [2021-01-06 20:19:22,402 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 20:19:22,446 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~ep12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep31~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep32~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~init__r121~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r131~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r211~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r231~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r311~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r321~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r122~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r132~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r212~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r232~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r312~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r322~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_1179~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_1310~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~0,] [2021-01-06 20:19:22,604 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[6831,6844] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_1387~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] [2021-01-06 20:19:22,669 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 20:19:22,706 INFO L208 MainTranslator]: Completed translation [2021-01-06 20:19:22,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:19:22 WrapperNode [2021-01-06 20:19:22,707 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 20:19:22,710 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 20:19:22,710 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 20:19:22,710 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 20:19:22,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:19:22" (1/1) ... [2021-01-06 20:19:22,757 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:19:22" (1/1) ... [2021-01-06 20:19:22,810 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 20:19:22,811 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 20:19:22,811 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 20:19:22,811 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 20:19:22,822 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:19:22" (1/1) ... [2021-01-06 20:19:22,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:19:22" (1/1) ... [2021-01-06 20:19:22,826 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:19:22" (1/1) ... [2021-01-06 20:19:22,826 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:19:22" (1/1) ... [2021-01-06 20:19:22,837 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:19:22" (1/1) ... [2021-01-06 20:19:22,844 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:19:22" (1/1) ... [2021-01-06 20:19:22,848 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:19:22" (1/1) ... [2021-01-06 20:19:22,854 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 20:19:22,855 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 20:19:22,855 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 20:19:22,856 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 20:19:22,857 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:19:22" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 20:19:22,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 20:19:22,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 20:19:22,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 20:19:22,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 20:19:24,026 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 20:19:24,027 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-01-06 20:19:24,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 08:19:24 BoogieIcfgContainer [2021-01-06 20:19:24,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 20:19:24,032 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 20:19:24,032 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 20:19:24,036 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 20:19:24,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 08:19:21" (1/3) ... [2021-01-06 20:19:24,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39cb1c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 08:19:24, skipping insertion in model container [2021-01-06 20:19:24,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:19:22" (2/3) ... [2021-01-06 20:19:24,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39cb1c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 08:19:24, skipping insertion in model container [2021-01-06 20:19:24,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 08:19:24" (3/3) ... [2021-01-06 20:19:24,041 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2021-01-06 20:19:24,050 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 20:19:24,056 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 20:19:24,078 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 20:19:24,111 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 20:19:24,112 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 20:19:24,112 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 20:19:24,112 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 20:19:24,112 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 20:19:24,113 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 20:19:24,113 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 20:19:24,113 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 20:19:24,141 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states. [2021-01-06 20:19:24,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-01-06 20:19:24,157 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:19:24,159 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:19:24,160 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:19:24,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:19:24,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1933157835, now seen corresponding path program 1 times [2021-01-06 20:19:24,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:19:24,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355995766] [2021-01-06 20:19:24,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:19:24,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:19:24,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:19:24,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355995766] [2021-01-06 20:19:24,714 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:19:24,714 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:19:24,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676412760] [2021-01-06 20:19:24,728 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:19:24,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:19:24,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:19:24,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:19:24,749 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 3 states. [2021-01-06 20:19:24,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:19:24,889 INFO L93 Difference]: Finished difference Result 288 states and 491 transitions. [2021-01-06 20:19:24,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:19:24,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2021-01-06 20:19:24,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:19:24,907 INFO L225 Difference]: With dead ends: 288 [2021-01-06 20:19:24,907 INFO L226 Difference]: Without dead ends: 201 [2021-01-06 20:19:24,911 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:19:24,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-01-06 20:19:24,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2021-01-06 20:19:24,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2021-01-06 20:19:24,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 313 transitions. [2021-01-06 20:19:24,993 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 313 transitions. Word has length 57 [2021-01-06 20:19:24,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:19:24,996 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 313 transitions. [2021-01-06 20:19:24,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:19:24,996 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 313 transitions. [2021-01-06 20:19:25,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-01-06 20:19:25,000 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:19:25,000 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:19:25,001 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 20:19:25,001 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:19:25,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:19:25,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1883490782, now seen corresponding path program 1 times [2021-01-06 20:19:25,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:19:25,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517360901] [2021-01-06 20:19:25,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:19:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:19:25,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:19:25,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517360901] [2021-01-06 20:19:25,198 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:19:25,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:19:25,199 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686484876] [2021-01-06 20:19:25,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:19:25,203 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:19:25,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:19:25,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:19:25,207 INFO L87 Difference]: Start difference. First operand 199 states and 313 transitions. Second operand 3 states. [2021-01-06 20:19:25,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:19:25,310 INFO L93 Difference]: Finished difference Result 475 states and 769 transitions. [2021-01-06 20:19:25,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:19:25,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2021-01-06 20:19:25,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:19:25,319 INFO L225 Difference]: With dead ends: 475 [2021-01-06 20:19:25,321 INFO L226 Difference]: Without dead ends: 330 [2021-01-06 20:19:25,324 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:19:25,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2021-01-06 20:19:25,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2021-01-06 20:19:25,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2021-01-06 20:19:25,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 525 transitions. [2021-01-06 20:19:25,370 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 525 transitions. Word has length 59 [2021-01-06 20:19:25,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:19:25,370 INFO L481 AbstractCegarLoop]: Abstraction has 328 states and 525 transitions. [2021-01-06 20:19:25,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:19:25,371 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 525 transitions. [2021-01-06 20:19:25,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-01-06 20:19:25,375 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:19:25,375 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:19:25,375 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 20:19:25,375 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:19:25,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:19:25,376 INFO L82 PathProgramCache]: Analyzing trace with hash -111872728, now seen corresponding path program 1 times [2021-01-06 20:19:25,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:19:25,377 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458504124] [2021-01-06 20:19:25,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:19:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:19:25,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:19:25,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458504124] [2021-01-06 20:19:25,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:19:25,486 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:19:25,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906389617] [2021-01-06 20:19:25,487 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:19:25,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:19:25,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:19:25,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:19:25,494 INFO L87 Difference]: Start difference. First operand 328 states and 525 transitions. Second operand 3 states. [2021-01-06 20:19:25,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:19:25,584 INFO L93 Difference]: Finished difference Result 603 states and 981 transitions. [2021-01-06 20:19:25,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:19:25,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2021-01-06 20:19:25,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:19:25,592 INFO L225 Difference]: With dead ends: 603 [2021-01-06 20:19:25,593 INFO L226 Difference]: Without dead ends: 458 [2021-01-06 20:19:25,594 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:19:25,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2021-01-06 20:19:25,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 456. [2021-01-06 20:19:25,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2021-01-06 20:19:25,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 735 transitions. [2021-01-06 20:19:25,660 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 735 transitions. Word has length 61 [2021-01-06 20:19:25,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:19:25,662 INFO L481 AbstractCegarLoop]: Abstraction has 456 states and 735 transitions. [2021-01-06 20:19:25,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:19:25,662 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 735 transitions. [2021-01-06 20:19:25,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-01-06 20:19:25,672 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:19:25,672 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:19:25,673 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 20:19:25,673 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:19:25,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:19:25,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1275396395, now seen corresponding path program 1 times [2021-01-06 20:19:25,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:19:25,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106180444] [2021-01-06 20:19:25,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:19:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:19:25,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:19:25,798 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106180444] [2021-01-06 20:19:25,798 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:19:25,798 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:19:25,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442357765] [2021-01-06 20:19:25,799 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:19:25,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:19:25,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:19:25,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:19:25,801 INFO L87 Difference]: Start difference. First operand 456 states and 735 transitions. Second operand 3 states. [2021-01-06 20:19:25,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:19:25,855 INFO L93 Difference]: Finished difference Result 1172 states and 1911 transitions. [2021-01-06 20:19:25,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:19:25,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2021-01-06 20:19:25,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:19:25,861 INFO L225 Difference]: With dead ends: 1172 [2021-01-06 20:19:25,861 INFO L226 Difference]: Without dead ends: 793 [2021-01-06 20:19:25,863 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:19:25,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2021-01-06 20:19:25,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 791. [2021-01-06 20:19:25,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2021-01-06 20:19:25,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1277 transitions. [2021-01-06 20:19:25,907 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1277 transitions. Word has length 61 [2021-01-06 20:19:25,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:19:25,908 INFO L481 AbstractCegarLoop]: Abstraction has 791 states and 1277 transitions. [2021-01-06 20:19:25,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:19:25,908 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1277 transitions. [2021-01-06 20:19:25,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-06 20:19:25,910 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:19:25,910 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:19:25,911 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 20:19:25,911 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:19:25,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:19:25,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1280827262, now seen corresponding path program 1 times [2021-01-06 20:19:25,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:19:25,912 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299448954] [2021-01-06 20:19:25,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:19:25,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:19:26,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:19:26,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299448954] [2021-01-06 20:19:26,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:19:26,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 20:19:26,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356464889] [2021-01-06 20:19:26,063 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:19:26,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:19:26,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:19:26,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:19:26,064 INFO L87 Difference]: Start difference. First operand 791 states and 1277 transitions. Second operand 5 states. [2021-01-06 20:19:26,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:19:26,306 INFO L93 Difference]: Finished difference Result 2945 states and 4837 transitions. [2021-01-06 20:19:26,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:19:26,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2021-01-06 20:19:26,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:19:26,344 INFO L225 Difference]: With dead ends: 2945 [2021-01-06 20:19:26,344 INFO L226 Difference]: Without dead ends: 2231 [2021-01-06 20:19:26,350 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:19:26,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2021-01-06 20:19:26,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1452. [2021-01-06 20:19:26,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1452 states. [2021-01-06 20:19:26,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 2348 transitions. [2021-01-06 20:19:26,511 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 2348 transitions. Word has length 63 [2021-01-06 20:19:26,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:19:26,513 INFO L481 AbstractCegarLoop]: Abstraction has 1452 states and 2348 transitions. [2021-01-06 20:19:26,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:19:26,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 2348 transitions. [2021-01-06 20:19:26,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-01-06 20:19:26,514 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:19:26,514 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:19:26,515 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 20:19:26,515 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:19:26,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:19:26,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1113443658, now seen corresponding path program 1 times [2021-01-06 20:19:26,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:19:26,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466436694] [2021-01-06 20:19:26,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:19:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:19:26,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:19:26,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466436694] [2021-01-06 20:19:26,678 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:19:26,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 20:19:26,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842456395] [2021-01-06 20:19:26,679 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 20:19:26,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:19:26,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 20:19:26,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 20:19:26,682 INFO L87 Difference]: Start difference. First operand 1452 states and 2348 transitions. Second operand 4 states. [2021-01-06 20:19:26,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:19:26,914 INFO L93 Difference]: Finished difference Result 3856 states and 6322 transitions. [2021-01-06 20:19:26,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 20:19:26,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2021-01-06 20:19:26,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:19:26,928 INFO L225 Difference]: With dead ends: 3856 [2021-01-06 20:19:26,929 INFO L226 Difference]: Without dead ends: 2483 [2021-01-06 20:19:26,932 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 20:19:26,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2483 states. [2021-01-06 20:19:27,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2483 to 2147. [2021-01-06 20:19:27,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2147 states. [2021-01-06 20:19:27,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 3491 transitions. [2021-01-06 20:19:27,095 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 3491 transitions. Word has length 64 [2021-01-06 20:19:27,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:19:27,096 INFO L481 AbstractCegarLoop]: Abstraction has 2147 states and 3491 transitions. [2021-01-06 20:19:27,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 20:19:27,096 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 3491 transitions. [2021-01-06 20:19:27,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-01-06 20:19:27,098 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:19:27,098 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:19:27,099 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 20:19:27,100 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:19:27,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:19:27,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1248232611, now seen corresponding path program 1 times [2021-01-06 20:19:27,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:19:27,106 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776964588] [2021-01-06 20:19:27,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:19:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:19:27,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:19:27,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776964588] [2021-01-06 20:19:27,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:19:27,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:19:27,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245804551] [2021-01-06 20:19:27,238 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:19:27,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:19:27,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:19:27,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:19:27,240 INFO L87 Difference]: Start difference. First operand 2147 states and 3491 transitions. Second operand 3 states. [2021-01-06 20:19:27,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:19:27,437 INFO L93 Difference]: Finished difference Result 4165 states and 6807 transitions. [2021-01-06 20:19:27,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:19:27,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2021-01-06 20:19:27,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:19:27,456 INFO L225 Difference]: With dead ends: 4165 [2021-01-06 20:19:27,456 INFO L226 Difference]: Without dead ends: 3011 [2021-01-06 20:19:27,463 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:19:27,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3011 states. [2021-01-06 20:19:27,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3011 to 3009. [2021-01-06 20:19:27,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3009 states. [2021-01-06 20:19:27,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3009 states to 3009 states and 4878 transitions. [2021-01-06 20:19:27,717 INFO L78 Accepts]: Start accepts. Automaton has 3009 states and 4878 transitions. Word has length 64 [2021-01-06 20:19:27,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:19:27,718 INFO L481 AbstractCegarLoop]: Abstraction has 3009 states and 4878 transitions. [2021-01-06 20:19:27,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:19:27,718 INFO L276 IsEmpty]: Start isEmpty. Operand 3009 states and 4878 transitions. [2021-01-06 20:19:27,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-01-06 20:19:27,719 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:19:27,719 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:19:27,720 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 20:19:27,720 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:19:27,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:19:27,721 INFO L82 PathProgramCache]: Analyzing trace with hash 616386787, now seen corresponding path program 1 times [2021-01-06 20:19:27,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:19:27,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877160601] [2021-01-06 20:19:27,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:19:27,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:19:27,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:19:27,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877160601] [2021-01-06 20:19:27,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:19:27,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:19:27,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643504474] [2021-01-06 20:19:27,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:19:27,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:19:27,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:19:27,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:19:27,796 INFO L87 Difference]: Start difference. First operand 3009 states and 4878 transitions. Second operand 3 states. [2021-01-06 20:19:28,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:19:28,074 INFO L93 Difference]: Finished difference Result 6431 states and 10590 transitions. [2021-01-06 20:19:28,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:19:28,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2021-01-06 20:19:28,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:19:28,100 INFO L225 Difference]: With dead ends: 6431 [2021-01-06 20:19:28,100 INFO L226 Difference]: Without dead ends: 4345 [2021-01-06 20:19:28,105 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:19:28,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4345 states. [2021-01-06 20:19:28,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4345 to 4343. [2021-01-06 20:19:28,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4343 states. [2021-01-06 20:19:28,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4343 states to 4343 states and 7079 transitions. [2021-01-06 20:19:28,425 INFO L78 Accepts]: Start accepts. Automaton has 4343 states and 7079 transitions. Word has length 64 [2021-01-06 20:19:28,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:19:28,425 INFO L481 AbstractCegarLoop]: Abstraction has 4343 states and 7079 transitions. [2021-01-06 20:19:28,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:19:28,425 INFO L276 IsEmpty]: Start isEmpty. Operand 4343 states and 7079 transitions. [2021-01-06 20:19:28,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-06 20:19:28,430 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:19:28,431 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:19:28,431 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 20:19:28,431 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:19:28,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:19:28,433 INFO L82 PathProgramCache]: Analyzing trace with hash -214961207, now seen corresponding path program 1 times [2021-01-06 20:19:28,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:19:28,434 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422337868] [2021-01-06 20:19:28,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:19:28,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:19:28,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:19:28,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422337868] [2021-01-06 20:19:28,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:19:28,532 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 20:19:28,533 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935396854] [2021-01-06 20:19:28,533 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 20:19:28,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:19:28,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 20:19:28,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 20:19:28,535 INFO L87 Difference]: Start difference. First operand 4343 states and 7079 transitions. Second operand 4 states. [2021-01-06 20:19:29,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:19:29,066 INFO L93 Difference]: Finished difference Result 12351 states and 20249 transitions. [2021-01-06 20:19:29,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 20:19:29,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2021-01-06 20:19:29,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:19:29,113 INFO L225 Difference]: With dead ends: 12351 [2021-01-06 20:19:29,113 INFO L226 Difference]: Without dead ends: 8090 [2021-01-06 20:19:29,122 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:19:29,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8090 states. [2021-01-06 20:19:29,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8090 to 6911. [2021-01-06 20:19:29,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6911 states. [2021-01-06 20:19:29,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6911 states to 6911 states and 11221 transitions. [2021-01-06 20:19:29,672 INFO L78 Accepts]: Start accepts. Automaton has 6911 states and 11221 transitions. Word has length 65 [2021-01-06 20:19:29,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:19:29,672 INFO L481 AbstractCegarLoop]: Abstraction has 6911 states and 11221 transitions. [2021-01-06 20:19:29,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 20:19:29,673 INFO L276 IsEmpty]: Start isEmpty. Operand 6911 states and 11221 transitions. [2021-01-06 20:19:29,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 20:19:29,677 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:19:29,677 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:19:29,677 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 20:19:29,677 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:19:29,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:19:29,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1872749021, now seen corresponding path program 1 times [2021-01-06 20:19:29,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:19:29,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114396202] [2021-01-06 20:19:29,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:19:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:19:29,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:19:29,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114396202] [2021-01-06 20:19:29,840 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:19:29,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 20:19:29,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002230720] [2021-01-06 20:19:29,841 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 20:19:29,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:19:29,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 20:19:29,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 20:19:29,847 INFO L87 Difference]: Start difference. First operand 6911 states and 11221 transitions. Second operand 4 states. [2021-01-06 20:19:30,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:19:30,744 INFO L93 Difference]: Finished difference Result 20038 states and 32688 transitions. [2021-01-06 20:19:30,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 20:19:30,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2021-01-06 20:19:30,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:19:30,868 INFO L225 Difference]: With dead ends: 20038 [2021-01-06 20:19:30,869 INFO L226 Difference]: Without dead ends: 13209 [2021-01-06 20:19:30,882 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 20:19:30,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13209 states. [2021-01-06 20:19:31,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13209 to 10779. [2021-01-06 20:19:31,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10779 states. [2021-01-06 20:19:31,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10779 states to 10779 states and 17427 transitions. [2021-01-06 20:19:31,614 INFO L78 Accepts]: Start accepts. Automaton has 10779 states and 17427 transitions. Word has length 66 [2021-01-06 20:19:31,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:19:31,615 INFO L481 AbstractCegarLoop]: Abstraction has 10779 states and 17427 transitions. [2021-01-06 20:19:31,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 20:19:31,615 INFO L276 IsEmpty]: Start isEmpty. Operand 10779 states and 17427 transitions. [2021-01-06 20:19:31,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 20:19:31,616 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:19:31,616 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:19:31,616 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 20:19:31,617 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:19:31,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:19:31,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1396799506, now seen corresponding path program 1 times [2021-01-06 20:19:31,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:19:31,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131768778] [2021-01-06 20:19:31,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:19:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:19:31,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:19:31,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131768778] [2021-01-06 20:19:31,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:19:31,766 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 20:19:31,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391636589] [2021-01-06 20:19:31,766 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:19:31,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:19:31,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:19:31,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:19:31,769 INFO L87 Difference]: Start difference. First operand 10779 states and 17427 transitions. Second operand 5 states. [2021-01-06 20:19:33,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:19:33,076 INFO L93 Difference]: Finished difference Result 25359 states and 41228 transitions. [2021-01-06 20:19:33,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:19:33,077 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2021-01-06 20:19:33,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:19:33,130 INFO L225 Difference]: With dead ends: 25359 [2021-01-06 20:19:33,130 INFO L226 Difference]: Without dead ends: 14662 [2021-01-06 20:19:33,146 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:19:33,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14662 states. [2021-01-06 20:19:33,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14662 to 10779. [2021-01-06 20:19:33,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10779 states. [2021-01-06 20:19:33,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10779 states to 10779 states and 17302 transitions. [2021-01-06 20:19:33,903 INFO L78 Accepts]: Start accepts. Automaton has 10779 states and 17302 transitions. Word has length 68 [2021-01-06 20:19:33,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:19:33,903 INFO L481 AbstractCegarLoop]: Abstraction has 10779 states and 17302 transitions. [2021-01-06 20:19:33,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:19:33,903 INFO L276 IsEmpty]: Start isEmpty. Operand 10779 states and 17302 transitions. [2021-01-06 20:19:33,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-01-06 20:19:33,904 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:19:33,904 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:19:33,905 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 20:19:33,905 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:19:33,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:19:33,906 INFO L82 PathProgramCache]: Analyzing trace with hash -164512453, now seen corresponding path program 1 times [2021-01-06 20:19:33,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:19:33,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344178955] [2021-01-06 20:19:33,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:19:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:19:34,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:19:34,014 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344178955] [2021-01-06 20:19:34,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:19:34,014 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 20:19:34,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935101565] [2021-01-06 20:19:34,015 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 20:19:34,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:19:34,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 20:19:34,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 20:19:34,016 INFO L87 Difference]: Start difference. First operand 10779 states and 17302 transitions. Second operand 4 states. [2021-01-06 20:19:35,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:19:35,416 INFO L93 Difference]: Finished difference Result 31699 states and 50901 transitions. [2021-01-06 20:19:35,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 20:19:35,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2021-01-06 20:19:35,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:19:35,479 INFO L225 Difference]: With dead ends: 31699 [2021-01-06 20:19:35,479 INFO L226 Difference]: Without dead ends: 20929 [2021-01-06 20:19:35,501 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:19:35,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20929 states. [2021-01-06 20:19:37,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20929 to 20927. [2021-01-06 20:19:37,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20927 states. [2021-01-06 20:19:37,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20927 states to 20927 states and 33387 transitions. [2021-01-06 20:19:37,145 INFO L78 Accepts]: Start accepts. Automaton has 20927 states and 33387 transitions. Word has length 71 [2021-01-06 20:19:37,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:19:37,146 INFO L481 AbstractCegarLoop]: Abstraction has 20927 states and 33387 transitions. [2021-01-06 20:19:37,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 20:19:37,146 INFO L276 IsEmpty]: Start isEmpty. Operand 20927 states and 33387 transitions. [2021-01-06 20:19:37,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 20:19:37,147 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:19:37,147 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:19:37,147 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 20:19:37,148 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:19:37,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:19:37,148 INFO L82 PathProgramCache]: Analyzing trace with hash 667892135, now seen corresponding path program 1 times [2021-01-06 20:19:37,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:19:37,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934065687] [2021-01-06 20:19:37,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:19:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:19:37,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:19:37,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934065687] [2021-01-06 20:19:37,181 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:19:37,181 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:19:37,181 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519658321] [2021-01-06 20:19:37,181 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:19:37,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:19:37,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:19:37,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:19:37,183 INFO L87 Difference]: Start difference. First operand 20927 states and 33387 transitions. Second operand 3 states. [2021-01-06 20:19:39,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:19:39,365 INFO L93 Difference]: Finished difference Result 62743 states and 100099 transitions. [2021-01-06 20:19:39,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:19:39,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-01-06 20:19:39,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:19:39,481 INFO L225 Difference]: With dead ends: 62743 [2021-01-06 20:19:39,481 INFO L226 Difference]: Without dead ends: 41844 [2021-01-06 20:19:39,517 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:19:39,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41844 states. [2021-01-06 20:19:41,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41844 to 20929. [2021-01-06 20:19:41,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20929 states. [2021-01-06 20:19:41,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20929 states to 20929 states and 33389 transitions. [2021-01-06 20:19:41,287 INFO L78 Accepts]: Start accepts. Automaton has 20929 states and 33389 transitions. Word has length 72 [2021-01-06 20:19:41,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:19:41,287 INFO L481 AbstractCegarLoop]: Abstraction has 20929 states and 33389 transitions. [2021-01-06 20:19:41,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:19:41,287 INFO L276 IsEmpty]: Start isEmpty. Operand 20929 states and 33389 transitions. [2021-01-06 20:19:41,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-06 20:19:41,288 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:19:41,289 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:19:41,289 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 20:19:41,289 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:19:41,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:19:41,289 INFO L82 PathProgramCache]: Analyzing trace with hash -808520295, now seen corresponding path program 1 times [2021-01-06 20:19:41,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:19:41,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616825297] [2021-01-06 20:19:41,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:19:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:19:41,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:19:41,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616825297] [2021-01-06 20:19:41,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:19:41,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:19:41,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132711549] [2021-01-06 20:19:41,355 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:19:41,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:19:41,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:19:41,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:19:41,356 INFO L87 Difference]: Start difference. First operand 20929 states and 33389 transitions. Second operand 3 states. [2021-01-06 20:19:44,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:19:44,011 INFO L93 Difference]: Finished difference Result 61383 states and 97998 transitions. [2021-01-06 20:19:44,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:19:44,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2021-01-06 20:19:44,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:19:44,087 INFO L225 Difference]: With dead ends: 61383 [2021-01-06 20:19:44,087 INFO L226 Difference]: Without dead ends: 40610 [2021-01-06 20:19:44,126 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:19:44,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40610 states. [2021-01-06 20:19:46,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40610 to 40608. [2021-01-06 20:19:46,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40608 states. [2021-01-06 20:19:46,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40608 states to 40608 states and 64369 transitions. [2021-01-06 20:19:46,865 INFO L78 Accepts]: Start accepts. Automaton has 40608 states and 64369 transitions. Word has length 73 [2021-01-06 20:19:46,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:19:46,865 INFO L481 AbstractCegarLoop]: Abstraction has 40608 states and 64369 transitions. [2021-01-06 20:19:46,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:19:46,865 INFO L276 IsEmpty]: Start isEmpty. Operand 40608 states and 64369 transitions. [2021-01-06 20:19:46,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-06 20:19:46,866 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:19:46,867 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:19:46,867 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 20:19:46,867 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:19:46,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:19:46,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1547459556, now seen corresponding path program 1 times [2021-01-06 20:19:46,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:19:46,868 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977955577] [2021-01-06 20:19:46,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:19:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:19:47,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:19:47,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977955577] [2021-01-06 20:19:47,031 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:19:47,031 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 20:19:47,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140671370] [2021-01-06 20:19:47,031 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:19:47,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:19:47,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:19:47,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:19:47,032 INFO L87 Difference]: Start difference. First operand 40608 states and 64369 transitions. Second operand 5 states. [2021-01-06 20:19:52,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:19:52,441 INFO L93 Difference]: Finished difference Result 119148 states and 188934 transitions. [2021-01-06 20:19:52,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 20:19:52,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2021-01-06 20:19:52,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:19:52,590 INFO L225 Difference]: With dead ends: 119148 [2021-01-06 20:19:52,590 INFO L226 Difference]: Without dead ends: 78554 [2021-01-06 20:19:52,627 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:19:52,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78554 states. [2021-01-06 20:19:57,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78554 to 78552. [2021-01-06 20:19:57,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78552 states. [2021-01-06 20:19:57,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78552 states to 78552 states and 123683 transitions. [2021-01-06 20:19:57,671 INFO L78 Accepts]: Start accepts. Automaton has 78552 states and 123683 transitions. Word has length 73 [2021-01-06 20:19:57,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:19:57,672 INFO L481 AbstractCegarLoop]: Abstraction has 78552 states and 123683 transitions. [2021-01-06 20:19:57,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:19:57,672 INFO L276 IsEmpty]: Start isEmpty. Operand 78552 states and 123683 transitions. [2021-01-06 20:19:57,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-06 20:19:57,674 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:19:57,674 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:19:57,674 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 20:19:57,674 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:19:57,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:19:57,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1975872346, now seen corresponding path program 1 times [2021-01-06 20:19:57,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:19:57,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183450754] [2021-01-06 20:19:57,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:19:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:19:57,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:19:57,775 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183450754] [2021-01-06 20:19:57,775 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:19:57,775 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 20:19:57,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270499241] [2021-01-06 20:19:57,776 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 20:19:57,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:19:57,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 20:19:57,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 20:19:57,777 INFO L87 Difference]: Start difference. First operand 78552 states and 123683 transitions. Second operand 4 states. [2021-01-06 20:20:09,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:20:09,131 INFO L93 Difference]: Finished difference Result 230583 states and 363068 transitions. [2021-01-06 20:20:09,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 20:20:09,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2021-01-06 20:20:09,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:20:09,590 INFO L225 Difference]: With dead ends: 230583 [2021-01-06 20:20:09,590 INFO L226 Difference]: Without dead ends: 152087 [2021-01-06 20:20:09,674 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:20:09,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152087 states. [2021-01-06 20:20:20,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152087 to 152085. [2021-01-06 20:20:20,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152085 states. [2021-01-06 20:20:21,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152085 states to 152085 states and 237673 transitions. [2021-01-06 20:20:21,011 INFO L78 Accepts]: Start accepts. Automaton has 152085 states and 237673 transitions. Word has length 73 [2021-01-06 20:20:21,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:20:21,011 INFO L481 AbstractCegarLoop]: Abstraction has 152085 states and 237673 transitions. [2021-01-06 20:20:21,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 20:20:21,011 INFO L276 IsEmpty]: Start isEmpty. Operand 152085 states and 237673 transitions. [2021-01-06 20:20:21,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 20:20:21,014 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:20:21,014 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:20:21,014 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 20:20:21,014 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:20:21,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:20:21,015 INFO L82 PathProgramCache]: Analyzing trace with hash -2004902810, now seen corresponding path program 1 times [2021-01-06 20:20:21,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:20:21,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747887662] [2021-01-06 20:20:21,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:20:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:20:21,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:20:21,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747887662] [2021-01-06 20:20:21,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:20:21,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:20:21,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932315018] [2021-01-06 20:20:21,353 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:20:21,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:20:21,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:20:21,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:20:21,355 INFO L87 Difference]: Start difference. First operand 152085 states and 237673 transitions. Second operand 3 states. [2021-01-06 20:20:43,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:20:43,124 INFO L93 Difference]: Finished difference Result 456103 states and 712786 transitions. [2021-01-06 20:20:43,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:20:43,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2021-01-06 20:20:43,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:20:43,813 INFO L225 Difference]: With dead ends: 456103 [2021-01-06 20:20:43,814 INFO L226 Difference]: Without dead ends: 304109 [2021-01-06 20:20:43,965 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:20:44,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304109 states. [2021-01-06 20:20:57,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304109 to 152095. [2021-01-06 20:20:57,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152095 states. [2021-01-06 20:20:58,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152095 states to 152095 states and 237683 transitions. [2021-01-06 20:20:58,384 INFO L78 Accepts]: Start accepts. Automaton has 152095 states and 237683 transitions. Word has length 74 [2021-01-06 20:20:58,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:20:58,385 INFO L481 AbstractCegarLoop]: Abstraction has 152095 states and 237683 transitions. [2021-01-06 20:20:58,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:20:58,385 INFO L276 IsEmpty]: Start isEmpty. Operand 152095 states and 237683 transitions. [2021-01-06 20:20:58,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 20:20:58,403 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:20:58,404 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:20:58,404 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 20:20:58,405 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:20:58,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:20:58,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1175997191, now seen corresponding path program 1 times [2021-01-06 20:20:58,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:20:58,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045076862] [2021-01-06 20:20:58,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:20:58,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:20:58,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:20:58,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045076862] [2021-01-06 20:20:58,542 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:20:58,542 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 20:20:58,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611586975] [2021-01-06 20:20:58,548 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 20:20:58,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:20:58,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 20:20:58,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 20:20:58,549 INFO L87 Difference]: Start difference. First operand 152095 states and 237683 transitions. Second operand 4 states.