/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.8.1.ufo.BOUNDED-16.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:53:54,419 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:53:54,424 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:53:54,478 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:53:54,479 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:53:54,483 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:53:54,487 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:53:54,492 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:53:54,496 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:53:54,502 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:53:54,506 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:53:54,507 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:53:54,507 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:53:54,510 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:53:54,512 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:53:54,514 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:53:54,516 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:53:54,519 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:53:54,526 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:53:54,534 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:53:54,536 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:53:54,538 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:53:54,539 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:53:54,542 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:53:54,550 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:53:54,551 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:53:54,551 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:53:54,553 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:53:54,554 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:53:54,555 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:53:54,555 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:53:54,556 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:53:54,558 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:53:54,559 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:53:54,560 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:53:54,560 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:53:54,561 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:53:54,569 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:53:54,579 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:53:54,580 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:53:54,590 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:53:54,591 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 19:53:54,645 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:53:54,645 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:53:54,647 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:53:54,647 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:53:54,647 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:53:54,647 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:53:54,648 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:53:54,648 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:53:54,648 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:53:54,648 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:53:54,648 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:53:54,649 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:53:54,649 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:53:54,649 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:53:54,649 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:53:54,649 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:53:54,650 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:53:54,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:53:54,650 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:53:54,650 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:53:54,650 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:53:54,651 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:53:54,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:53:54,651 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:53:54,651 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:53:54,651 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 19:53:55,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:53:55,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:53:55,042 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:53:55,044 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:53:55,044 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:53:55,045 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.8.1.ufo.BOUNDED-16.pals.c [2021-01-06 19:53:55,128 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/f8c605cfc/f92213882f8e47878de3bba7b501cb2c/FLAG78b22316b [2021-01-06 19:53:55,759 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:53:55,760 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.8.1.ufo.BOUNDED-16.pals.c [2021-01-06 19:53:55,777 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/f8c605cfc/f92213882f8e47878de3bba7b501cb2c/FLAG78b22316b [2021-01-06 19:53:55,996 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/f8c605cfc/f92213882f8e47878de3bba7b501cb2c [2021-01-06 19:53:55,999 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:53:56,002 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:53:56,007 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:53:56,007 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:53:56,016 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:53:56,017 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:53:55" (1/1) ... [2021-01-06 19:53:56,018 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60d73a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:53:56, skipping insertion in model container [2021-01-06 19:53:56,020 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:53:55" (1/1) ... [2021-01-06 19:53:56,031 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:53:56,114 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[~p8_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,] left hand side expression in assignment: lhs: VariableLHS[~m2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~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[~mode3~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[~mode4~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[~mode5~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[~mode6~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[~m7~0,] left hand side expression in assignment: lhs: VariableLHS[~m7~0,] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m8~0,] left hand side expression in assignment: lhs: VariableLHS[~m8~0,] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode8~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~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[~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[~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[~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[~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[~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[~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[~id7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode8~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[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_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[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] [2021-01-06 19:53:56,454 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.8.1.ufo.BOUNDED-16.pals.c[26490,26503] [2021-01-06 19:53:56,461 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:53:56,495 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[~p8_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,] left hand side expression in assignment: lhs: VariableLHS[~m2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~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[~mode3~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[~mode4~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[~mode5~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[~mode6~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[~m7~0,] left hand side expression in assignment: lhs: VariableLHS[~m7~0,] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m8~0,] left hand side expression in assignment: lhs: VariableLHS[~m8~0,] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode8~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~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[~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[~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[~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[~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[~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[~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[~id7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode8~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[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_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[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] [2021-01-06 19:53:56,639 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.8.1.ufo.BOUNDED-16.pals.c[26490,26503] [2021-01-06 19:53:56,640 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:53:56,665 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:53:56,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:53:56 WrapperNode [2021-01-06 19:53:56,666 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:53:56,667 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:53:56,667 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:53:56,667 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:53:56,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:53:56" (1/1) ... [2021-01-06 19:53:56,704 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:53:56" (1/1) ... [2021-01-06 19:53:56,754 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:53:56,755 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:53:56,756 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:53:56,756 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:53:56,779 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:53:56" (1/1) ... [2021-01-06 19:53:56,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:53:56" (1/1) ... [2021-01-06 19:53:56,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:53:56" (1/1) ... [2021-01-06 19:53:56,810 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:53:56" (1/1) ... [2021-01-06 19:53:56,831 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:53:56" (1/1) ... [2021-01-06 19:53:56,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:53:56" (1/1) ... [2021-01-06 19:53:56,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:53:56" (1/1) ... [2021-01-06 19:53:56,876 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:53:56,877 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:53:56,878 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:53:56,878 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:53:56,882 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:53:56" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:53:57,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:53:57,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:53:57,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:53:57,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:53:57,957 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:53:57,958 INFO L299 CfgBuilder]: Removed 29 assume(true) statements. [2021-01-06 19:53:57,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:53:57 BoogieIcfgContainer [2021-01-06 19:53:57,960 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:53:57,962 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:53:57,962 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:53:57,966 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:53:57,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:53:55" (1/3) ... [2021-01-06 19:53:57,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4989935c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:53:57, skipping insertion in model container [2021-01-06 19:53:57,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:53:56" (2/3) ... [2021-01-06 19:53:57,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4989935c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:53:57, skipping insertion in model container [2021-01-06 19:53:57,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:53:57" (3/3) ... [2021-01-06 19:53:57,970 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.BOUNDED-16.pals.c [2021-01-06 19:53:57,977 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:53:57,986 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:53:58,006 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:53:58,038 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:53:58,038 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:53:58,039 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:53:58,039 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:53:58,039 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:53:58,039 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:53:58,039 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:53:58,039 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:53:58,075 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states. [2021-01-06 19:53:58,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-01-06 19:53:58,091 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:58,102 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] [2021-01-06 19:53:58,109 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:58,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:58,127 INFO L82 PathProgramCache]: Analyzing trace with hash -486996250, now seen corresponding path program 1 times [2021-01-06 19:53:58,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:58,152 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478029326] [2021-01-06 19:53:58,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:58,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:53:58,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478029326] [2021-01-06 19:53:58,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:58,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:53:58,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649009644] [2021-01-06 19:53:58,586 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-06 19:53:58,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:58,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-06 19:53:58,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 19:53:58,611 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 2 states. [2021-01-06 19:53:58,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:58,675 INFO L93 Difference]: Finished difference Result 228 states and 384 transitions. [2021-01-06 19:53:58,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-06 19:53:58,677 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 45 [2021-01-06 19:53:58,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:58,706 INFO L225 Difference]: With dead ends: 228 [2021-01-06 19:53:58,706 INFO L226 Difference]: Without dead ends: 143 [2021-01-06 19:53:58,712 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 19:53:58,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-01-06 19:53:58,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2021-01-06 19:53:58,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2021-01-06 19:53:58,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 249 transitions. [2021-01-06 19:53:58,792 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 249 transitions. Word has length 45 [2021-01-06 19:53:58,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:58,793 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 249 transitions. [2021-01-06 19:53:58,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-06 19:53:58,793 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 249 transitions. [2021-01-06 19:53:58,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-01-06 19:53:58,799 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:58,800 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] [2021-01-06 19:53:58,801 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:53:58,801 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:58,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:58,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1858803548, now seen corresponding path program 1 times [2021-01-06 19:53:58,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:58,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147186967] [2021-01-06 19:53:58,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:59,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:53:59,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147186967] [2021-01-06 19:53:59,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:59,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:53:59,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977757375] [2021-01-06 19:53:59,139 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:53:59,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:59,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:53:59,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:53:59,143 INFO L87 Difference]: Start difference. First operand 143 states and 249 transitions. Second operand 5 states. [2021-01-06 19:53:59,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:59,368 INFO L93 Difference]: Finished difference Result 223 states and 374 transitions. [2021-01-06 19:53:59,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:53:59,369 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2021-01-06 19:53:59,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:59,374 INFO L225 Difference]: With dead ends: 223 [2021-01-06 19:53:59,375 INFO L226 Difference]: Without dead ends: 143 [2021-01-06 19:53:59,378 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 [2021-01-06 19:53:59,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-01-06 19:53:59,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2021-01-06 19:53:59,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2021-01-06 19:53:59,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 188 transitions. [2021-01-06 19:53:59,399 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 188 transitions. Word has length 45 [2021-01-06 19:53:59,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:59,400 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 188 transitions. [2021-01-06 19:53:59,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:53:59,401 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 188 transitions. [2021-01-06 19:53:59,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 19:53:59,409 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:59,410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:53:59,410 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:53:59,412 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:59,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:59,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1176555156, now seen corresponding path program 1 times [2021-01-06 19:53:59,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:59,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279665895] [2021-01-06 19:53:59,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:59,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:59,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:53:59,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279665895] [2021-01-06 19:53:59,697 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:59,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:53:59,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672310517] [2021-01-06 19:53:59,699 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:53:59,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:59,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:53:59,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:59,700 INFO L87 Difference]: Start difference. First operand 143 states and 188 transitions. Second operand 3 states. [2021-01-06 19:53:59,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:59,741 INFO L93 Difference]: Finished difference Result 289 states and 420 transitions. [2021-01-06 19:53:59,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:53:59,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2021-01-06 19:53:59,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:59,744 INFO L225 Difference]: With dead ends: 289 [2021-01-06 19:53:59,745 INFO L226 Difference]: Without dead ends: 213 [2021-01-06 19:53:59,746 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:59,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-01-06 19:53:59,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2021-01-06 19:53:59,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2021-01-06 19:53:59,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 297 transitions. [2021-01-06 19:53:59,780 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 297 transitions. Word has length 105 [2021-01-06 19:53:59,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:59,784 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 297 transitions. [2021-01-06 19:53:59,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:53:59,784 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 297 transitions. [2021-01-06 19:53:59,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 19:53:59,789 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:59,790 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:53:59,791 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:53:59,791 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:59,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:59,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1701405430, now seen corresponding path program 1 times [2021-01-06 19:53:59,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:59,792 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261603689] [2021-01-06 19:53:59,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:59,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:53:59,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261603689] [2021-01-06 19:53:59,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:59,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:53:59,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469679931] [2021-01-06 19:53:59,980 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:53:59,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:59,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:53:59,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:59,983 INFO L87 Difference]: Start difference. First operand 211 states and 297 transitions. Second operand 3 states. [2021-01-06 19:54:00,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:54:00,023 INFO L93 Difference]: Finished difference Result 487 states and 737 transitions. [2021-01-06 19:54:00,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:54:00,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2021-01-06 19:54:00,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:54:00,026 INFO L225 Difference]: With dead ends: 487 [2021-01-06 19:54:00,026 INFO L226 Difference]: Without dead ends: 343 [2021-01-06 19:54:00,028 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:54:00,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2021-01-06 19:54:00,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2021-01-06 19:54:00,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2021-01-06 19:54:00,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 504 transitions. [2021-01-06 19:54:00,067 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 504 transitions. Word has length 105 [2021-01-06 19:54:00,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:54:00,068 INFO L481 AbstractCegarLoop]: Abstraction has 341 states and 504 transitions. [2021-01-06 19:54:00,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:54:00,068 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 504 transitions. [2021-01-06 19:54:00,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 19:54:00,069 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:54:00,070 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:54:00,070 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:54:00,070 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:54:00,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:54:00,071 INFO L82 PathProgramCache]: Analyzing trace with hash -179136962, now seen corresponding path program 1 times [2021-01-06 19:54:00,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:54:00,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957201262] [2021-01-06 19:54:00,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:54:00,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:54:00,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:54:00,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957201262] [2021-01-06 19:54:00,180 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:54:00,180 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:54:00,180 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664344579] [2021-01-06 19:54:00,181 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:54:00,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:54:00,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:54:00,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:54:00,185 INFO L87 Difference]: Start difference. First operand 341 states and 504 transitions. Second operand 3 states. [2021-01-06 19:54:00,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:54:00,242 INFO L93 Difference]: Finished difference Result 865 states and 1338 transitions. [2021-01-06 19:54:00,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:54:00,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2021-01-06 19:54:00,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:54:00,248 INFO L225 Difference]: With dead ends: 865 [2021-01-06 19:54:00,249 INFO L226 Difference]: Without dead ends: 591 [2021-01-06 19:54:00,252 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:54:00,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2021-01-06 19:54:00,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 589. [2021-01-06 19:54:00,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2021-01-06 19:54:00,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 896 transitions. [2021-01-06 19:54:00,311 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 896 transitions. Word has length 105 [2021-01-06 19:54:00,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:54:00,312 INFO L481 AbstractCegarLoop]: Abstraction has 589 states and 896 transitions. [2021-01-06 19:54:00,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:54:00,315 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 896 transitions. [2021-01-06 19:54:00,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 19:54:00,316 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:54:00,316 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:54:00,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:54:00,317 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:54:00,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:54:00,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1430042254, now seen corresponding path program 1 times [2021-01-06 19:54:00,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:54:00,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820500093] [2021-01-06 19:54:00,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:54:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:54:00,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:54:00,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820500093] [2021-01-06 19:54:00,452 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:54:00,452 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:54:00,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928511582] [2021-01-06 19:54:00,453 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:54:00,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:54:00,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:54:00,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:54:00,455 INFO L87 Difference]: Start difference. First operand 589 states and 896 transitions. Second operand 3 states. [2021-01-06 19:54:00,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:54:00,521 INFO L93 Difference]: Finished difference Result 1585 states and 2474 transitions. [2021-01-06 19:54:00,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:54:00,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2021-01-06 19:54:00,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:54:00,536 INFO L225 Difference]: With dead ends: 1585 [2021-01-06 19:54:00,536 INFO L226 Difference]: Without dead ends: 1063 [2021-01-06 19:54:00,538 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:54:00,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2021-01-06 19:54:00,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1061. [2021-01-06 19:54:00,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1061 states. [2021-01-06 19:54:00,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1636 transitions. [2021-01-06 19:54:00,595 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1636 transitions. Word has length 105 [2021-01-06 19:54:00,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:54:00,596 INFO L481 AbstractCegarLoop]: Abstraction has 1061 states and 1636 transitions. [2021-01-06 19:54:00,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:54:00,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1636 transitions. [2021-01-06 19:54:00,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 19:54:00,597 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:54:00,598 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:54:00,598 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:54:00,598 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:54:00,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:54:00,599 INFO L82 PathProgramCache]: Analyzing trace with hash 2119342312, now seen corresponding path program 1 times [2021-01-06 19:54:00,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:54:00,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192106789] [2021-01-06 19:54:00,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:54:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:54:00,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:54:00,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192106789] [2021-01-06 19:54:00,725 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:54:00,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:54:00,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218880853] [2021-01-06 19:54:00,726 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:54:00,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:54:00,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:54:00,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:54:00,727 INFO L87 Difference]: Start difference. First operand 1061 states and 1636 transitions. Second operand 3 states. [2021-01-06 19:54:00,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:54:00,806 INFO L93 Difference]: Finished difference Result 2953 states and 4614 transitions. [2021-01-06 19:54:00,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:54:00,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2021-01-06 19:54:00,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:54:00,819 INFO L225 Difference]: With dead ends: 2953 [2021-01-06 19:54:00,820 INFO L226 Difference]: Without dead ends: 1959 [2021-01-06 19:54:00,822 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:54:00,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1959 states. [2021-01-06 19:54:00,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1959 to 1957. [2021-01-06 19:54:00,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1957 states. [2021-01-06 19:54:00,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1957 states to 1957 states and 3028 transitions. [2021-01-06 19:54:00,907 INFO L78 Accepts]: Start accepts. Automaton has 1957 states and 3028 transitions. Word has length 105 [2021-01-06 19:54:00,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:54:00,908 INFO L481 AbstractCegarLoop]: Abstraction has 1957 states and 3028 transitions. [2021-01-06 19:54:00,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:54:00,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1957 states and 3028 transitions. [2021-01-06 19:54:00,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 19:54:00,913 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:54:00,913 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:54:00,913 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:54:00,913 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:54:00,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:54:00,916 INFO L82 PathProgramCache]: Analyzing trace with hash 179311454, now seen corresponding path program 1 times [2021-01-06 19:54:00,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:54:00,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381261237] [2021-01-06 19:54:00,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:54:00,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:54:01,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:54:01,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381261237] [2021-01-06 19:54:01,058 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:54:01,058 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:54:01,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691761344] [2021-01-06 19:54:01,059 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:54:01,059 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:54:01,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:54:01,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:54:01,061 INFO L87 Difference]: Start difference. First operand 1957 states and 3028 transitions. Second operand 3 states. [2021-01-06 19:54:01,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:54:01,242 INFO L93 Difference]: Finished difference Result 5545 states and 8630 transitions. [2021-01-06 19:54:01,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:54:01,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2021-01-06 19:54:01,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:54:01,271 INFO L225 Difference]: With dead ends: 5545 [2021-01-06 19:54:01,272 INFO L226 Difference]: Without dead ends: 3655 [2021-01-06 19:54:01,275 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:54:01,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3655 states. [2021-01-06 19:54:01,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3655 to 3653. [2021-01-06 19:54:01,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3653 states. [2021-01-06 19:54:01,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3653 states to 3653 states and 5636 transitions. [2021-01-06 19:54:01,500 INFO L78 Accepts]: Start accepts. Automaton has 3653 states and 5636 transitions. Word has length 105 [2021-01-06 19:54:01,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:54:01,501 INFO L481 AbstractCegarLoop]: Abstraction has 3653 states and 5636 transitions. [2021-01-06 19:54:01,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:54:01,503 INFO L276 IsEmpty]: Start isEmpty. Operand 3653 states and 5636 transitions. [2021-01-06 19:54:01,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 19:54:01,504 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:54:01,504 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:54:01,505 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:54:01,505 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:54:01,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:54:01,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1414973228, now seen corresponding path program 1 times [2021-01-06 19:54:01,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:54:01,506 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981496821] [2021-01-06 19:54:01,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:54:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:54:01,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:54:01,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981496821] [2021-01-06 19:54:01,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:54:01,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:54:01,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918618587] [2021-01-06 19:54:01,705 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:54:01,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:54:01,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:54:01,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:54:01,707 INFO L87 Difference]: Start difference. First operand 3653 states and 5636 transitions. Second operand 6 states. [2021-01-06 19:54:02,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:54:02,230 INFO L93 Difference]: Finished difference Result 7239 states and 11205 transitions. [2021-01-06 19:54:02,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:54:02,230 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2021-01-06 19:54:02,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:54:02,251 INFO L225 Difference]: With dead ends: 7239 [2021-01-06 19:54:02,252 INFO L226 Difference]: Without dead ends: 3653 [2021-01-06 19:54:02,260 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:54:02,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3653 states. [2021-01-06 19:54:02,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3653 to 3653. [2021-01-06 19:54:02,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3653 states. [2021-01-06 19:54:02,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3653 states to 3653 states and 5604 transitions. [2021-01-06 19:54:02,462 INFO L78 Accepts]: Start accepts. Automaton has 3653 states and 5604 transitions. Word has length 105 [2021-01-06 19:54:02,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:54:02,462 INFO L481 AbstractCegarLoop]: Abstraction has 3653 states and 5604 transitions. [2021-01-06 19:54:02,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:54:02,462 INFO L276 IsEmpty]: Start isEmpty. Operand 3653 states and 5604 transitions. [2021-01-06 19:54:02,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 19:54:02,463 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:54:02,463 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:54:02,464 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:54:02,464 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:54:02,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:54:02,465 INFO L82 PathProgramCache]: Analyzing trace with hash -905500138, now seen corresponding path program 1 times [2021-01-06 19:54:02,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:54:02,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765014166] [2021-01-06 19:54:02,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:54:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:54:02,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:54:02,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765014166] [2021-01-06 19:54:02,631 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:54:02,631 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:54:02,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62406659] [2021-01-06 19:54:02,632 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:54:02,632 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:54:02,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:54:02,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:54:02,633 INFO L87 Difference]: Start difference. First operand 3653 states and 5604 transitions. Second operand 6 states. [2021-01-06 19:54:03,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:54:03,054 INFO L93 Difference]: Finished difference Result 7239 states and 11141 transitions. [2021-01-06 19:54:03,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:54:03,057 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2021-01-06 19:54:03,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:54:03,078 INFO L225 Difference]: With dead ends: 7239 [2021-01-06 19:54:03,078 INFO L226 Difference]: Without dead ends: 3653 [2021-01-06 19:54:03,085 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:54:03,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3653 states. [2021-01-06 19:54:03,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3653 to 3653. [2021-01-06 19:54:03,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3653 states. [2021-01-06 19:54:03,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3653 states to 3653 states and 5572 transitions. [2021-01-06 19:54:03,327 INFO L78 Accepts]: Start accepts. Automaton has 3653 states and 5572 transitions. Word has length 105 [2021-01-06 19:54:03,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:54:03,328 INFO L481 AbstractCegarLoop]: Abstraction has 3653 states and 5572 transitions. [2021-01-06 19:54:03,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:54:03,328 INFO L276 IsEmpty]: Start isEmpty. Operand 3653 states and 5572 transitions. [2021-01-06 19:54:03,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 19:54:03,329 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:54:03,329 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:54:03,329 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:54:03,330 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:54:03,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:54:03,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1180259752, now seen corresponding path program 1 times [2021-01-06 19:54:03,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:54:03,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331564611] [2021-01-06 19:54:03,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:54:03,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:54:03,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:54:03,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331564611] [2021-01-06 19:54:03,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:54:03,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 19:54:03,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669342958] [2021-01-06 19:54:03,591 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 19:54:03,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:54:03,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 19:54:03,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-01-06 19:54:03,594 INFO L87 Difference]: Start difference. First operand 3653 states and 5572 transitions. Second operand 10 states. [2021-01-06 19:54:07,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:54:07,005 INFO L93 Difference]: Finished difference Result 61029 states and 93652 transitions. [2021-01-06 19:54:07,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-06 19:54:07,005 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2021-01-06 19:54:07,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:54:07,233 INFO L225 Difference]: With dead ends: 61029 [2021-01-06 19:54:07,233 INFO L226 Difference]: Without dead ends: 57443 [2021-01-06 19:54:07,268 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2021-01-06 19:54:07,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57443 states. [2021-01-06 19:54:08,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57443 to 7237. [2021-01-06 19:54:08,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7237 states. [2021-01-06 19:54:08,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7237 states to 7237 states and 10948 transitions. [2021-01-06 19:54:08,498 INFO L78 Accepts]: Start accepts. Automaton has 7237 states and 10948 transitions. Word has length 105 [2021-01-06 19:54:08,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:54:08,499 INFO L481 AbstractCegarLoop]: Abstraction has 7237 states and 10948 transitions. [2021-01-06 19:54:08,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 19:54:08,499 INFO L276 IsEmpty]: Start isEmpty. Operand 7237 states and 10948 transitions. [2021-01-06 19:54:08,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-01-06 19:54:08,500 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:54:08,500 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:54:08,501 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:54:08,502 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:54:08,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:54:08,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1773942360, now seen corresponding path program 1 times [2021-01-06 19:54:08,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:54:08,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69173268] [2021-01-06 19:54:08,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:54:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:54:08,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:54:08,566 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69173268] [2021-01-06 19:54:08,566 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:54:08,567 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:54:08,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504560423] [2021-01-06 19:54:08,567 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:54:08,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:54:08,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:54:08,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:54:08,568 INFO L87 Difference]: Start difference. First operand 7237 states and 10948 transitions. Second operand 3 states. [2021-01-06 19:54:09,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:54:09,344 INFO L93 Difference]: Finished difference Result 18185 states and 27398 transitions. [2021-01-06 19:54:09,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:54:09,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2021-01-06 19:54:09,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:54:09,368 INFO L225 Difference]: With dead ends: 18185 [2021-01-06 19:54:09,368 INFO L226 Difference]: Without dead ends: 11015 [2021-01-06 19:54:09,377 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:54:09,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11015 states. [2021-01-06 19:54:10,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11015 to 11013. [2021-01-06 19:54:10,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11013 states. [2021-01-06 19:54:10,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11013 states to 11013 states and 16324 transitions. [2021-01-06 19:54:10,221 INFO L78 Accepts]: Start accepts. Automaton has 11013 states and 16324 transitions. Word has length 107 [2021-01-06 19:54:10,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:54:10,222 INFO L481 AbstractCegarLoop]: Abstraction has 11013 states and 16324 transitions. [2021-01-06 19:54:10,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:54:10,222 INFO L276 IsEmpty]: Start isEmpty. Operand 11013 states and 16324 transitions. [2021-01-06 19:54:10,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-01-06 19:54:10,223 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:54:10,223 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:54:10,224 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:54:10,224 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:54:10,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:54:10,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1707448848, now seen corresponding path program 1 times [2021-01-06 19:54:10,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:54:10,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806519890] [2021-01-06 19:54:10,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:54:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:54:10,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:54:10,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806519890] [2021-01-06 19:54:10,828 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:54:10,828 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 19:54:10,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61510166] [2021-01-06 19:54:10,829 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 19:54:10,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:54:10,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 19:54:10,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-01-06 19:54:10,830 INFO L87 Difference]: Start difference. First operand 11013 states and 16324 transitions. Second operand 10 states. [2021-01-06 19:54:11,378 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2021-01-06 19:54:12,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:54:12,813 INFO L93 Difference]: Finished difference Result 27403 states and 40727 transitions. [2021-01-06 19:54:12,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 19:54:12,814 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 107 [2021-01-06 19:54:12,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:54:12,835 INFO L225 Difference]: With dead ends: 27403 [2021-01-06 19:54:12,835 INFO L226 Difference]: Without dead ends: 16457 [2021-01-06 19:54:12,849 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2021-01-06 19:54:12,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16457 states. [2021-01-06 19:54:13,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16457 to 11013. [2021-01-06 19:54:13,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11013 states. [2021-01-06 19:54:13,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11013 states to 11013 states and 16260 transitions. [2021-01-06 19:54:13,599 INFO L78 Accepts]: Start accepts. Automaton has 11013 states and 16260 transitions. Word has length 107 [2021-01-06 19:54:13,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:54:13,599 INFO L481 AbstractCegarLoop]: Abstraction has 11013 states and 16260 transitions. [2021-01-06 19:54:13,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 19:54:13,599 INFO L276 IsEmpty]: Start isEmpty. Operand 11013 states and 16260 transitions. [2021-01-06 19:54:13,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-01-06 19:54:13,600 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:54:13,601 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:54:13,601 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:54:13,601 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:54:13,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:54:13,602 INFO L82 PathProgramCache]: Analyzing trace with hash 81465228, now seen corresponding path program 1 times [2021-01-06 19:54:13,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:54:13,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517513721] [2021-01-06 19:54:13,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:54:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:54:13,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:54:13,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517513721] [2021-01-06 19:54:13,685 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:54:13,685 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:54:13,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271262178] [2021-01-06 19:54:13,685 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:54:13,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:54:13,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:54:13,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:54:13,686 INFO L87 Difference]: Start difference. First operand 11013 states and 16260 transitions. Second operand 3 states. [2021-01-06 19:54:15,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:54:15,140 INFO L93 Difference]: Finished difference Result 31753 states and 46726 transitions. [2021-01-06 19:54:15,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:54:15,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2021-01-06 19:54:15,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:54:15,164 INFO L225 Difference]: With dead ends: 31753 [2021-01-06 19:54:15,164 INFO L226 Difference]: Without dead ends: 20807 [2021-01-06 19:54:15,178 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:54:15,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20807 states. [2021-01-06 19:54:16,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20807 to 20805. [2021-01-06 19:54:16,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20805 states. [2021-01-06 19:54:16,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20805 states to 20805 states and 30340 transitions. [2021-01-06 19:54:16,791 INFO L78 Accepts]: Start accepts. Automaton has 20805 states and 30340 transitions. Word has length 107 [2021-01-06 19:54:16,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:54:16,791 INFO L481 AbstractCegarLoop]: Abstraction has 20805 states and 30340 transitions. [2021-01-06 19:54:16,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:54:16,792 INFO L276 IsEmpty]: Start isEmpty. Operand 20805 states and 30340 transitions. [2021-01-06 19:54:16,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-01-06 19:54:16,793 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:54:16,793 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:54:16,793 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:54:16,793 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:54:16,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:54:16,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1328972844, now seen corresponding path program 1 times [2021-01-06 19:54:16,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:54:16,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599605049] [2021-01-06 19:54:16,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:54:16,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:54:16,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:54:16,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599605049] [2021-01-06 19:54:16,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:54:16,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:54:16,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277523935] [2021-01-06 19:54:16,892 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:54:16,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:54:16,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:54:16,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:54:16,894 INFO L87 Difference]: Start difference. First operand 20805 states and 30340 transitions. Second operand 3 states. [2021-01-06 19:54:19,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:54:19,455 INFO L93 Difference]: Finished difference Result 59977 states and 87046 transitions. [2021-01-06 19:54:19,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:54:19,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2021-01-06 19:54:19,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:54:19,488 INFO L225 Difference]: With dead ends: 59977 [2021-01-06 19:54:19,488 INFO L226 Difference]: Without dead ends: 39239 [2021-01-06 19:54:19,510 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:54:19,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39239 states. [2021-01-06 19:54:22,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39239 to 39237. [2021-01-06 19:54:22,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39237 states. [2021-01-06 19:54:22,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39237 states to 39237 states and 56388 transitions. [2021-01-06 19:54:22,524 INFO L78 Accepts]: Start accepts. Automaton has 39237 states and 56388 transitions. Word has length 107 [2021-01-06 19:54:22,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:54:22,525 INFO L481 AbstractCegarLoop]: Abstraction has 39237 states and 56388 transitions. [2021-01-06 19:54:22,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:54:22,525 INFO L276 IsEmpty]: Start isEmpty. Operand 39237 states and 56388 transitions. [2021-01-06 19:54:22,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-01-06 19:54:22,531 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:54:22,531 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:54:22,531 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:54:22,531 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:54:22,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:54:22,532 INFO L82 PathProgramCache]: Analyzing trace with hash 892169983, now seen corresponding path program 1 times [2021-01-06 19:54:22,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:54:22,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178714501] [2021-01-06 19:54:22,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:54:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:54:22,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:54:22,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178714501] [2021-01-06 19:54:22,644 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:54:22,644 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:54:22,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813026733] [2021-01-06 19:54:22,645 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:54:22,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:54:22,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:54:22,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:54:22,646 INFO L87 Difference]: Start difference. First operand 39237 states and 56388 transitions. Second operand 3 states. [2021-01-06 19:54:26,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:54:26,209 INFO L93 Difference]: Finished difference Result 90571 states and 130504 transitions. [2021-01-06 19:54:26,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:54:26,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2021-01-06 19:54:26,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:54:26,258 INFO L225 Difference]: With dead ends: 90571 [2021-01-06 19:54:26,259 INFO L226 Difference]: Without dead ends: 51401 [2021-01-06 19:54:26,278 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:54:26,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51401 states. [2021-01-06 19:54:30,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51401 to 51399. [2021-01-06 19:54:30,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51399 states. [2021-01-06 19:54:30,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51399 states to 51399 states and 73798 transitions. [2021-01-06 19:54:30,332 INFO L78 Accepts]: Start accepts. Automaton has 51399 states and 73798 transitions. Word has length 108 [2021-01-06 19:54:30,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:54:30,332 INFO L481 AbstractCegarLoop]: Abstraction has 51399 states and 73798 transitions. [2021-01-06 19:54:30,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:54:30,332 INFO L276 IsEmpty]: Start isEmpty. Operand 51399 states and 73798 transitions. [2021-01-06 19:54:30,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-01-06 19:54:30,333 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:54:30,333 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:54:30,333 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:54:30,334 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:54:30,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:54:30,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1806029504, now seen corresponding path program 1 times [2021-01-06 19:54:30,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:54:30,334 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770851064] [2021-01-06 19:54:30,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:54:30,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:54:30,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:54:30,449 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770851064] [2021-01-06 19:54:30,449 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:54:30,449 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 19:54:30,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430973613] [2021-01-06 19:54:30,450 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 19:54:30,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:54:30,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 19:54:30,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:54:30,451 INFO L87 Difference]: Start difference. First operand 51399 states and 73798 transitions. Second operand 8 states. [2021-01-06 19:54:36,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:54:36,567 INFO L93 Difference]: Finished difference Result 81265 states and 116218 transitions. [2021-01-06 19:54:36,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 19:54:36,568 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 108 [2021-01-06 19:54:36,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:54:36,645 INFO L225 Difference]: With dead ends: 81265 [2021-01-06 19:54:36,645 INFO L226 Difference]: Without dead ends: 81263 [2021-01-06 19:54:36,659 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2021-01-06 19:54:36,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81263 states. [2021-01-06 19:54:41,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81263 to 52167. [2021-01-06 19:54:41,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52167 states. [2021-01-06 19:54:41,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52167 states to 52167 states and 74182 transitions. [2021-01-06 19:54:41,119 INFO L78 Accepts]: Start accepts. Automaton has 52167 states and 74182 transitions. Word has length 108 [2021-01-06 19:54:41,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:54:41,119 INFO L481 AbstractCegarLoop]: Abstraction has 52167 states and 74182 transitions. [2021-01-06 19:54:41,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 19:54:41,119 INFO L276 IsEmpty]: Start isEmpty. Operand 52167 states and 74182 transitions. [2021-01-06 19:54:41,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-01-06 19:54:41,141 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:54:41,141 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:54:41,141 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 19:54:41,141 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:54:41,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:54:41,142 INFO L82 PathProgramCache]: Analyzing trace with hash 150223880, now seen corresponding path program 1 times [2021-01-06 19:54:41,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:54:41,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699494760] [2021-01-06 19:54:41,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:54:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:54:41,401 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-01-06 19:54:41,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699494760] [2021-01-06 19:54:41,401 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:54:41,401 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 19:54:41,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700981553] [2021-01-06 19:54:41,402 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 19:54:41,402 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:54:41,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 19:54:41,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-01-06 19:54:41,403 INFO L87 Difference]: Start difference. First operand 52167 states and 74182 transitions. Second operand 10 states. [2021-01-06 19:55:12,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:55:12,381 INFO L93 Difference]: Finished difference Result 482649 states and 686031 transitions. [2021-01-06 19:55:12,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 19:55:12,382 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 148 [2021-01-06 19:55:12,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:55:13,261 INFO L225 Difference]: With dead ends: 482649 [2021-01-06 19:55:13,262 INFO L226 Difference]: Without dead ends: 430551 [2021-01-06 19:55:13,411 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2021-01-06 19:55:13,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430551 states. [2021-01-06 19:55:24,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430551 to 104263. [2021-01-06 19:55:24,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104263 states. [2021-01-06 19:55:25,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104263 states to 104263 states and 147782 transitions. [2021-01-06 19:55:25,284 INFO L78 Accepts]: Start accepts. Automaton has 104263 states and 147782 transitions. Word has length 148 [2021-01-06 19:55:25,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:55:25,285 INFO L481 AbstractCegarLoop]: Abstraction has 104263 states and 147782 transitions. [2021-01-06 19:55:25,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 19:55:25,285 INFO L276 IsEmpty]: Start isEmpty. Operand 104263 states and 147782 transitions. [2021-01-06 19:55:25,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-01-06 19:55:25,316 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:55:25,317 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:55:25,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 19:55:25,317 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:55:25,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:55:25,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1397731496, now seen corresponding path program 1 times [2021-01-06 19:55:25,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:55:25,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600602122] [2021-01-06 19:55:25,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:55:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:55:25,593 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-01-06 19:55:25,593 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600602122] [2021-01-06 19:55:25,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:55:25,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 19:55:25,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68293972] [2021-01-06 19:55:25,594 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 19:55:25,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:55:25,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 19:55:25,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-01-06 19:55:25,596 INFO L87 Difference]: Start difference. First operand 104263 states and 147782 transitions. Second operand 10 states. [2021-01-06 19:56:03,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:03,342 INFO L93 Difference]: Finished difference Result 534745 states and 759631 transitions. [2021-01-06 19:56:03,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 19:56:03,343 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 148 [2021-01-06 19:56:03,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:04,243 INFO L225 Difference]: With dead ends: 534745 [2021-01-06 19:56:04,243 INFO L226 Difference]: Without dead ends: 482647 [2021-01-06 19:56:04,399 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2021-01-06 19:56:04,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482647 states. [2021-01-06 19:56:22,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482647 to 182215. [2021-01-06 19:56:22,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182215 states. [2021-01-06 19:56:23,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182215 states to 182215 states and 257606 transitions. [2021-01-06 19:56:23,591 INFO L78 Accepts]: Start accepts. Automaton has 182215 states and 257606 transitions. Word has length 148 [2021-01-06 19:56:23,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:23,592 INFO L481 AbstractCegarLoop]: Abstraction has 182215 states and 257606 transitions. [2021-01-06 19:56:23,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 19:56:23,592 INFO L276 IsEmpty]: Start isEmpty. Operand 182215 states and 257606 transitions. [2021-01-06 19:56:23,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-01-06 19:56:23,647 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:23,647 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:56:23,647 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 19:56:23,647 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:23,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:23,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1427802818, now seen corresponding path program 1 times [2021-01-06 19:56:23,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:23,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279359955] [2021-01-06 19:56:23,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:23,849 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-06 19:56:23,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279359955] [2021-01-06 19:56:23,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:23,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 19:56:23,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148308678] [2021-01-06 19:56:23,850 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 19:56:23,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:23,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 19:56:23,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-01-06 19:56:23,851 INFO L87 Difference]: Start difference. First operand 182215 states and 257606 transitions. Second operand 10 states.