/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.ufo.BOUNDED-12.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 09:53:59,876 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 09:53:59,884 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 09:53:59,935 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 09:53:59,936 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 09:53:59,942 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 09:53:59,946 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 09:53:59,952 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 09:53:59,956 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 09:53:59,962 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 09:53:59,966 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 09:53:59,968 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 09:53:59,968 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 09:53:59,971 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 09:53:59,973 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 09:53:59,975 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 09:53:59,976 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 09:53:59,979 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 09:53:59,986 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 09:53:59,994 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 09:53:59,996 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 09:53:59,998 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 09:54:00,016 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 09:54:00,019 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 09:54:00,028 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 09:54:00,028 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 09:54:00,028 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 09:54:00,030 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 09:54:00,031 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 09:54:00,032 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 09:54:00,032 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 09:54:00,033 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 09:54:00,035 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 09:54:00,036 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 09:54:00,037 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 09:54:00,037 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 09:54:00,037 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 09:54:00,044 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 09:54:00,045 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 09:54:00,046 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 09:54:00,047 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 09:54:00,048 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:54:00,098 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 09:54:00,099 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 09:54:00,103 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 09:54:00,103 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 09:54:00,103 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 09:54:00,104 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 09:54:00,104 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 09:54:00,104 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 09:54:00,104 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 09:54:00,104 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 09:54:00,105 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 09:54:00,106 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 09:54:00,106 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 09:54:00,106 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 09:54:00,107 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 09:54:00,107 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 09:54:00,107 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 09:54:00,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 09:54:00,107 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 09:54:00,107 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 09:54:00,108 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 09:54:00,108 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 09:54:00,108 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 09:54:00,108 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 09:54:00,108 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 09:54:00,108 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:54:00,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 09:54:00,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 09:54:00,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 09:54:00,550 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 09:54:00,551 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 09:54:00,552 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.ufo.BOUNDED-12.pals.c [2020-12-23 09:54:00,648 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/dffdfad60/ad0b0f4d0f0a4e80ae4d77038bfeaf2b/FLAGc163b4b73 [2020-12-23 09:54:01,395 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 09:54:01,396 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c [2020-12-23 09:54:01,413 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/dffdfad60/ad0b0f4d0f0a4e80ae4d77038bfeaf2b/FLAGc163b4b73 [2020-12-23 09:54:01,705 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/dffdfad60/ad0b0f4d0f0a4e80ae4d77038bfeaf2b [2020-12-23 09:54:01,709 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 09:54:01,712 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 09:54:01,716 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 09:54:01,716 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 09:54:01,721 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 09:54:01,722 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:54:01" (1/1) ... [2020-12-23 09:54:01,723 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@155e52c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:54:01, skipping insertion in model container [2020-12-23 09:54:01,723 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:54:01" (1/1) ... [2020-12-23 09:54:01,732 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 09:54:01,771 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[~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[~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:54:02,025 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.ufo.BOUNDED-12.pals.c[16936,16949] [2020-12-23 09:54:02,029 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:54:02,041 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[~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[~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:54:02,154 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.ufo.BOUNDED-12.pals.c[16936,16949] [2020-12-23 09:54:02,158 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:54:02,198 INFO L208 MainTranslator]: Completed translation [2020-12-23 09:54:02,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:54:02 WrapperNode [2020-12-23 09:54:02,199 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 09:54:02,201 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 09:54:02,201 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 09:54:02,202 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 09:54:02,213 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:54:02" (1/1) ... [2020-12-23 09:54:02,227 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:54:02" (1/1) ... [2020-12-23 09:54:02,273 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 09:54:02,274 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 09:54:02,274 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 09:54:02,275 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 09:54:02,284 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:54:02" (1/1) ... [2020-12-23 09:54:02,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:54:02" (1/1) ... [2020-12-23 09:54:02,289 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:54:02" (1/1) ... [2020-12-23 09:54:02,289 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:54:02" (1/1) ... [2020-12-23 09:54:02,301 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:54:02" (1/1) ... [2020-12-23 09:54:02,328 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:54:02" (1/1) ... [2020-12-23 09:54:02,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:54:02" (1/1) ... [2020-12-23 09:54:02,351 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 09:54:02,357 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 09:54:02,358 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 09:54:02,358 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 09:54:02,359 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:54:02" (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:54:02,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 09:54:02,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 09:54:02,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 09:54:02,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 09:54:03,601 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 09:54:03,602 INFO L299 CfgBuilder]: Removed 25 assume(true) statements. [2020-12-23 09:54:03,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:54:03 BoogieIcfgContainer [2020-12-23 09:54:03,604 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 09:54:03,654 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 09:54:03,655 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 09:54:03,659 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 09:54:03,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 09:54:01" (1/3) ... [2020-12-23 09:54:03,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45cfeefc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:54:03, skipping insertion in model container [2020-12-23 09:54:03,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:54:02" (2/3) ... [2020-12-23 09:54:03,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45cfeefc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:54:03, skipping insertion in model container [2020-12-23 09:54:03,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:54:03" (3/3) ... [2020-12-23 09:54:03,663 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c [2020-12-23 09:54:03,685 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 09:54:03,696 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 09:54:03,718 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 09:54:03,750 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 09:54:03,750 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 09:54:03,750 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 09:54:03,751 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 09:54:03,751 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 09:54:03,751 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 09:54:03,751 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 09:54:03,751 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 09:54:03,771 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states. [2020-12-23 09:54:03,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-23 09:54:03,781 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:54:03,782 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:54:03,783 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:54:03,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:54:03,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1929732074, now seen corresponding path program 1 times [2020-12-23 09:54:03,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:54:03,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390811180] [2020-12-23 09:54:03,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:54:04,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:54:04,188 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:04,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390811180] [2020-12-23 09:54:04,191 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:54:04,191 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:54:04,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169910956] [2020-12-23 09:54:04,201 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:54:04,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:54:04,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:54:04,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:54:04,226 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 5 states. [2020-12-23 09:54:04,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:54:04,434 INFO L93 Difference]: Finished difference Result 247 states and 408 transitions. [2020-12-23 09:54:04,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:54:04,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2020-12-23 09:54:04,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:54:04,452 INFO L225 Difference]: With dead ends: 247 [2020-12-23 09:54:04,452 INFO L226 Difference]: Without dead ends: 141 [2020-12-23 09:54:04,456 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:54:04,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-12-23 09:54:04,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2020-12-23 09:54:04,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-12-23 09:54:04,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 198 transitions. [2020-12-23 09:54:04,506 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 198 transitions. Word has length 37 [2020-12-23 09:54:04,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:54:04,507 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 198 transitions. [2020-12-23 09:54:04,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:54:04,507 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 198 transitions. [2020-12-23 09:54:04,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-12-23 09:54:04,510 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:54:04,511 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:54:04,511 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 09:54:04,511 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:54:04,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:54:04,512 INFO L82 PathProgramCache]: Analyzing trace with hash -2008203596, now seen corresponding path program 1 times [2020-12-23 09:54:04,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:54:04,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947759294] [2020-12-23 09:54:04,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:54:04,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:54:04,718 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:04,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947759294] [2020-12-23 09:54:04,718 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:54:04,719 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:54:04,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395220440] [2020-12-23 09:54:04,722 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:54:04,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:54:04,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:54:04,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:54:04,727 INFO L87 Difference]: Start difference. First operand 141 states and 198 transitions. Second operand 3 states. [2020-12-23 09:54:04,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:54:04,788 INFO L93 Difference]: Finished difference Result 317 states and 480 transitions. [2020-12-23 09:54:04,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:54:04,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2020-12-23 09:54:04,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:54:04,795 INFO L225 Difference]: With dead ends: 317 [2020-12-23 09:54:04,795 INFO L226 Difference]: Without dead ends: 223 [2020-12-23 09:54:04,797 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,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2020-12-23 09:54:04,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2020-12-23 09:54:04,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2020-12-23 09:54:04,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 327 transitions. [2020-12-23 09:54:04,818 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 327 transitions. Word has length 77 [2020-12-23 09:54:04,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:54:04,819 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 327 transitions. [2020-12-23 09:54:04,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:54:04,819 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 327 transitions. [2020-12-23 09:54:04,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-23 09:54:04,822 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:54:04,822 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:54:04,822 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 09:54:04,822 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:54:04,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:54:04,823 INFO L82 PathProgramCache]: Analyzing trace with hash 823495780, now seen corresponding path program 1 times [2020-12-23 09:54:04,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:54:04,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660507360] [2020-12-23 09:54:04,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:54:04,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:54:04,951 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:04,951 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660507360] [2020-12-23 09:54:04,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:54:04,952 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:54:04,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385460717] [2020-12-23 09:54:04,953 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:54:04,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:54:04,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:54:04,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:54:04,958 INFO L87 Difference]: Start difference. First operand 221 states and 327 transitions. Second operand 3 states. [2020-12-23 09:54:05,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:54:05,040 INFO L93 Difference]: Finished difference Result 545 states and 847 transitions. [2020-12-23 09:54:05,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:54:05,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2020-12-23 09:54:05,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:54:05,055 INFO L225 Difference]: With dead ends: 545 [2020-12-23 09:54:05,055 INFO L226 Difference]: Without dead ends: 371 [2020-12-23 09:54:05,057 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:05,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2020-12-23 09:54:05,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 369. [2020-12-23 09:54:05,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2020-12-23 09:54:05,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 564 transitions. [2020-12-23 09:54:05,122 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 564 transitions. Word has length 78 [2020-12-23 09:54:05,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:54:05,122 INFO L481 AbstractCegarLoop]: Abstraction has 369 states and 564 transitions. [2020-12-23 09:54:05,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:54:05,123 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 564 transitions. [2020-12-23 09:54:05,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-12-23 09:54:05,127 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:54:05,127 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:54:05,127 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 09:54:05,128 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:54:05,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:54:05,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1276515004, now seen corresponding path program 1 times [2020-12-23 09:54:05,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:54:05,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960324159] [2020-12-23 09:54:05,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:54:05,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:54:05,367 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:05,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960324159] [2020-12-23 09:54:05,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:54:05,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:54:05,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525938620] [2020-12-23 09:54:05,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:54:05,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:54:05,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:54:05,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:54:05,370 INFO L87 Difference]: Start difference. First operand 369 states and 564 transitions. Second operand 3 states. [2020-12-23 09:54:05,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:54:05,420 INFO L93 Difference]: Finished difference Result 965 states and 1518 transitions. [2020-12-23 09:54:05,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:54:05,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2020-12-23 09:54:05,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:54:05,426 INFO L225 Difference]: With dead ends: 965 [2020-12-23 09:54:05,427 INFO L226 Difference]: Without dead ends: 643 [2020-12-23 09:54:05,430 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:05,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2020-12-23 09:54:05,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 641. [2020-12-23 09:54:05,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2020-12-23 09:54:05,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 996 transitions. [2020-12-23 09:54:05,474 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 996 transitions. Word has length 79 [2020-12-23 09:54:05,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:54:05,475 INFO L481 AbstractCegarLoop]: Abstraction has 641 states and 996 transitions. [2020-12-23 09:54:05,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:54:05,475 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 996 transitions. [2020-12-23 09:54:05,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-12-23 09:54:05,477 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:54:05,477 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:54:05,478 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 09:54:05,480 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:54:05,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:54:05,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1327982836, now seen corresponding path program 1 times [2020-12-23 09:54:05,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:54:05,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446172783] [2020-12-23 09:54:05,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:54:05,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:54:05,667 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:05,667 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446172783] [2020-12-23 09:54:05,667 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:54:05,668 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:54:05,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840662663] [2020-12-23 09:54:05,669 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:54:05,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:54:05,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:54:05,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:54:05,670 INFO L87 Difference]: Start difference. First operand 641 states and 996 transitions. Second operand 3 states. [2020-12-23 09:54:05,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:54:05,735 INFO L93 Difference]: Finished difference Result 1733 states and 2734 transitions. [2020-12-23 09:54:05,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:54:05,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2020-12-23 09:54:05,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:54:05,744 INFO L225 Difference]: With dead ends: 1733 [2020-12-23 09:54:05,744 INFO L226 Difference]: Without dead ends: 1139 [2020-12-23 09:54:05,747 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:05,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2020-12-23 09:54:05,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1137. [2020-12-23 09:54:05,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1137 states. [2020-12-23 09:54:05,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1776 transitions. [2020-12-23 09:54:05,800 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1776 transitions. Word has length 80 [2020-12-23 09:54:05,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:54:05,801 INFO L481 AbstractCegarLoop]: Abstraction has 1137 states and 1776 transitions. [2020-12-23 09:54:05,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:54:05,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1776 transitions. [2020-12-23 09:54:05,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-12-23 09:54:05,802 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:54:05,803 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:54:05,803 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 09:54:05,803 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:54:05,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:54:05,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1219881940, now seen corresponding path program 1 times [2020-12-23 09:54:05,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:54:05,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964152994] [2020-12-23 09:54:05,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:54:05,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:54:05,920 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:05,920 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964152994] [2020-12-23 09:54:05,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:54:05,921 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:54:05,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237182568] [2020-12-23 09:54:05,922 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:54:05,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:54:05,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:54:05,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:54:05,925 INFO L87 Difference]: Start difference. First operand 1137 states and 1776 transitions. Second operand 3 states. [2020-12-23 09:54:06,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:54:06,003 INFO L93 Difference]: Finished difference Result 3125 states and 4914 transitions. [2020-12-23 09:54:06,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:54:06,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2020-12-23 09:54:06,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:54:06,022 INFO L225 Difference]: With dead ends: 3125 [2020-12-23 09:54:06,022 INFO L226 Difference]: Without dead ends: 2035 [2020-12-23 09:54:06,025 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:54:06,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2035 states. [2020-12-23 09:54:06,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2035 to 2033. [2020-12-23 09:54:06,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2033 states. [2020-12-23 09:54:06,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2033 states to 2033 states and 3168 transitions. [2020-12-23 09:54:06,159 INFO L78 Accepts]: Start accepts. Automaton has 2033 states and 3168 transitions. Word has length 81 [2020-12-23 09:54:06,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:54:06,159 INFO L481 AbstractCegarLoop]: Abstraction has 2033 states and 3168 transitions. [2020-12-23 09:54:06,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:54:06,160 INFO L276 IsEmpty]: Start isEmpty. Operand 2033 states and 3168 transitions. [2020-12-23 09:54:06,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-12-23 09:54:06,161 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:54:06,161 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:54:06,161 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 09:54:06,162 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:54:06,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:54:06,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1035004540, now seen corresponding path program 1 times [2020-12-23 09:54:06,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:54:06,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955841370] [2020-12-23 09:54:06,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:54:06,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:54:06,243 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,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955841370] [2020-12-23 09:54:06,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:54:06,244 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:54:06,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443058366] [2020-12-23 09:54:06,244 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:54:06,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:54:06,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:54:06,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:54:06,246 INFO L87 Difference]: Start difference. First operand 2033 states and 3168 transitions. Second operand 3 states. [2020-12-23 09:54:06,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:54:06,362 INFO L93 Difference]: Finished difference Result 5621 states and 8770 transitions. [2020-12-23 09:54:06,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:54:06,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2020-12-23 09:54:06,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:54:06,383 INFO L225 Difference]: With dead ends: 5621 [2020-12-23 09:54:06,383 INFO L226 Difference]: Without dead ends: 3635 [2020-12-23 09:54:06,387 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:06,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3635 states. [2020-12-23 09:54:06,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3635 to 3633. [2020-12-23 09:54:06,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3633 states. [2020-12-23 09:54:06,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 3633 states and 5616 transitions. [2020-12-23 09:54:06,546 INFO L78 Accepts]: Start accepts. Automaton has 3633 states and 5616 transitions. Word has length 82 [2020-12-23 09:54:06,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:54:06,546 INFO L481 AbstractCegarLoop]: Abstraction has 3633 states and 5616 transitions. [2020-12-23 09:54:06,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:54:06,547 INFO L276 IsEmpty]: Start isEmpty. Operand 3633 states and 5616 transitions. [2020-12-23 09:54:06,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-12-23 09:54:06,548 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:54:06,549 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:54:06,549 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 09:54:06,549 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:54:06,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:54:06,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1846622820, now seen corresponding path program 1 times [2020-12-23 09:54:06,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:54:06,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743156083] [2020-12-23 09:54:06,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:54:06,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:54:07,036 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:07,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743156083] [2020-12-23 09:54:07,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:54:07,038 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 09:54:07,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527018190] [2020-12-23 09:54:07,039 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 09:54:07,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:54:07,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 09:54:07,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:54:07,041 INFO L87 Difference]: Start difference. First operand 3633 states and 5616 transitions. Second operand 8 states. [2020-12-23 09:54:08,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:54:08,291 INFO L93 Difference]: Finished difference Result 22653 states and 34710 transitions. [2020-12-23 09:54:08,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 09:54:08,292 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2020-12-23 09:54:08,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:54:08,446 INFO L225 Difference]: With dead ends: 22653 [2020-12-23 09:54:08,446 INFO L226 Difference]: Without dead ends: 19067 [2020-12-23 09:54:08,459 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:54:08,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19067 states. [2020-12-23 09:54:09,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19067 to 19057. [2020-12-23 09:54:09,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19057 states. [2020-12-23 09:54:09,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19057 states to 19057 states and 29072 transitions. [2020-12-23 09:54:09,531 INFO L78 Accepts]: Start accepts. Automaton has 19057 states and 29072 transitions. Word has length 83 [2020-12-23 09:54:09,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:54:09,531 INFO L481 AbstractCegarLoop]: Abstraction has 19057 states and 29072 transitions. [2020-12-23 09:54:09,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 09:54:09,532 INFO L276 IsEmpty]: Start isEmpty. Operand 19057 states and 29072 transitions. [2020-12-23 09:54:09,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-23 09:54:09,535 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:54:09,536 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:54:09,536 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 09:54:09,536 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:54:09,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:54:09,537 INFO L82 PathProgramCache]: Analyzing trace with hash -927768561, now seen corresponding path program 1 times [2020-12-23 09:54:09,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:54:09,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000974902] [2020-12-23 09:54:09,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:54:09,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:54:09,924 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:09,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000974902] [2020-12-23 09:54:09,930 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:54:09,930 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 09:54:09,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782718424] [2020-12-23 09:54:09,930 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 09:54:09,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:54:09,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 09:54:09,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:54:09,936 INFO L87 Difference]: Start difference. First operand 19057 states and 29072 transitions. Second operand 8 states. [2020-12-23 09:54:13,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:54:13,552 INFO L93 Difference]: Finished difference Result 106847 states and 163447 transitions. [2020-12-23 09:54:13,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 09:54:13,553 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2020-12-23 09:54:13,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:54:13,927 INFO L225 Difference]: With dead ends: 106847 [2020-12-23 09:54:13,927 INFO L226 Difference]: Without dead ends: 87837 [2020-12-23 09:54:14,002 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-12-23 09:54:14,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87837 states. [2020-12-23 09:54:16,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87837 to 38065. [2020-12-23 09:54:16,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38065 states. [2020-12-23 09:54:16,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38065 states to 38065 states and 57328 transitions. [2020-12-23 09:54:16,726 INFO L78 Accepts]: Start accepts. Automaton has 38065 states and 57328 transitions. Word has length 84 [2020-12-23 09:54:16,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:54:16,727 INFO L481 AbstractCegarLoop]: Abstraction has 38065 states and 57328 transitions. [2020-12-23 09:54:16,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 09:54:16,727 INFO L276 IsEmpty]: Start isEmpty. Operand 38065 states and 57328 transitions. [2020-12-23 09:54:16,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-12-23 09:54:16,728 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:54:16,728 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:16,729 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 09:54:16,729 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:54:16,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:54:16,730 INFO L82 PathProgramCache]: Analyzing trace with hash 920622579, now seen corresponding path program 1 times [2020-12-23 09:54:16,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:54:16,730 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701456440] [2020-12-23 09:54:16,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:54:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:54:16,927 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:16,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701456440] [2020-12-23 09:54:16,928 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:54:16,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 09:54:16,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151547720] [2020-12-23 09:54:16,929 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 09:54:16,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:54:16,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 09:54:16,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:54:16,930 INFO L87 Difference]: Start difference. First operand 38065 states and 57328 transitions. Second operand 8 states. [2020-12-23 09:54:20,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:54:20,151 INFO L93 Difference]: Finished difference Result 79155 states and 117681 transitions. [2020-12-23 09:54:20,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 09:54:20,151 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2020-12-23 09:54:20,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:54:20,302 INFO L225 Difference]: With dead ends: 79155 [2020-12-23 09:54:20,303 INFO L226 Difference]: Without dead ends: 79153 [2020-12-23 09:54:20,325 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2020-12-23 09:54:20,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79153 states. [2020-12-23 09:54:22,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79153 to 40369. [2020-12-23 09:54:22,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40369 states. [2020-12-23 09:54:22,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40369 states to 40369 states and 59632 transitions. [2020-12-23 09:54:22,814 INFO L78 Accepts]: Start accepts. Automaton has 40369 states and 59632 transitions. Word has length 85 [2020-12-23 09:54:22,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:54:22,814 INFO L481 AbstractCegarLoop]: Abstraction has 40369 states and 59632 transitions. [2020-12-23 09:54:22,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 09:54:22,814 INFO L276 IsEmpty]: Start isEmpty. Operand 40369 states and 59632 transitions. [2020-12-23 09:54:22,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-12-23 09:54:22,816 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:54:22,816 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:22,817 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 09:54:22,817 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:54:22,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:54:22,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1472892313, now seen corresponding path program 1 times [2020-12-23 09:54:22,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:54:22,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189892020] [2020-12-23 09:54:22,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:54:22,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:54:22,889 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:22,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189892020] [2020-12-23 09:54:22,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:54:22,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:54:22,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252839766] [2020-12-23 09:54:22,890 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:54:22,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:54:22,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:54:22,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:54:22,894 INFO L87 Difference]: Start difference. First operand 40369 states and 59632 transitions. Second operand 3 states. [2020-12-23 09:54:24,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:54:24,843 INFO L93 Difference]: Finished difference Result 98711 states and 145940 transitions. [2020-12-23 09:54:24,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:54:24,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-12-23 09:54:24,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:54:24,953 INFO L225 Difference]: With dead ends: 98711 [2020-12-23 09:54:24,953 INFO L226 Difference]: Without dead ends: 58389 [2020-12-23 09:54:25,012 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:25,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58389 states. [2020-12-23 09:54:27,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58389 to 58387. [2020-12-23 09:54:27,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58387 states. [2020-12-23 09:54:27,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58387 states to 58387 states and 86002 transitions. [2020-12-23 09:54:27,990 INFO L78 Accepts]: Start accepts. Automaton has 58387 states and 86002 transitions. Word has length 86 [2020-12-23 09:54:27,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:54:27,991 INFO L481 AbstractCegarLoop]: Abstraction has 58387 states and 86002 transitions. [2020-12-23 09:54:27,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:54:27,991 INFO L276 IsEmpty]: Start isEmpty. Operand 58387 states and 86002 transitions. [2020-12-23 09:54:28,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-12-23 09:54:28,024 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:54:28,024 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2020-12-23 09:54:28,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 09:54:28,025 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:54:28,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:54:28,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1072838691, now seen corresponding path program 1 times [2020-12-23 09:54:28,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:54:28,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722243978] [2020-12-23 09:54:28,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:54:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:54:28,414 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 09:54:28,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722243978] [2020-12-23 09:54:28,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898567618] [2020-12-23 09:54:28,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:54:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:54:28,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-23 09:54:28,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:54:29,180 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 09:54:29,181 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:54:29,181 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 7 [2020-12-23 09:54:29,181 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314433450] [2020-12-23 09:54:29,182 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 09:54:29,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:54:29,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 09:54:29,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:54:29,183 INFO L87 Difference]: Start difference. First operand 58387 states and 86002 transitions. Second operand 7 states. [2020-12-23 09:54:34,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:54:34,115 INFO L93 Difference]: Finished difference Result 144430 states and 213468 transitions. [2020-12-23 09:54:34,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:54:34,116 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2020-12-23 09:54:34,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:54:34,358 INFO L225 Difference]: With dead ends: 144430 [2020-12-23 09:54:34,358 INFO L226 Difference]: Without dead ends: 104108 [2020-12-23 09:54:34,568 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:54:34,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104108 states. [2020-12-23 09:54:39,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104108 to 96659. [2020-12-23 09:54:39,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96659 states. [2020-12-23 09:54:39,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96659 states to 96659 states and 141874 transitions. [2020-12-23 09:54:39,617 INFO L78 Accepts]: Start accepts. Automaton has 96659 states and 141874 transitions. Word has length 117 [2020-12-23 09:54:39,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:54:39,617 INFO L481 AbstractCegarLoop]: Abstraction has 96659 states and 141874 transitions. [2020-12-23 09:54:39,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 09:54:39,617 INFO L276 IsEmpty]: Start isEmpty. Operand 96659 states and 141874 transitions. [2020-12-23 09:54:39,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-12-23 09:54:39,666 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:54:39,667 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:54:39,880 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-12-23 09:54:39,882 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:54:39,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:54:39,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1628565047, now seen corresponding path program 1 times [2020-12-23 09:54:39,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:54:39,883 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823672118] [2020-12-23 09:54:39,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:54:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:54:39,978 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:54:39,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823672118] [2020-12-23 09:54:39,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:54:39,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:54:39,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51614424] [2020-12-23 09:54:39,985 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:54:39,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:54:39,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:54:39,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:54:39,986 INFO L87 Difference]: Start difference. First operand 96659 states and 141874 transitions. Second operand 3 states. [2020-12-23 09:54:46,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:54:46,734 INFO L93 Difference]: Finished difference Result 257623 states and 377716 transitions. [2020-12-23 09:54:46,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:54:46,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2020-12-23 09:54:46,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:54:47,082 INFO L225 Difference]: With dead ends: 257623 [2020-12-23 09:54:47,082 INFO L226 Difference]: Without dead ends: 174101 [2020-12-23 09:54:47,156 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:47,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174101 states. [2020-12-23 09:54:55,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174101 to 174099. [2020-12-23 09:54:55,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174099 states. [2020-12-23 09:54:55,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174099 states to 174099 states and 253074 transitions. [2020-12-23 09:54:55,770 INFO L78 Accepts]: Start accepts. Automaton has 174099 states and 253074 transitions. Word has length 118 [2020-12-23 09:54:55,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:54:55,770 INFO L481 AbstractCegarLoop]: Abstraction has 174099 states and 253074 transitions. [2020-12-23 09:54:55,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:54:55,771 INFO L276 IsEmpty]: Start isEmpty. Operand 174099 states and 253074 transitions. [2020-12-23 09:54:55,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-12-23 09:54:55,805 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:54:55,805 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:54:55,805 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 09:54:55,805 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:54:55,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:54:55,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1618503993, now seen corresponding path program 1 times [2020-12-23 09:54:55,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:54:55,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599642964] [2020-12-23 09:54:55,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:54:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:54:55,988 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-23 09:54:55,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599642964] [2020-12-23 09:54:55,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:54:55,989 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 09:54:55,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874142065] [2020-12-23 09:54:55,989 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 09:54:55,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:54:55,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 09:54:55,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:54:55,991 INFO L87 Difference]: Start difference. First operand 174099 states and 253074 transitions. Second operand 8 states. [2020-12-23 09:55:12,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:55:12,433 INFO L93 Difference]: Finished difference Result 480433 states and 704057 transitions. [2020-12-23 09:55:12,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 09:55:12,434 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 118 [2020-12-23 09:55:12,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:55:13,311 INFO L225 Difference]: With dead ends: 480433 [2020-12-23 09:55:13,312 INFO L226 Difference]: Without dead ends: 398511 [2020-12-23 09:55:13,479 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2020-12-23 09:55:13,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398511 states. [2020-12-23 09:55:26,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398511 to 248547. [2020-12-23 09:55:26,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248547 states. [2020-12-23 09:55:27,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248547 states to 248547 states and 361170 transitions. [2020-12-23 09:55:27,620 INFO L78 Accepts]: Start accepts. Automaton has 248547 states and 361170 transitions. Word has length 118 [2020-12-23 09:55:27,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:55:27,621 INFO L481 AbstractCegarLoop]: Abstraction has 248547 states and 361170 transitions. [2020-12-23 09:55:27,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 09:55:27,622 INFO L276 IsEmpty]: Start isEmpty. Operand 248547 states and 361170 transitions. [2020-12-23 09:55:27,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-12-23 09:55:27,675 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:55:27,676 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:55:27,676 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 09:55:27,676 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:55:27,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:55:27,677 INFO L82 PathProgramCache]: Analyzing trace with hash -876083369, now seen corresponding path program 1 times [2020-12-23 09:55:27,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:55:27,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065953654] [2020-12-23 09:55:27,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:55:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:55:27,759 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:55:27,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065953654] [2020-12-23 09:55:27,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:55:27,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:55:27,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259326720] [2020-12-23 09:55:27,761 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:55:27,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:55:27,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:55:27,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:55:27,762 INFO L87 Difference]: Start difference. First operand 248547 states and 361170 transitions. Second operand 3 states. [2020-12-23 09:55:45,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:55:45,342 INFO L93 Difference]: Finished difference Result 606480 states and 880914 transitions. [2020-12-23 09:55:45,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:55:45,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2020-12-23 09:55:45,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:55:46,195 INFO L225 Difference]: With dead ends: 606480 [2020-12-23 09:55:46,195 INFO L226 Difference]: Without dead ends: 410638 [2020-12-23 09:55:46,378 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:46,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410638 states. [2020-12-23 09:56:05,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410638 to 393228. [2020-12-23 09:56:05,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393228 states. [2020-12-23 09:56:07,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393228 states to 393228 states and 566536 transitions. [2020-12-23 09:56:07,016 INFO L78 Accepts]: Start accepts. Automaton has 393228 states and 566536 transitions. Word has length 118 [2020-12-23 09:56:07,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:56:07,017 INFO L481 AbstractCegarLoop]: Abstraction has 393228 states and 566536 transitions. [2020-12-23 09:56:07,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:56:07,017 INFO L276 IsEmpty]: Start isEmpty. Operand 393228 states and 566536 transitions. [2020-12-23 09:56:07,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-12-23 09:56:07,065 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:56:07,066 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:56:07,066 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 09:56:07,066 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:56:07,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:56:07,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1916354679, now seen corresponding path program 1 times [2020-12-23 09:56:07,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:56:07,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524537142] [2020-12-23 09:56:07,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:56:07,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:56:07,763 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:56:07,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524537142] [2020-12-23 09:56:07,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:56:07,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:56:07,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361975673] [2020-12-23 09:56:07,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:56:07,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:56:07,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:56:07,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:56:07,766 INFO L87 Difference]: Start difference. First operand 393228 states and 566536 transitions. Second operand 3 states. [2020-12-23 09:56:32,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:56:32,460 INFO L93 Difference]: Finished difference Result 735818 states and 1059934 transitions. [2020-12-23 09:56:32,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:56:32,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2020-12-23 09:56:32,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:56:33,650 INFO L225 Difference]: With dead ends: 735818 [2020-12-23 09:56:33,650 INFO L226 Difference]: Without dead ends: 539016 [2020-12-23 09:56:33,923 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:56:34,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539016 states.