/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/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 09:53:47,626 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 09:53:47,629 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 09:53:47,670 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 09:53:47,671 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 09:53:47,672 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 09:53:47,674 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 09:53:47,677 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 09:53:47,679 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 09:53:47,680 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 09:53:47,681 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 09:53:47,683 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 09:53:47,683 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 09:53:47,685 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 09:53:47,686 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 09:53:47,688 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 09:53:47,689 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 09:53:47,690 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 09:53:47,707 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 09:53:47,710 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 09:53:47,712 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 09:53:47,713 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 09:53:47,714 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 09:53:47,716 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 09:53:47,719 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 09:53:47,719 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 09:53:47,719 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 09:53:47,721 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 09:53:47,721 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 09:53:47,722 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 09:53:47,723 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 09:53:47,724 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 09:53:47,725 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 09:53:47,726 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 09:53:47,727 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 09:53:47,727 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 09:53:47,728 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 09:53:47,728 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 09:53:47,729 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 09:53:47,730 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 09:53:47,731 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 09:53:47,732 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 09:53:47,758 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 09:53:47,759 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 09:53:47,760 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 09:53:47,760 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 09:53:47,761 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 09:53:47,761 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 09:53:47,761 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 09:53:47,761 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 09:53:47,762 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 09:53:47,762 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 09:53:47,762 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 09:53:47,762 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 09:53:47,763 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 09:53:47,763 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 09:53:47,763 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 09:53:47,763 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 09:53:47,764 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 09:53:47,764 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 09:53:47,764 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 09:53:47,764 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 09:53:47,765 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 09:53:47,765 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 09:53:47,765 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 09:53:47,765 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 09:53:47,765 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 09:53:47,766 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 [2020-12-23 09:53:48,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 09:53:48,151 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 09:53:48,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 09:53:48,156 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 09:53:48,157 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 09:53:48,158 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c [2020-12-23 09:53:48,251 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/c41a647fd/301b8b954c3f49ea898903a1cb2d4904/FLAG039911b2b [2020-12-23 09:53:48,998 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 09:53:48,999 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c [2020-12-23 09:53:49,012 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/c41a647fd/301b8b954c3f49ea898903a1cb2d4904/FLAG039911b2b [2020-12-23 09:53:49,285 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/c41a647fd/301b8b954c3f49ea898903a1cb2d4904 [2020-12-23 09:53:49,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 09:53:49,296 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 09:53:49,302 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 09:53:49,302 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 09:53:49,306 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 09:53:49,308 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:53:49" (1/1) ... [2020-12-23 09:53:49,309 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@796f5262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:53:49, skipping insertion in model container [2020-12-23 09:53:49,310 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:53:49" (1/1) ... [2020-12-23 09:53:49,319 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 09:53:49,379 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~m1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,] left hand side expression in assignment: lhs: VariableLHS[~m2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,] left hand side expression in assignment: lhs: VariableLHS[~m3~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m4~0,] left hand side expression in assignment: lhs: VariableLHS[~m4~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m5~0,] left hand side expression in assignment: lhs: VariableLHS[~m5~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m6~0,] left hand side expression in assignment: lhs: VariableLHS[~m6~0,] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] [2020-12-23 09:53:49,724 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/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c[16852,16865] [2020-12-23 09:53:49,728 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:53:49,740 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~m1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,] left hand side expression in assignment: lhs: VariableLHS[~m2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,] left hand side expression in assignment: lhs: VariableLHS[~m3~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m4~0,] left hand side expression in assignment: lhs: VariableLHS[~m4~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m5~0,] left hand side expression in assignment: lhs: VariableLHS[~m5~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m6~0,] left hand side expression in assignment: lhs: VariableLHS[~m6~0,] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] [2020-12-23 09:53:49,816 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/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c[16852,16865] [2020-12-23 09:53:49,817 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:53:49,849 INFO L208 MainTranslator]: Completed translation [2020-12-23 09:53:49,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:53:49 WrapperNode [2020-12-23 09:53:49,850 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 09:53:49,852 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 09:53:49,852 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 09:53:49,852 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 09:53:49,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:53:49" (1/1) ... [2020-12-23 09:53:49,895 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:53:49" (1/1) ... [2020-12-23 09:53:49,963 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 09:53:49,964 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 09:53:49,964 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 09:53:49,964 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 09:53:49,974 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:53:49" (1/1) ... [2020-12-23 09:53:49,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:53:49" (1/1) ... [2020-12-23 09:53:49,979 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:53:49" (1/1) ... [2020-12-23 09:53:49,979 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:53:49" (1/1) ... [2020-12-23 09:53:49,989 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:53:49" (1/1) ... [2020-12-23 09:53:49,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:53:49" (1/1) ... [2020-12-23 09:53:50,002 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:53:49" (1/1) ... [2020-12-23 09:53:50,008 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 09:53:50,010 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 09:53:50,010 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 09:53:50,010 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 09:53:50,011 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:53:49" (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 [2020-12-23 09:53:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 09:53:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 09:53:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 09:53:50,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 09:53:51,135 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 09:53:51,136 INFO L299 CfgBuilder]: Removed 25 assume(true) statements. [2020-12-23 09:53:51,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:53:51 BoogieIcfgContainer [2020-12-23 09:53:51,138 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 09:53:51,140 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 09:53:51,140 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 09:53:51,144 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 09:53:51,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 09:53:49" (1/3) ... [2020-12-23 09:53:51,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@283718b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:53:51, skipping insertion in model container [2020-12-23 09:53:51,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:53:49" (2/3) ... [2020-12-23 09:53:51,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@283718b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:53:51, skipping insertion in model container [2020-12-23 09:53:51,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:53:51" (3/3) ... [2020-12-23 09:53:51,148 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c [2020-12-23 09:53:51,155 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 09:53:51,160 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 09:53:51,180 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 09:53:51,209 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 09:53:51,210 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 09:53:51,210 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 09:53:51,210 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 09:53:51,210 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 09:53:51,210 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 09:53:51,211 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 09:53:51,211 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 09:53:51,233 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2020-12-23 09:53:51,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-23 09:53:51,243 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:53:51,244 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:53:51,244 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:53:51,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:53:51,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1333844149, now seen corresponding path program 1 times [2020-12-23 09:53:51,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:53:51,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491514784] [2020-12-23 09:53:51,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:53:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:53:51,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:53:51,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491514784] [2020-12-23 09:53:51,547 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:53:51,547 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:53:51,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533834324] [2020-12-23 09:53:51,553 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:53:51,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:53:51,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:53:51,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:53:51,572 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 5 states. [2020-12-23 09:53:51,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:53:51,721 INFO L93 Difference]: Finished difference Result 239 states and 399 transitions. [2020-12-23 09:53:51,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:53:51,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2020-12-23 09:53:51,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:53:51,736 INFO L225 Difference]: With dead ends: 239 [2020-12-23 09:53:51,737 INFO L226 Difference]: Without dead ends: 139 [2020-12-23 09:53:51,740 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:53:51,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-12-23 09:53:51,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2020-12-23 09:53:51,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-12-23 09:53:51,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 195 transitions. [2020-12-23 09:53:51,788 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 195 transitions. Word has length 37 [2020-12-23 09:53:51,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:53:51,789 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 195 transitions. [2020-12-23 09:53:51,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:53:51,789 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 195 transitions. [2020-12-23 09:53:51,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-12-23 09:53:51,793 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:53:51,793 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:53:51,793 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 09:53:51,794 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:53:51,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:53:51,795 INFO L82 PathProgramCache]: Analyzing trace with hash -976812523, now seen corresponding path program 1 times [2020-12-23 09:53:51,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:53:51,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945557370] [2020-12-23 09:53:51,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:53:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:53:52,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:53:52,074 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945557370] [2020-12-23 09:53:52,074 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:53:52,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:53:52,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896272835] [2020-12-23 09:53:52,077 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:53:52,077 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:53:52,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:53:52,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:53:52,084 INFO L87 Difference]: Start difference. First operand 139 states and 195 transitions. Second operand 3 states. [2020-12-23 09:53:52,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:53:52,127 INFO L93 Difference]: Finished difference Result 311 states and 471 transitions. [2020-12-23 09:53:52,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:53:52,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2020-12-23 09:53:52,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:53:52,132 INFO L225 Difference]: With dead ends: 311 [2020-12-23 09:53:52,132 INFO L226 Difference]: Without dead ends: 219 [2020-12-23 09:53:52,134 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 [2020-12-23 09:53:52,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-12-23 09:53:52,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2020-12-23 09:53:52,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-12-23 09:53:52,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 321 transitions. [2020-12-23 09:53:52,163 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 321 transitions. Word has length 77 [2020-12-23 09:53:52,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:53:52,164 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 321 transitions. [2020-12-23 09:53:52,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:53:52,164 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 321 transitions. [2020-12-23 09:53:52,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-23 09:53:52,167 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:53:52,167 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:53:52,168 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 09:53:52,168 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:53:52,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:53:52,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1251497554, now seen corresponding path program 1 times [2020-12-23 09:53:52,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:53:52,170 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684382362] [2020-12-23 09:53:52,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:53:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:53:52,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:53:52,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684382362] [2020-12-23 09:53:52,363 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:53:52,363 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:53:52,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842177592] [2020-12-23 09:53:52,364 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:53:52,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:53:52,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:53:52,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:53:52,366 INFO L87 Difference]: Start difference. First operand 217 states and 321 transitions. Second operand 3 states. [2020-12-23 09:53:52,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:53:52,417 INFO L93 Difference]: Finished difference Result 533 states and 829 transitions. [2020-12-23 09:53:52,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:53:52,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2020-12-23 09:53:52,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:53:52,426 INFO L225 Difference]: With dead ends: 533 [2020-12-23 09:53:52,427 INFO L226 Difference]: Without dead ends: 363 [2020-12-23 09:53:52,429 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 [2020-12-23 09:53:52,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2020-12-23 09:53:52,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 361. [2020-12-23 09:53:52,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2020-12-23 09:53:52,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 552 transitions. [2020-12-23 09:53:52,478 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 552 transitions. Word has length 78 [2020-12-23 09:53:52,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:53:52,479 INFO L481 AbstractCegarLoop]: Abstraction has 361 states and 552 transitions. [2020-12-23 09:53:52,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:53:52,479 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 552 transitions. [2020-12-23 09:53:52,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-12-23 09:53:52,486 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:53:52,486 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:53:52,487 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 09:53:52,487 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:53:52,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:53:52,488 INFO L82 PathProgramCache]: Analyzing trace with hash 2103523781, now seen corresponding path program 1 times [2020-12-23 09:53:52,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:53:52,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430507504] [2020-12-23 09:53:52,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:53:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:53:52,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:53:52,689 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430507504] [2020-12-23 09:53:52,689 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:53:52,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:53:52,690 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750296589] [2020-12-23 09:53:52,690 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:53:52,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:53:52,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:53:52,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:53:52,692 INFO L87 Difference]: Start difference. First operand 361 states and 552 transitions. Second operand 3 states. [2020-12-23 09:53:52,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:53:52,729 INFO L93 Difference]: Finished difference Result 941 states and 1482 transitions. [2020-12-23 09:53:52,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:53:52,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2020-12-23 09:53:52,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:53:52,734 INFO L225 Difference]: With dead ends: 941 [2020-12-23 09:53:52,735 INFO L226 Difference]: Without dead ends: 627 [2020-12-23 09:53:52,737 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 [2020-12-23 09:53:52,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2020-12-23 09:53:52,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 625. [2020-12-23 09:53:52,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2020-12-23 09:53:52,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 972 transitions. [2020-12-23 09:53:52,776 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 972 transitions. Word has length 79 [2020-12-23 09:53:52,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:53:52,777 INFO L481 AbstractCegarLoop]: Abstraction has 625 states and 972 transitions. [2020-12-23 09:53:52,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:53:52,778 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 972 transitions. [2020-12-23 09:53:52,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-12-23 09:53:52,780 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:53:52,780 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:53:52,780 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 09:53:52,780 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:53:52,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:53:52,781 INFO L82 PathProgramCache]: Analyzing trace with hash -508152546, now seen corresponding path program 1 times [2020-12-23 09:53:52,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:53:52,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756769647] [2020-12-23 09:53:52,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:53:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:53:52,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:53:52,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756769647] [2020-12-23 09:53:52,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:53:52,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:53:52,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855537689] [2020-12-23 09:53:52,904 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:53:52,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:53:52,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:53:52,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:53:52,905 INFO L87 Difference]: Start difference. First operand 625 states and 972 transitions. Second operand 3 states. [2020-12-23 09:53:52,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:53:52,979 INFO L93 Difference]: Finished difference Result 1685 states and 2662 transitions. [2020-12-23 09:53:52,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:53:52,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2020-12-23 09:53:52,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:53:52,988 INFO L225 Difference]: With dead ends: 1685 [2020-12-23 09:53:52,988 INFO L226 Difference]: Without dead ends: 1107 [2020-12-23 09:53:52,989 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 [2020-12-23 09:53:52,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2020-12-23 09:53:53,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1105. [2020-12-23 09:53:53,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1105 states. [2020-12-23 09:53:53,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 1728 transitions. [2020-12-23 09:53:53,035 INFO L78 Accepts]: Start accepts. Automaton has 1105 states and 1728 transitions. Word has length 80 [2020-12-23 09:53:53,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:53:53,035 INFO L481 AbstractCegarLoop]: Abstraction has 1105 states and 1728 transitions. [2020-12-23 09:53:53,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:53:53,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1728 transitions. [2020-12-23 09:53:53,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-12-23 09:53:53,037 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:53:53,037 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:53:53,037 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 09:53:53,038 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:53:53,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:53:53,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1230501237, now seen corresponding path program 1 times [2020-12-23 09:53:53,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:53:53,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289741388] [2020-12-23 09:53:53,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:53:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:53:53,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:53:53,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289741388] [2020-12-23 09:53:53,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:53:53,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:53:53,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860347172] [2020-12-23 09:53:53,112 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:53:53,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:53:53,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:53:53,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:53:53,113 INFO L87 Difference]: Start difference. First operand 1105 states and 1728 transitions. Second operand 3 states. [2020-12-23 09:53:53,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:53:53,174 INFO L93 Difference]: Finished difference Result 3029 states and 4770 transitions. [2020-12-23 09:53:53,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:53:53,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2020-12-23 09:53:53,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:53:53,187 INFO L225 Difference]: With dead ends: 3029 [2020-12-23 09:53:53,187 INFO L226 Difference]: Without dead ends: 1971 [2020-12-23 09:53:53,189 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 [2020-12-23 09:53:53,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1971 states. [2020-12-23 09:53:53,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1971 to 1969. [2020-12-23 09:53:53,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2020-12-23 09:53:53,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 3072 transitions. [2020-12-23 09:53:53,263 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 3072 transitions. Word has length 81 [2020-12-23 09:53:53,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:53:53,264 INFO L481 AbstractCegarLoop]: Abstraction has 1969 states and 3072 transitions. [2020-12-23 09:53:53,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:53:53,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 3072 transitions. [2020-12-23 09:53:53,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-12-23 09:53:53,265 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:53:53,265 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:53:53,265 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 09:53:53,266 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:53:53,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:53:53,266 INFO L82 PathProgramCache]: Analyzing trace with hash -937142130, now seen corresponding path program 1 times [2020-12-23 09:53:53,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:53:53,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703125859] [2020-12-23 09:53:53,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:53:53,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:53:53,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:53:53,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703125859] [2020-12-23 09:53:53,570 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:53:53,570 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 09:53:53,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399028967] [2020-12-23 09:53:53,571 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 09:53:53,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:53:53,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 09:53:53,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:53:53,572 INFO L87 Difference]: Start difference. First operand 1969 states and 3072 transitions. Second operand 8 states. [2020-12-23 09:53:54,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:53:54,110 INFO L93 Difference]: Finished difference Result 12301 states and 19142 transitions. [2020-12-23 09:53:54,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 09:53:54,111 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2020-12-23 09:53:54,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:53:54,167 INFO L225 Difference]: With dead ends: 12301 [2020-12-23 09:53:54,167 INFO L226 Difference]: Without dead ends: 10379 [2020-12-23 09:53:54,171 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:53:54,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10379 states. [2020-12-23 09:53:54,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10379 to 10369. [2020-12-23 09:53:54,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10369 states. [2020-12-23 09:53:54,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10369 states to 10369 states and 16080 transitions. [2020-12-23 09:53:54,774 INFO L78 Accepts]: Start accepts. Automaton has 10369 states and 16080 transitions. Word has length 82 [2020-12-23 09:53:54,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:53:54,775 INFO L481 AbstractCegarLoop]: Abstraction has 10369 states and 16080 transitions. [2020-12-23 09:53:54,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 09:53:54,775 INFO L276 IsEmpty]: Start isEmpty. Operand 10369 states and 16080 transitions. [2020-12-23 09:53:54,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-12-23 09:53:54,776 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:53:54,777 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:53:54,777 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 09:53:54,777 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:53:54,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:53:54,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1325136096, now seen corresponding path program 1 times [2020-12-23 09:53:54,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:53:54,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112459214] [2020-12-23 09:53:54,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:53:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:53:54,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:53:54,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112459214] [2020-12-23 09:53:54,969 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:53:54,969 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 09:53:54,970 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286983585] [2020-12-23 09:53:54,970 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 09:53:54,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:53:54,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 09:53:54,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:53:54,973 INFO L87 Difference]: Start difference. First operand 10369 states and 16080 transitions. Second operand 8 states. [2020-12-23 09:53:57,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:53:57,123 INFO L93 Difference]: Finished difference Result 57823 states and 89911 transitions. [2020-12-23 09:53:57,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 09:53:57,124 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2020-12-23 09:53:57,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:53:57,281 INFO L225 Difference]: With dead ends: 57823 [2020-12-23 09:53:57,282 INFO L226 Difference]: Without dead ends: 47501 [2020-12-23 09:53:57,321 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2020-12-23 09:53:57,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47501 states. [2020-12-23 09:53:58,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47501 to 20689. [2020-12-23 09:53:58,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20689 states. [2020-12-23 09:53:58,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20689 states to 20689 states and 31728 transitions. [2020-12-23 09:53:58,759 INFO L78 Accepts]: Start accepts. Automaton has 20689 states and 31728 transitions. Word has length 83 [2020-12-23 09:53:58,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:53:58,760 INFO L481 AbstractCegarLoop]: Abstraction has 20689 states and 31728 transitions. [2020-12-23 09:53:58,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 09:53:58,760 INFO L276 IsEmpty]: Start isEmpty. Operand 20689 states and 31728 transitions. [2020-12-23 09:53:58,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-23 09:53:58,762 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:53:58,762 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:53:58,762 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 09:53:58,762 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:53:58,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:53:58,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1487130877, now seen corresponding path program 1 times [2020-12-23 09:53:58,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:53:58,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138180340] [2020-12-23 09:53:58,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:53:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:53:58,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:53:58,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138180340] [2020-12-23 09:53:58,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:53:58,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 09:53:58,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072427035] [2020-12-23 09:53:58,890 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 09:53:58,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:53:58,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 09:53:58,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:53:58,892 INFO L87 Difference]: Start difference. First operand 20689 states and 31728 transitions. Second operand 8 states. [2020-12-23 09:54:01,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:54:01,167 INFO L93 Difference]: Finished difference Result 42867 states and 64945 transitions. [2020-12-23 09:54:01,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 09:54:01,168 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2020-12-23 09:54:01,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:54:01,271 INFO L225 Difference]: With dead ends: 42867 [2020-12-23 09:54:01,271 INFO L226 Difference]: Without dead ends: 42865 [2020-12-23 09:54:01,288 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2020-12-23 09:54:01,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42865 states. [2020-12-23 09:54:02,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42865 to 21841. [2020-12-23 09:54:02,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21841 states. [2020-12-23 09:54:02,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21841 states to 21841 states and 32880 transitions. [2020-12-23 09:54:02,636 INFO L78 Accepts]: Start accepts. Automaton has 21841 states and 32880 transitions. Word has length 84 [2020-12-23 09:54:02,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:54:02,636 INFO L481 AbstractCegarLoop]: Abstraction has 21841 states and 32880 transitions. [2020-12-23 09:54:02,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 09:54:02,637 INFO L276 IsEmpty]: Start isEmpty. Operand 21841 states and 32880 transitions. [2020-12-23 09:54:02,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-12-23 09:54:02,638 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:54:02,639 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:54:02,639 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 09:54:02,639 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:54:02,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:54:02,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1091004264, now seen corresponding path program 1 times [2020-12-23 09:54:02,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:54:02,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978030840] [2020-12-23 09:54:02,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:54:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:54:02,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:54:02,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978030840] [2020-12-23 09:54:02,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:54:02,716 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:54:02,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749018778] [2020-12-23 09:54:02,716 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:54:02,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:54:02,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:54:02,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:54:02,718 INFO L87 Difference]: Start difference. First operand 21841 states and 32880 transitions. Second operand 3 states. [2020-12-23 09:54:04,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:54:04,375 INFO L93 Difference]: Finished difference Result 61045 states and 91538 transitions. [2020-12-23 09:54:04,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:54:04,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2020-12-23 09:54:04,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:54:04,445 INFO L225 Difference]: With dead ends: 61045 [2020-12-23 09:54:04,446 INFO L226 Difference]: Without dead ends: 39251 [2020-12-23 09:54:04,475 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 [2020-12-23 09:54:04,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39251 states. [2020-12-23 09:54:06,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39251 to 38897. [2020-12-23 09:54:06,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38897 states. [2020-12-23 09:54:06,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38897 states to 38897 states and 57648 transitions. [2020-12-23 09:54:06,555 INFO L78 Accepts]: Start accepts. Automaton has 38897 states and 57648 transitions. Word has length 85 [2020-12-23 09:54:06,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:54:06,556 INFO L481 AbstractCegarLoop]: Abstraction has 38897 states and 57648 transitions. [2020-12-23 09:54:06,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:54:06,556 INFO L276 IsEmpty]: Start isEmpty. Operand 38897 states and 57648 transitions. [2020-12-23 09:54:06,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-12-23 09:54:06,558 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:54:06,558 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:54:06,559 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 09:54:06,559 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:54:06,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:54:06,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1624392677, now seen corresponding path program 1 times [2020-12-23 09:54:06,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:54:06,560 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31268511] [2020-12-23 09:54:06,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:54:06,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:54:06,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:54:06,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31268511] [2020-12-23 09:54:06,615 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:54:06,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:54:06,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858843672] [2020-12-23 09:54:06,616 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:54:06,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:54:06,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:54:06,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:54:06,617 INFO L87 Difference]: Start difference. First operand 38897 states and 57648 transitions. Second operand 3 states. [2020-12-23 09:54:09,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:54:09,206 INFO L93 Difference]: Finished difference Result 78264 states and 116406 transitions. [2020-12-23 09:54:09,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:54:09,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-12-23 09:54:09,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:54:09,397 INFO L225 Difference]: With dead ends: 78264 [2020-12-23 09:54:09,397 INFO L226 Difference]: Without dead ends: 56469 [2020-12-23 09:54:09,442 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:54:09,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56469 states. [2020-12-23 09:54:11,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56469 to 56467. [2020-12-23 09:54:11,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56467 states. [2020-12-23 09:54:12,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56467 states to 56467 states and 83186 transitions. [2020-12-23 09:54:12,032 INFO L78 Accepts]: Start accepts. Automaton has 56467 states and 83186 transitions. Word has length 86 [2020-12-23 09:54:12,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:54:12,033 INFO L481 AbstractCegarLoop]: Abstraction has 56467 states and 83186 transitions. [2020-12-23 09:54:12,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:54:12,033 INFO L276 IsEmpty]: Start isEmpty. Operand 56467 states and 83186 transitions. [2020-12-23 09:54:12,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-12-23 09:54:12,064 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:54:12,065 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:54:12,065 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 09:54:12,065 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:54:12,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:54:12,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1174390705, now seen corresponding path program 1 times [2020-12-23 09:54:12,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:54:12,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40873979] [2020-12-23 09:54:12,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:54:12,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:54:12,271 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-23 09:54:12,272 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40873979] [2020-12-23 09:54:12,272 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:54:12,272 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 09:54:12,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733978633] [2020-12-23 09:54:12,273 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 09:54:12,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:54:12,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 09:54:12,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:54:12,274 INFO L87 Difference]: Start difference. First operand 56467 states and 83186 transitions. Second operand 8 states. [2020-12-23 09:54:17,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:54:17,188 INFO L93 Difference]: Finished difference Result 148721 states and 221369 transitions. [2020-12-23 09:54:17,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 09:54:17,189 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 116 [2020-12-23 09:54:17,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:54:17,409 INFO L225 Difference]: With dead ends: 148721 [2020-12-23 09:54:17,409 INFO L226 Difference]: Without dead ends: 123999 [2020-12-23 09:54:17,496 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2020-12-23 09:54:17,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123999 states. [2020-12-23 09:54:21,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123999 to 79219. [2020-12-23 09:54:21,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79219 states. [2020-12-23 09:54:21,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79219 states to 79219 states and 116786 transitions. [2020-12-23 09:54:21,705 INFO L78 Accepts]: Start accepts. Automaton has 79219 states and 116786 transitions. Word has length 116 [2020-12-23 09:54:21,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:54:21,706 INFO L481 AbstractCegarLoop]: Abstraction has 79219 states and 116786 transitions. [2020-12-23 09:54:21,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 09:54:21,706 INFO L276 IsEmpty]: Start isEmpty. Operand 79219 states and 116786 transitions. [2020-12-23 09:54:21,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-12-23 09:54:21,744 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:54:21,744 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:54:21,744 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 09:54:21,745 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:54:21,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:54:21,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1916811329, now seen corresponding path program 1 times [2020-12-23 09:54:21,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:54:21,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078181469] [2020-12-23 09:54:21,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:54:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:54:21,832 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:54:21,833 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078181469] [2020-12-23 09:54:21,833 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:54:21,833 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:54:21,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409664864] [2020-12-23 09:54:21,834 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:54:21,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:54:21,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:54:21,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:54:21,835 INFO L87 Difference]: Start difference. First operand 79219 states and 116786 transitions. Second operand 3 states. [2020-12-23 09:54:27,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:54:27,418 INFO L93 Difference]: Finished difference Result 188351 states and 277653 transitions. [2020-12-23 09:54:27,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:54:27,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2020-12-23 09:54:27,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:54:27,626 INFO L225 Difference]: With dead ends: 188351 [2020-12-23 09:54:27,626 INFO L226 Difference]: Without dead ends: 128637 [2020-12-23 09:54:27,680 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 [2020-12-23 09:54:27,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128637 states. [2020-12-23 09:54:33,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128637 to 123339. [2020-12-23 09:54:33,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123339 states. [2020-12-23 09:54:33,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123339 states to 123339 states and 180323 transitions. [2020-12-23 09:54:33,983 INFO L78 Accepts]: Start accepts. Automaton has 123339 states and 180323 transitions. Word has length 116 [2020-12-23 09:54:33,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:54:33,984 INFO L481 AbstractCegarLoop]: Abstraction has 123339 states and 180323 transitions. [2020-12-23 09:54:33,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:54:33,984 INFO L276 IsEmpty]: Start isEmpty. Operand 123339 states and 180323 transitions. [2020-12-23 09:54:34,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-12-23 09:54:34,029 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:54:34,029 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:54:34,030 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 09:54:34,030 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:54:34,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:54:34,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1894740177, now seen corresponding path program 1 times [2020-12-23 09:54:34,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:54:34,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902349132] [2020-12-23 09:54:34,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:54:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:54:34,094 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:54:34,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902349132] [2020-12-23 09:54:34,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:54:34,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:54:34,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083324601] [2020-12-23 09:54:34,095 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:54:34,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:54:34,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:54:34,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:54:34,096 INFO L87 Difference]: Start difference. First operand 123339 states and 180323 transitions. Second operand 3 states. [2020-12-23 09:54:42,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:54:42,024 INFO L93 Difference]: Finished difference Result 277866 states and 405635 transitions. [2020-12-23 09:54:42,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:54:42,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2020-12-23 09:54:42,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:54:42,324 INFO L225 Difference]: With dead ends: 277866 [2020-12-23 09:54:42,324 INFO L226 Difference]: Without dead ends: 189592 [2020-12-23 09:54:42,564 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 [2020-12-23 09:54:42,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189592 states. [2020-12-23 09:54:51,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189592 to 183638. [2020-12-23 09:54:51,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183638 states. [2020-12-23 09:54:51,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183638 states to 183638 states and 265785 transitions. [2020-12-23 09:54:51,664 INFO L78 Accepts]: Start accepts. Automaton has 183638 states and 265785 transitions. Word has length 116 [2020-12-23 09:54:51,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:54:51,664 INFO L481 AbstractCegarLoop]: Abstraction has 183638 states and 265785 transitions. [2020-12-23 09:54:51,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:54:51,665 INFO L276 IsEmpty]: Start isEmpty. Operand 183638 states and 265785 transitions. [2020-12-23 09:54:52,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-12-23 09:54:52,024 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:54:52,024 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:54:52,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 09:54:52,025 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:54:52,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:54:52,025 INFO L82 PathProgramCache]: Analyzing trace with hash 414282081, now seen corresponding path program 1 times [2020-12-23 09:54:52,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:54:52,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788837471] [2020-12-23 09:54:52,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:54:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:54:52,113 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:54:52,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788837471] [2020-12-23 09:54:52,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:54:52,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:54:52,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275313711] [2020-12-23 09:54:52,115 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:54:52,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:54:52,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:54:52,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:54:52,116 INFO L87 Difference]: Start difference. First operand 183638 states and 265785 transitions. Second operand 3 states. [2020-12-23 09:55:03,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:55:03,044 INFO L93 Difference]: Finished difference Result 373018 states and 538599 transitions. [2020-12-23 09:55:03,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:55:03,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2020-12-23 09:55:03,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:55:03,644 INFO L225 Difference]: With dead ends: 373018 [2020-12-23 09:55:03,644 INFO L226 Difference]: Without dead ends: 257048 [2020-12-23 09:55:03,765 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 [2020-12-23 09:55:03,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257048 states. [2020-12-23 09:55:15,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257048 to 245070. [2020-12-23 09:55:15,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245070 states. [2020-12-23 09:55:16,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245070 states to 245070 states and 350917 transitions. [2020-12-23 09:55:16,827 INFO L78 Accepts]: Start accepts. Automaton has 245070 states and 350917 transitions. Word has length 116 [2020-12-23 09:55:16,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:55:16,828 INFO L481 AbstractCegarLoop]: Abstraction has 245070 states and 350917 transitions. [2020-12-23 09:55:16,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:55:16,840 INFO L276 IsEmpty]: Start isEmpty. Operand 245070 states and 350917 transitions. [2020-12-23 09:55:16,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-12-23 09:55:16,888 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:55:16,888 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:55:16,888 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 09:55:16,889 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:55:16,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:55:16,889 INFO L82 PathProgramCache]: Analyzing trace with hash 841628145, now seen corresponding path program 1 times [2020-12-23 09:55:16,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:55:16,890 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223969880] [2020-12-23 09:55:16,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:55:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:55:16,954 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:55:16,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223969880] [2020-12-23 09:55:16,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:55:16,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:55:16,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911587753] [2020-12-23 09:55:16,956 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:55:16,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:55:16,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:55:16,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:55:16,957 INFO L87 Difference]: Start difference. First operand 245070 states and 350917 transitions. Second operand 3 states. [2020-12-23 09:55:29,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:55:29,527 INFO L93 Difference]: Finished difference Result 396088 states and 564875 transitions. [2020-12-23 09:55:29,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:55:29,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2020-12-23 09:55:29,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:55:29,970 INFO L225 Difference]: With dead ends: 396088 [2020-12-23 09:55:29,970 INFO L226 Difference]: Without dead ends: 256222 [2020-12-23 09:55:30,319 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 [2020-12-23 09:55:30,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256222 states.