/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread/queue_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 23:26:32,594 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 23:26:32,597 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 23:26:32,615 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 23:26:32,616 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 23:26:32,616 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 23:26:32,618 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 23:26:32,620 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 23:26:32,621 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 23:26:32,622 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 23:26:32,623 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 23:26:32,624 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 23:26:32,625 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 23:26:32,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 23:26:32,627 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 23:26:32,628 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 23:26:32,629 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 23:26:32,630 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 23:26:32,631 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 23:26:32,633 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 23:26:32,635 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 23:26:32,636 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 23:26:32,637 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 23:26:32,638 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 23:26:32,643 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 23:26:32,643 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 23:26:32,643 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 23:26:32,644 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 23:26:32,645 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 23:26:32,647 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 23:26:32,648 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 23:26:32,650 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 23:26:32,651 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 23:26:32,652 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 23:26:32,653 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 23:26:32,653 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 23:26:32,653 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 23:26:32,654 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 23:26:32,654 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 23:26:32,655 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 23:26:32,656 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 23:26:32,656 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-MCR.epf [2019-12-27 23:26:32,671 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 23:26:32,671 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 23:26:32,672 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 23:26:32,672 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 23:26:32,672 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 23:26:32,673 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 23:26:32,673 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 23:26:32,673 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 23:26:32,673 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 23:26:32,673 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 23:26:32,674 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 23:26:32,674 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 23:26:32,674 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 23:26:32,674 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 23:26:32,674 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 23:26:32,674 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 23:26:32,675 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 23:26:32,675 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 23:26:32,675 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 23:26:32,675 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 23:26:32,675 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 23:26:32,676 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 23:26:32,676 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 23:26:32,676 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 23:26:32,676 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 23:26:32,676 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 23:26:32,677 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 23:26:32,677 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 23:26:32,677 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 23:26:32,677 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 23:26:32,677 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 23:26:32,678 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 23:26:32,935 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 23:26:32,949 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 23:26:32,952 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 23:26:32,953 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 23:26:32,954 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 23:26:32,954 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2019-12-27 23:26:33,025 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/431ce7a97/dcd32a16bde9418ba1e257581afad5cc/FLAG27d1443e2 [2019-12-27 23:26:33,582 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 23:26:33,583 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2019-12-27 23:26:33,606 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/431ce7a97/dcd32a16bde9418ba1e257581afad5cc/FLAG27d1443e2 [2019-12-27 23:26:33,855 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/431ce7a97/dcd32a16bde9418ba1e257581afad5cc [2019-12-27 23:26:33,863 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 23:26:33,864 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 23:26:33,865 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 23:26:33,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 23:26:33,869 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 23:26:33,870 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:26:33" (1/1) ... [2019-12-27 23:26:33,873 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@767373f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:26:33, skipping insertion in model container [2019-12-27 23:26:33,873 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:26:33" (1/1) ... [2019-12-27 23:26:33,879 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 23:26:33,942 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 23:26:34,454 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:26:34,469 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 23:26:34,529 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:26:34,688 INFO L208 MainTranslator]: Completed translation [2019-12-27 23:26:34,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:26:34 WrapperNode [2019-12-27 23:26:34,689 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 23:26:34,689 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 23:26:34,690 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 23:26:34,690 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 23:26:34,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:26:34" (1/1) ... [2019-12-27 23:26:34,728 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:26:34" (1/1) ... [2019-12-27 23:26:34,797 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 23:26:34,797 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 23:26:34,797 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 23:26:34,797 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 23:26:34,810 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:26:34" (1/1) ... [2019-12-27 23:26:34,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:26:34" (1/1) ... [2019-12-27 23:26:34,833 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:26:34" (1/1) ... [2019-12-27 23:26:34,833 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:26:34" (1/1) ... [2019-12-27 23:26:34,855 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:26:34" (1/1) ... [2019-12-27 23:26:34,868 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:26:34" (1/1) ... [2019-12-27 23:26:34,870 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:26:34" (1/1) ... [2019-12-27 23:26:34,879 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 23:26:34,880 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 23:26:34,880 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 23:26:34,880 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 23:26:34,882 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:26:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/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 [2019-12-27 23:26:34,940 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-12-27 23:26:34,940 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-12-27 23:26:34,940 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-12-27 23:26:34,941 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-12-27 23:26:34,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 23:26:34,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 23:26:34,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-27 23:26:34,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 23:26:34,942 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2019-12-27 23:26:34,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-27 23:26:34,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 23:26:34,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 23:26:34,944 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 23:26:35,596 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 23:26:35,596 INFO L287 CfgBuilder]: Removed 16 assume(true) statements. [2019-12-27 23:26:35,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:26:35 BoogieIcfgContainer [2019-12-27 23:26:35,598 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 23:26:35,599 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 23:26:35,599 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 23:26:35,602 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 23:26:35,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 11:26:33" (1/3) ... [2019-12-27 23:26:35,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@753560b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:26:35, skipping insertion in model container [2019-12-27 23:26:35,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:26:34" (2/3) ... [2019-12-27 23:26:35,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@753560b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:26:35, skipping insertion in model container [2019-12-27 23:26:35,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:26:35" (3/3) ... [2019-12-27 23:26:35,606 INFO L109 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2019-12-27 23:26:35,616 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 23:26:35,617 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 23:26:35,626 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 23:26:35,628 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 23:26:35,685 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,686 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,686 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,686 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,687 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,687 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,687 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,687 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,688 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,688 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,688 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,688 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,689 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,689 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,689 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,689 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,690 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,690 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,690 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,690 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,690 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,691 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,691 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,691 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,692 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,692 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,692 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,692 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,692 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,692 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,693 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,693 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,693 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,693 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,693 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,694 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,694 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,694 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,694 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,694 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,695 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,695 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,695 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,695 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,695 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,696 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,696 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,696 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,696 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,696 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,697 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,697 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,697 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,697 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,697 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,698 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,698 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,698 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,698 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,698 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,699 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,699 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,699 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,699 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,699 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,699 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,700 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,700 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,700 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,700 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,700 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,701 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,701 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,701 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,701 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,701 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,702 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,702 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,702 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,702 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,702 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,703 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,703 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,703 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,703 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,703 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,705 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,705 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,705 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,705 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,706 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,706 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,706 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,706 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,706 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,707 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,707 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,707 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,707 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,707 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,708 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,708 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,708 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,708 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,708 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,709 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,709 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,709 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,709 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,709 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,710 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,710 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,710 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,710 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,710 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,711 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,711 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,711 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,711 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,711 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,711 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,712 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,712 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,712 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,712 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,712 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,713 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,713 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,713 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,713 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,713 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,714 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,714 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,714 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,714 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,714 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,714 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,715 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,715 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,715 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,715 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,715 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,715 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,716 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,716 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,716 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,716 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,716 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,716 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,717 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,717 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,717 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,717 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,717 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,717 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,718 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,718 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,718 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,718 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,718 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,718 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,719 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,719 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,719 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,719 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,719 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,719 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,720 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,720 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,720 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,720 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,720 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,721 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,721 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,721 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,721 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,721 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,722 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,722 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,722 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,722 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,722 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,723 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,723 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,723 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,723 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,723 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,723 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,724 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,724 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,724 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,724 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,724 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,724 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,725 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,725 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,725 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,725 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,725 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,726 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,726 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,726 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,726 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,726 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,727 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,727 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,727 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,727 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,727 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,728 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,728 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,728 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,732 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,732 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,732 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,732 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,732 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,733 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,733 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,733 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,733 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,733 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,734 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,734 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,734 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,734 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,734 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,735 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,735 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,735 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,735 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,735 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,736 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,736 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,736 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,741 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,742 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,742 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,742 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,742 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,742 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,742 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,743 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,743 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,743 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,743 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,743 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,744 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,744 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,744 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,744 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,744 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,745 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,745 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,745 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,745 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,745 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,745 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,746 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,746 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,746 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,746 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,746 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,747 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,747 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,747 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:26:35,769 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 23:26:35,790 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 23:26:35,790 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 23:26:35,790 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 23:26:35,790 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 23:26:35,790 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 23:26:35,791 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 23:26:35,791 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 23:26:35,791 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 23:26:35,805 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 196 places, 204 transitions [2019-12-27 23:26:36,395 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 10787 states. [2019-12-27 23:26:36,399 INFO L276 IsEmpty]: Start isEmpty. Operand 10787 states. [2019-12-27 23:26:36,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:36,412 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:36,414 INFO L411 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] [2019-12-27 23:26:36,414 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:36,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:36,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1929394428, now seen corresponding path program 1 times [2019-12-27 23:26:36,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:36,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179011025] [2019-12-27 23:26:36,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:36,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:36,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179011025] [2019-12-27 23:26:36,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:26:36,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 23:26:36,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1308987186] [2019-12-27 23:26:36,855 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:36,870 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:36,903 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 45 states and 44 transitions. [2019-12-27 23:26:36,903 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:36,909 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:26:36,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-27 23:26:36,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:36,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-27 23:26:36,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-27 23:26:36,927 INFO L87 Difference]: Start difference. First operand 10787 states. Second operand 2 states. [2019-12-27 23:26:37,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:37,053 INFO L93 Difference]: Finished difference Result 10784 states and 29353 transitions. [2019-12-27 23:26:37,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-27 23:26:37,055 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 44 [2019-12-27 23:26:37,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:37,154 INFO L225 Difference]: With dead ends: 10784 [2019-12-27 23:26:37,154 INFO L226 Difference]: Without dead ends: 9749 [2019-12-27 23:26:37,156 INFO L631 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 [2019-12-27 23:26:37,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9749 states. [2019-12-27 23:26:37,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9749 to 9749. [2019-12-27 23:26:37,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9749 states. [2019-12-27 23:26:37,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9749 states to 9749 states and 26526 transitions. [2019-12-27 23:26:37,662 INFO L78 Accepts]: Start accepts. Automaton has 9749 states and 26526 transitions. Word has length 44 [2019-12-27 23:26:37,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:37,663 INFO L462 AbstractCegarLoop]: Abstraction has 9749 states and 26526 transitions. [2019-12-27 23:26:37,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-27 23:26:37,663 INFO L276 IsEmpty]: Start isEmpty. Operand 9749 states and 26526 transitions. [2019-12-27 23:26:37,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 23:26:37,683 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:37,683 INFO L411 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] [2019-12-27 23:26:37,684 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:37,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:37,684 INFO L82 PathProgramCache]: Analyzing trace with hash -593181059, now seen corresponding path program 1 times [2019-12-27 23:26:37,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:37,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605825754] [2019-12-27 23:26:37,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:37,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:38,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:38,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605825754] [2019-12-27 23:26:38,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:26:38,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 23:26:38,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [279494903] [2019-12-27 23:26:38,121 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:38,272 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:38,354 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 98 states and 97 transitions. [2019-12-27 23:26:38,354 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:38,355 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:26:38,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:26:38,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:38,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:26:38,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:26:38,358 INFO L87 Difference]: Start difference. First operand 9749 states and 26526 transitions. Second operand 12 states. [2019-12-27 23:26:39,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:39,049 INFO L93 Difference]: Finished difference Result 9780 states and 26590 transitions. [2019-12-27 23:26:39,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:26:39,050 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 97 [2019-12-27 23:26:39,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:39,526 INFO L225 Difference]: With dead ends: 9780 [2019-12-27 23:26:39,527 INFO L226 Difference]: Without dead ends: 9780 [2019-12-27 23:26:39,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2019-12-27 23:26:39,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9780 states. [2019-12-27 23:26:39,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9780 to 9746. [2019-12-27 23:26:39,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9746 states. [2019-12-27 23:26:39,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9746 states to 9746 states and 26522 transitions. [2019-12-27 23:26:39,817 INFO L78 Accepts]: Start accepts. Automaton has 9746 states and 26522 transitions. Word has length 97 [2019-12-27 23:26:39,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:39,818 INFO L462 AbstractCegarLoop]: Abstraction has 9746 states and 26522 transitions. [2019-12-27 23:26:39,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:26:39,818 INFO L276 IsEmpty]: Start isEmpty. Operand 9746 states and 26522 transitions. [2019-12-27 23:26:39,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-27 23:26:39,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:39,833 INFO L411 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] [2019-12-27 23:26:39,833 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:39,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:39,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1482308150, now seen corresponding path program 1 times [2019-12-27 23:26:39,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:39,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412647406] [2019-12-27 23:26:39,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:40,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:40,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412647406] [2019-12-27 23:26:40,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:26:40,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 23:26:40,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1522684877] [2019-12-27 23:26:40,692 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:40,727 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:40,811 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 99 states and 98 transitions. [2019-12-27 23:26:40,811 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:40,812 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:26:40,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 23:26:40,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:40,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 23:26:40,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:26:40,813 INFO L87 Difference]: Start difference. First operand 9746 states and 26522 transitions. Second operand 18 states. [2019-12-27 23:26:42,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:42,818 INFO L93 Difference]: Finished difference Result 13022 states and 35325 transitions. [2019-12-27 23:26:42,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 23:26:42,818 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2019-12-27 23:26:42,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:42,852 INFO L225 Difference]: With dead ends: 13022 [2019-12-27 23:26:42,852 INFO L226 Difference]: Without dead ends: 13022 [2019-12-27 23:26:42,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=304, Invalid=956, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 23:26:42,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13022 states. [2019-12-27 23:26:43,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13022 to 11672. [2019-12-27 23:26:43,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11672 states. [2019-12-27 23:26:43,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11672 states to 11672 states and 31707 transitions. [2019-12-27 23:26:43,192 INFO L78 Accepts]: Start accepts. Automaton has 11672 states and 31707 transitions. Word has length 98 [2019-12-27 23:26:43,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:43,193 INFO L462 AbstractCegarLoop]: Abstraction has 11672 states and 31707 transitions. [2019-12-27 23:26:43,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 23:26:43,193 INFO L276 IsEmpty]: Start isEmpty. Operand 11672 states and 31707 transitions. [2019-12-27 23:26:43,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-27 23:26:43,211 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:43,212 INFO L411 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] [2019-12-27 23:26:43,212 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:43,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:43,212 INFO L82 PathProgramCache]: Analyzing trace with hash 921844576, now seen corresponding path program 1 times [2019-12-27 23:26:43,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:43,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83485065] [2019-12-27 23:26:43,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:43,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:43,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83485065] [2019-12-27 23:26:43,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:26:43,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 23:26:43,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [222322107] [2019-12-27 23:26:43,293 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:43,316 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:43,470 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 100 states and 99 transitions. [2019-12-27 23:26:43,470 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:43,471 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:26:43,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 23:26:43,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:43,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 23:26:43,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 23:26:43,472 INFO L87 Difference]: Start difference. First operand 11672 states and 31707 transitions. Second operand 4 states. [2019-12-27 23:26:43,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:43,556 INFO L93 Difference]: Finished difference Result 11918 states and 32061 transitions. [2019-12-27 23:26:43,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 23:26:43,557 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-12-27 23:26:43,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:43,587 INFO L225 Difference]: With dead ends: 11918 [2019-12-27 23:26:43,587 INFO L226 Difference]: Without dead ends: 11312 [2019-12-27 23:26:43,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:26:43,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11312 states. [2019-12-27 23:26:43,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11312 to 10268. [2019-12-27 23:26:43,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10268 states. [2019-12-27 23:26:43,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10268 states to 10268 states and 27635 transitions. [2019-12-27 23:26:43,890 INFO L78 Accepts]: Start accepts. Automaton has 10268 states and 27635 transitions. Word has length 99 [2019-12-27 23:26:43,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:43,890 INFO L462 AbstractCegarLoop]: Abstraction has 10268 states and 27635 transitions. [2019-12-27 23:26:43,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 23:26:43,891 INFO L276 IsEmpty]: Start isEmpty. Operand 10268 states and 27635 transitions. [2019-12-27 23:26:43,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-27 23:26:43,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:43,915 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:26:43,916 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:43,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:43,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1815021150, now seen corresponding path program 1 times [2019-12-27 23:26:43,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:43,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100670032] [2019-12-27 23:26:43,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:44,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:44,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100670032] [2019-12-27 23:26:44,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:26:44,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:26:44,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [164172508] [2019-12-27 23:26:44,030 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:44,094 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:44,715 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 329 states and 540 transitions. [2019-12-27 23:26:44,715 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:44,772 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 23:26:44,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 23:26:44,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:44,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 23:26:44,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 23:26:44,774 INFO L87 Difference]: Start difference. First operand 10268 states and 27635 transitions. Second operand 6 states. [2019-12-27 23:26:44,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:44,889 INFO L93 Difference]: Finished difference Result 1808 states and 4120 transitions. [2019-12-27 23:26:44,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 23:26:44,889 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 116 [2019-12-27 23:26:44,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:44,894 INFO L225 Difference]: With dead ends: 1808 [2019-12-27 23:26:44,894 INFO L226 Difference]: Without dead ends: 1544 [2019-12-27 23:26:44,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:26:44,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2019-12-27 23:26:44,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1424. [2019-12-27 23:26:44,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1424 states. [2019-12-27 23:26:44,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1424 states and 3200 transitions. [2019-12-27 23:26:44,926 INFO L78 Accepts]: Start accepts. Automaton has 1424 states and 3200 transitions. Word has length 116 [2019-12-27 23:26:44,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:44,927 INFO L462 AbstractCegarLoop]: Abstraction has 1424 states and 3200 transitions. [2019-12-27 23:26:44,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 23:26:44,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 3200 transitions. [2019-12-27 23:26:44,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-12-27 23:26:44,932 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:44,933 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:26:44,933 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:44,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:44,934 INFO L82 PathProgramCache]: Analyzing trace with hash -206631209, now seen corresponding path program 1 times [2019-12-27 23:26:44,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:44,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108763301] [2019-12-27 23:26:44,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:44,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:45,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:45,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108763301] [2019-12-27 23:26:45,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475920502] [2019-12-27 23:26:45,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:45,218 INFO L264 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-27 23:26:45,227 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:45,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:45,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:45,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-27 23:26:45,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [324434441] [2019-12-27 23:26:45,271 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:45,325 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:45,732 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 291 states and 442 transitions. [2019-12-27 23:26:45,732 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:45,734 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:26:45,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:26:45,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:45,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:26:45,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:26:45,735 INFO L87 Difference]: Start difference. First operand 1424 states and 3200 transitions. Second operand 5 states. [2019-12-27 23:26:45,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:45,795 INFO L93 Difference]: Finished difference Result 2240 states and 5060 transitions. [2019-12-27 23:26:45,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:26:45,796 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-12-27 23:26:45,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:45,800 INFO L225 Difference]: With dead ends: 2240 [2019-12-27 23:26:45,801 INFO L226 Difference]: Without dead ends: 2240 [2019-12-27 23:26:45,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:26:45,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2019-12-27 23:26:45,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 1844. [2019-12-27 23:26:45,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1844 states. [2019-12-27 23:26:45,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 4157 transitions. [2019-12-27 23:26:45,833 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 4157 transitions. Word has length 138 [2019-12-27 23:26:45,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:45,833 INFO L462 AbstractCegarLoop]: Abstraction has 1844 states and 4157 transitions. [2019-12-27 23:26:45,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:26:45,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 4157 transitions. [2019-12-27 23:26:45,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-12-27 23:26:45,837 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:45,838 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-27 23:26:46,049 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:46,050 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:46,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:46,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1577960977, now seen corresponding path program 2 times [2019-12-27 23:26:46,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:46,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882603988] [2019-12-27 23:26:46,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:46,161 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:46,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882603988] [2019-12-27 23:26:46,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081588657] [2019-12-27 23:26:46,162 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:46,298 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:26:46,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:46,300 INFO L264 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 23:26:46,306 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:46,355 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:46,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:46,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 23:26:46,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1480831454] [2019-12-27 23:26:46,357 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:46,412 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:47,527 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 407 states and 645 transitions. [2019-12-27 23:26:47,527 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:47,530 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:26:47,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:26:47,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:47,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:26:47,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:26:47,531 INFO L87 Difference]: Start difference. First operand 1844 states and 4157 transitions. Second operand 7 states. [2019-12-27 23:26:47,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:47,618 INFO L93 Difference]: Finished difference Result 2660 states and 6017 transitions. [2019-12-27 23:26:47,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 23:26:47,618 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 167 [2019-12-27 23:26:47,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:47,624 INFO L225 Difference]: With dead ends: 2660 [2019-12-27 23:26:47,625 INFO L226 Difference]: Without dead ends: 2660 [2019-12-27 23:26:47,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-12-27 23:26:47,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2660 states. [2019-12-27 23:26:47,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2660 to 2264. [2019-12-27 23:26:47,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2264 states. [2019-12-27 23:26:47,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 5114 transitions. [2019-12-27 23:26:47,669 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 5114 transitions. Word has length 167 [2019-12-27 23:26:47,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:47,669 INFO L462 AbstractCegarLoop]: Abstraction has 2264 states and 5114 transitions. [2019-12-27 23:26:47,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:26:47,669 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 5114 transitions. [2019-12-27 23:26:47,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-12-27 23:26:47,675 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:47,676 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:26:47,888 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:47,889 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:47,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:47,889 INFO L82 PathProgramCache]: Analyzing trace with hash -834842345, now seen corresponding path program 3 times [2019-12-27 23:26:47,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:47,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599803174] [2019-12-27 23:26:47,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:47,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:48,060 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:48,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599803174] [2019-12-27 23:26:48,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378664014] [2019-12-27 23:26:48,068 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:48,322 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 23:26:48,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:48,325 INFO L264 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 66 conjunts are in the unsatisfiable core [2019-12-27 23:26:48,345 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:48,411 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-27 23:26:48,411 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:26:48,414 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:26:48,415 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:26:48,416 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-27 23:26:48,456 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:26:48,456 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-27 23:26:48,457 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:26:48,462 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:26:48,463 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:26:48,463 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-27 23:26:48,590 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-27 23:26:48,591 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:26:48,598 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:26:48,598 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:26:48,599 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-12-27 23:26:48,630 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-27 23:26:48,631 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:26:48,640 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:26:48,641 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:26:48,641 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2019-12-27 23:26:48,758 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:26:48,779 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:26:48,779 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-27 23:26:48,780 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:26:48,815 INFO L614 ElimStorePlain]: treesize reduction 30, result has 55.2 percent of original size [2019-12-27 23:26:48,816 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:26:48,816 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:23 [2019-12-27 23:26:48,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:26:48,852 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-27 23:26:48,852 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:26:48,864 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:26:48,865 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:26:48,866 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:23 [2019-12-27 23:26:49,036 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-27 23:26:49,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-27 23:26:49,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [9] total 20 [2019-12-27 23:26:49,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1563988638] [2019-12-27 23:26:49,037 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:49,122 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:51,230 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 523 states and 848 transitions. [2019-12-27 23:26:51,230 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:51,232 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:26:51,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 23:26:51,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:51,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 23:26:51,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:26:51,234 INFO L87 Difference]: Start difference. First operand 2264 states and 5114 transitions. Second operand 13 states. [2019-12-27 23:26:51,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:51,752 INFO L93 Difference]: Finished difference Result 3701 states and 8378 transitions. [2019-12-27 23:26:51,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 23:26:51,752 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 196 [2019-12-27 23:26:51,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:51,764 INFO L225 Difference]: With dead ends: 3701 [2019-12-27 23:26:51,765 INFO L226 Difference]: Without dead ends: 3701 [2019-12-27 23:26:51,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 184 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=639, Unknown=0, NotChecked=0, Total=812 [2019-12-27 23:26:51,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3701 states. [2019-12-27 23:26:51,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3701 to 3020. [2019-12-27 23:26:51,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3020 states. [2019-12-27 23:26:51,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3020 states to 3020 states and 6827 transitions. [2019-12-27 23:26:51,821 INFO L78 Accepts]: Start accepts. Automaton has 3020 states and 6827 transitions. Word has length 196 [2019-12-27 23:26:51,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:51,821 INFO L462 AbstractCegarLoop]: Abstraction has 3020 states and 6827 transitions. [2019-12-27 23:26:51,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 23:26:51,822 INFO L276 IsEmpty]: Start isEmpty. Operand 3020 states and 6827 transitions. [2019-12-27 23:26:51,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-12-27 23:26:51,829 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:51,830 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-27 23:26:52,036 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:52,037 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:52,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:52,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1197311036, now seen corresponding path program 1 times [2019-12-27 23:26:52,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:52,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459370142] [2019-12-27 23:26:52,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:52,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:52,239 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:52,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459370142] [2019-12-27 23:26:52,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302438952] [2019-12-27 23:26:52,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:52,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:52,390 INFO L264 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:26:52,396 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:52,477 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:52,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:52,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2019-12-27 23:26:52,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [262133489] [2019-12-27 23:26:52,481 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:53,293 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:54,082 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 539 states and 876 transitions. [2019-12-27 23:26:54,082 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:54,084 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:26:54,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:26:54,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:54,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:26:54,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-27 23:26:54,085 INFO L87 Difference]: Start difference. First operand 3020 states and 6827 transitions. Second operand 9 states. [2019-12-27 23:26:54,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:54,217 INFO L93 Difference]: Finished difference Result 4460 states and 10091 transitions. [2019-12-27 23:26:54,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 23:26:54,217 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 200 [2019-12-27 23:26:54,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:54,227 INFO L225 Difference]: With dead ends: 4460 [2019-12-27 23:26:54,227 INFO L226 Difference]: Without dead ends: 4460 [2019-12-27 23:26:54,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-12-27 23:26:54,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4460 states. [2019-12-27 23:26:54,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4460 to 3764. [2019-12-27 23:26:54,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3764 states. [2019-12-27 23:26:54,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 8513 transitions. [2019-12-27 23:26:54,294 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 8513 transitions. Word has length 200 [2019-12-27 23:26:54,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:54,294 INFO L462 AbstractCegarLoop]: Abstraction has 3764 states and 8513 transitions. [2019-12-27 23:26:54,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:26:54,294 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 8513 transitions. [2019-12-27 23:26:54,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-12-27 23:26:54,303 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:54,304 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-12-27 23:26:54,507 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:54,508 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:54,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:54,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1476674553, now seen corresponding path program 2 times [2019-12-27 23:26:54,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:54,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160585054] [2019-12-27 23:26:54,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:54,733 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:54,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160585054] [2019-12-27 23:26:54,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743146748] [2019-12-27 23:26:54,734 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:54,880 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:26:54,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:54,882 INFO L264 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 23:26:54,885 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:54,948 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:54,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:54,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2019-12-27 23:26:54,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1418556214] [2019-12-27 23:26:54,949 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:55,056 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:58,135 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 671 states and 1107 transitions. [2019-12-27 23:26:58,135 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:58,138 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:26:58,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:58,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:58,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:58,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-12-27 23:26:58,139 INFO L87 Difference]: Start difference. First operand 3764 states and 8513 transitions. Second operand 11 states. [2019-12-27 23:26:58,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:58,298 INFO L93 Difference]: Finished difference Result 5204 states and 11777 transitions. [2019-12-27 23:26:58,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 23:26:58,298 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 233 [2019-12-27 23:26:58,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:58,310 INFO L225 Difference]: With dead ends: 5204 [2019-12-27 23:26:58,310 INFO L226 Difference]: Without dead ends: 5204 [2019-12-27 23:26:58,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-12-27 23:26:58,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5204 states. [2019-12-27 23:26:58,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5204 to 4508. [2019-12-27 23:26:58,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4508 states. [2019-12-27 23:26:58,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4508 states to 4508 states and 10199 transitions. [2019-12-27 23:26:58,387 INFO L78 Accepts]: Start accepts. Automaton has 4508 states and 10199 transitions. Word has length 233 [2019-12-27 23:26:58,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:58,387 INFO L462 AbstractCegarLoop]: Abstraction has 4508 states and 10199 transitions. [2019-12-27 23:26:58,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:58,388 INFO L276 IsEmpty]: Start isEmpty. Operand 4508 states and 10199 transitions. [2019-12-27 23:26:58,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-12-27 23:26:58,398 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:58,398 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 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] [2019-12-27 23:26:58,610 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:58,610 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:58,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:58,611 INFO L82 PathProgramCache]: Analyzing trace with hash -308517151, now seen corresponding path program 3 times [2019-12-27 23:26:58,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:58,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441887490] [2019-12-27 23:26:58,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:58,896 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:58,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441887490] [2019-12-27 23:26:58,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185628460] [2019-12-27 23:26:58,897 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:59,401 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-27 23:26:59,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:59,404 INFO L264 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 67 conjunts are in the unsatisfiable core [2019-12-27 23:26:59,410 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:59,415 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-27 23:26:59,415 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:26:59,417 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:26:59,417 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:26:59,417 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-27 23:26:59,437 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:26:59,438 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-27 23:26:59,438 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:26:59,443 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:26:59,443 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:26:59,443 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-27 23:26:59,571 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-27 23:26:59,572 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:26:59,578 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:26:59,579 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:26:59,579 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-12-27 23:26:59,611 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-27 23:26:59,612 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:26:59,621 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:26:59,622 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:26:59,622 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2019-12-27 23:26:59,744 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:26:59,759 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:26:59,760 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-27 23:26:59,760 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:26:59,794 INFO L614 ElimStorePlain]: treesize reduction 30, result has 55.2 percent of original size [2019-12-27 23:26:59,794 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:26:59,795 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:23 [2019-12-27 23:26:59,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:26:59,831 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-27 23:26:59,831 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:00,076 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-12-27 23:27:00,077 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:00,078 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:27:00,078 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:23 [2019-12-27 23:27:00,241 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2019-12-27 23:27:00,242 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:00,247 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:00,247 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:27:00,247 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:17 [2019-12-27 23:27:00,295 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-27 23:27:00,295 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:00,310 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:00,310 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:27:00,311 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:13 [2019-12-27 23:27:00,445 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:27:00,460 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:00,460 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 49 [2019-12-27 23:27:00,462 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:00,490 INFO L614 ElimStorePlain]: treesize reduction 26, result has 51.9 percent of original size [2019-12-27 23:27:00,491 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:27:00,491 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:19 [2019-12-27 23:27:00,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:27:00,528 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-27 23:27:00,529 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:00,544 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:00,545 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:27:00,545 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:19 [2019-12-27 23:27:00,554 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-27 23:27:00,554 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:00,558 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:00,559 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:27:00,559 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:7 [2019-12-27 23:27:00,730 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 160 proven. 90 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-12-27 23:27:00,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:00,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 32 [2019-12-27 23:27:00,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1512522605] [2019-12-27 23:27:00,731 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:00,814 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:05,331 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 787 states and 1310 transitions. [2019-12-27 23:27:05,331 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:05,334 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:27:05,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 23:27:05,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:05,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 23:27:05,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=873, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:27:05,335 INFO L87 Difference]: Start difference. First operand 4508 states and 10199 transitions. Second operand 13 states. [2019-12-27 23:27:05,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:05,539 INFO L93 Difference]: Finished difference Result 5948 states and 13463 transitions. [2019-12-27 23:27:05,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:27:05,540 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 262 [2019-12-27 23:27:05,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:05,547 INFO L225 Difference]: With dead ends: 5948 [2019-12-27 23:27:05,547 INFO L226 Difference]: Without dead ends: 5948 [2019-12-27 23:27:05,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 253 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=249, Invalid=1473, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 23:27:05,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5948 states. [2019-12-27 23:27:05,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5948 to 5252. [2019-12-27 23:27:05,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5252 states. [2019-12-27 23:27:05,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5252 states to 5252 states and 11885 transitions. [2019-12-27 23:27:05,643 INFO L78 Accepts]: Start accepts. Automaton has 5252 states and 11885 transitions. Word has length 262 [2019-12-27 23:27:05,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:05,644 INFO L462 AbstractCegarLoop]: Abstraction has 5252 states and 11885 transitions. [2019-12-27 23:27:05,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 23:27:05,645 INFO L276 IsEmpty]: Start isEmpty. Operand 5252 states and 11885 transitions. [2019-12-27 23:27:05,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-12-27 23:27:05,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:05,660 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:27:05,867 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:05,867 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:05,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:05,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1306885630, now seen corresponding path program 4 times [2019-12-27 23:27:05,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:05,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172255804] [2019-12-27 23:27:05,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:05,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:06,225 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:06,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172255804] [2019-12-27 23:27:06,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975441295] [2019-12-27 23:27:06,226 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:06,676 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:27:06,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:06,678 INFO L264 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:27:06,683 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:06,781 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:06,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:06,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2019-12-27 23:27:06,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1507417626] [2019-12-27 23:27:06,782 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:06,886 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:11,913 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 919 states and 1541 transitions. [2019-12-27 23:27:11,913 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:11,916 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:27:11,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 23:27:11,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:11,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 23:27:11,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-12-27 23:27:11,917 INFO L87 Difference]: Start difference. First operand 5252 states and 11885 transitions. Second operand 15 states. [2019-12-27 23:27:12,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:12,180 INFO L93 Difference]: Finished difference Result 6692 states and 15149 transitions. [2019-12-27 23:27:12,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 23:27:12,180 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 295 [2019-12-27 23:27:12,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:12,186 INFO L225 Difference]: With dead ends: 6692 [2019-12-27 23:27:12,186 INFO L226 Difference]: Without dead ends: 6692 [2019-12-27 23:27:12,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=263, Invalid=549, Unknown=0, NotChecked=0, Total=812 [2019-12-27 23:27:12,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6692 states. [2019-12-27 23:27:12,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6692 to 5996. [2019-12-27 23:27:12,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5996 states. [2019-12-27 23:27:12,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5996 states to 5996 states and 13571 transitions. [2019-12-27 23:27:12,284 INFO L78 Accepts]: Start accepts. Automaton has 5996 states and 13571 transitions. Word has length 295 [2019-12-27 23:27:12,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:12,284 INFO L462 AbstractCegarLoop]: Abstraction has 5996 states and 13571 transitions. [2019-12-27 23:27:12,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 23:27:12,284 INFO L276 IsEmpty]: Start isEmpty. Operand 5996 states and 13571 transitions. [2019-12-27 23:27:12,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-12-27 23:27:12,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:12,305 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:27:12,511 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:12,512 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:12,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:12,512 INFO L82 PathProgramCache]: Analyzing trace with hash -912521530, now seen corresponding path program 5 times [2019-12-27 23:27:12,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:12,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464499920] [2019-12-27 23:27:12,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:12,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:12,875 INFO L134 CoverageAnalysis]: Checked inductivity of 604 backedges. 0 proven. 604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:12,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464499920] [2019-12-27 23:27:12,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195708105] [2019-12-27 23:27:12,875 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:13,043 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-12-27 23:27:13,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:13,046 INFO L264 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 82 conjunts are in the unsatisfiable core [2019-12-27 23:27:13,051 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:13,091 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-27 23:27:13,091 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:13,092 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:13,093 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:27:13,093 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-27 23:27:13,150 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:13,150 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 62 [2019-12-27 23:27:13,151 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:13,180 INFO L614 ElimStorePlain]: treesize reduction 24, result has 59.3 percent of original size [2019-12-27 23:27:13,181 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 23:27:13,181 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:23 [2019-12-27 23:27:13,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:13,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:13,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:13,981 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:27:13,982 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:27:13,999 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:14,000 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-27 23:27:14,000 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:14,024 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:14,025 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 54 [2019-12-27 23:27:14,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:14,026 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:14,126 INFO L614 ElimStorePlain]: treesize reduction 49, result has 65.2 percent of original size [2019-12-27 23:27:14,127 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 23:27:14,128 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:48 [2019-12-27 23:27:14,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:14,179 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-12-27 23:27:14,180 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:14,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:27:14,188 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-27 23:27:14,189 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:14,218 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:14,219 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 23:27:14,219 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:47 [2019-12-27 23:27:14,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:14,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:27:14,352 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2019-12-27 23:27:14,352 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:14,356 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2019-12-27 23:27:14,357 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:14,367 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:14,368 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 23:27:14,368 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:34 [2019-12-27 23:27:14,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:14,421 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-12-27 23:27:14,421 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:14,450 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:14,450 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 62 [2019-12-27 23:27:14,451 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:14,510 INFO L614 ElimStorePlain]: treesize reduction 23, result has 75.8 percent of original size [2019-12-27 23:27:14,511 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-27 23:27:14,511 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:48 [2019-12-27 23:27:14,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 23:27:14,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:14,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:14,878 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:27:14,881 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:27:14,899 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:14,900 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-27 23:27:14,901 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:14,927 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:14,928 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 54 [2019-12-27 23:27:14,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:14,929 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:15,025 INFO L614 ElimStorePlain]: treesize reduction 49, result has 65.2 percent of original size [2019-12-27 23:27:15,026 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 23:27:15,027 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:48 [2019-12-27 23:27:15,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:15,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:27:15,073 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-27 23:27:15,074 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:15,080 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-12-27 23:27:15,081 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:15,112 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:15,113 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 23:27:15,113 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:47 [2019-12-27 23:27:15,314 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2019-12-27 23:27:15,314 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:15,326 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:15,326 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:27:15,327 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:34 [2019-12-27 23:27:15,376 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:27:15,377 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-27 23:27:15,378 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:15,389 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:15,390 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:27:15,390 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:34 [2019-12-27 23:27:15,658 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:27:15,671 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:15,671 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-27 23:27:15,672 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:15,716 INFO L614 ElimStorePlain]: treesize reduction 30, result has 64.3 percent of original size [2019-12-27 23:27:15,717 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:27:15,717 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2019-12-27 23:27:15,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:27:15,776 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-27 23:27:15,776 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:15,793 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:15,794 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:27:15,794 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2019-12-27 23:27:15,939 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2019-12-27 23:27:15,939 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:15,950 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:15,950 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:27:15,950 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:34 [2019-12-27 23:27:16,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:27:16,017 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-27 23:27:16,018 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:16,026 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:16,027 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 23:27:16,028 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:19 [2019-12-27 23:27:16,259 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:16,260 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 57 [2019-12-27 23:27:16,260 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:16,279 INFO L614 ElimStorePlain]: treesize reduction 30, result has 44.4 percent of original size [2019-12-27 23:27:16,280 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:27:16,280 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:9 [2019-12-27 23:27:16,292 INFO L343 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2019-12-27 23:27:16,292 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2019-12-27 23:27:16,293 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:16,297 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:16,297 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:27:16,298 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:9 [2019-12-27 23:27:16,303 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-27 23:27:16,303 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:16,304 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:16,305 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:27:16,305 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-27 23:27:16,620 INFO L134 CoverageAnalysis]: Checked inductivity of 604 backedges. 447 proven. 110 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-12-27 23:27:16,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:16,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 35] total 50 [2019-12-27 23:27:16,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [33225087] [2019-12-27 23:27:16,620 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:16,743 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:23,797 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 1035 states and 1744 transitions. [2019-12-27 23:27:23,797 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:23,801 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:27:23,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 23:27:23,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:23,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 23:27:23,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=2178, Unknown=0, NotChecked=0, Total=2450 [2019-12-27 23:27:23,803 INFO L87 Difference]: Start difference. First operand 5996 states and 13571 transitions. Second operand 17 states. [2019-12-27 23:27:24,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:24,201 INFO L93 Difference]: Finished difference Result 7436 states and 16835 transitions. [2019-12-27 23:27:24,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 23:27:24,201 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 324 [2019-12-27 23:27:24,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:24,209 INFO L225 Difference]: With dead ends: 7436 [2019-12-27 23:27:24,209 INFO L226 Difference]: Without dead ends: 7436 [2019-12-27 23:27:24,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 302 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1356 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=510, Invalid=3522, Unknown=0, NotChecked=0, Total=4032 [2019-12-27 23:27:24,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7436 states. [2019-12-27 23:27:24,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7436 to 6740. [2019-12-27 23:27:24,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6740 states. [2019-12-27 23:27:24,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6740 states to 6740 states and 15257 transitions. [2019-12-27 23:27:24,315 INFO L78 Accepts]: Start accepts. Automaton has 6740 states and 15257 transitions. Word has length 324 [2019-12-27 23:27:24,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:24,316 INFO L462 AbstractCegarLoop]: Abstraction has 6740 states and 15257 transitions. [2019-12-27 23:27:24,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 23:27:24,316 INFO L276 IsEmpty]: Start isEmpty. Operand 6740 states and 15257 transitions. [2019-12-27 23:27:24,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-12-27 23:27:24,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:24,329 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:27:24,533 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:24,534 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:24,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:24,534 INFO L82 PathProgramCache]: Analyzing trace with hash -97176899, now seen corresponding path program 6 times [2019-12-27 23:27:24,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:24,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169914816] [2019-12-27 23:27:24,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:24,926 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:24,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169914816] [2019-12-27 23:27:24,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254171185] [2019-12-27 23:27:24,927 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:26,355 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-12-27 23:27:26,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:26,359 INFO L264 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 70 conjunts are in the unsatisfiable core [2019-12-27 23:27:26,368 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:26,379 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-27 23:27:26,379 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:26,381 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:26,382 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:27:26,382 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-27 23:27:26,411 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:26,412 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-12-27 23:27:26,412 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:26,434 INFO L614 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2019-12-27 23:27:26,434 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:27:26,434 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2019-12-27 23:27:26,458 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2019-12-27 23:27:26,458 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:26,469 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:26,469 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:27:26,470 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:24 [2019-12-27 23:27:26,529 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:26,530 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2019-12-27 23:27:26,531 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:26,571 INFO L614 ElimStorePlain]: treesize reduction 28, result has 56.9 percent of original size [2019-12-27 23:27:26,572 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:27:26,572 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:37 [2019-12-27 23:27:26,622 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:26,622 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 37 [2019-12-27 23:27:26,623 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:26,637 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:26,637 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:27:26,638 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:34 [2019-12-27 23:27:26,774 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2019-12-27 23:27:26,775 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:26,795 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:26,796 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:27:26,796 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:45 [2019-12-27 23:27:26,828 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2019-12-27 23:27:26,829 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:26,848 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:26,848 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:27:26,849 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:45 [2019-12-27 23:27:26,875 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2019-12-27 23:27:26,875 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:26,894 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:26,894 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:27:26,894 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:39 [2019-12-27 23:27:26,965 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2019-12-27 23:27:26,971 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-12-27 23:27:26,971 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:26,977 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:26,977 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:27:26,994 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:26,995 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 23:27:26,996 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:41 [2019-12-27 23:27:27,047 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2019-12-27 23:27:27,051 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-12-27 23:27:27,051 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:27,058 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:27,058 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:27:27,100 INFO L614 ElimStorePlain]: treesize reduction 4, result has 91.7 percent of original size [2019-12-27 23:27:27,101 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-27 23:27:27,101 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:44 [2019-12-27 23:27:27,350 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-12-27 23:27:27,351 INFO L343 Elim1Store]: treesize reduction 8, result has 92.8 percent of original size [2019-12-27 23:27:27,351 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 45 treesize of output 136 [2019-12-27 23:27:27,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,461 INFO L430 ElimStorePlain]: Different costs {0=[v_arrayElimCell_55, v_arrayElimCell_53], 1=[v_arrayElimCell_54]} [2019-12-27 23:27:27,674 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:27,675 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@8a10454 at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:340) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:464) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@8a10454 at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:79) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:829) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:585) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:300) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:186) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) ... 22 more [2019-12-27 23:27:27,681 INFO L168 Benchmark]: Toolchain (without parser) took 53816.73 ms. Allocated memory was 138.4 MB in the beginning and 4.1 GB in the end (delta: 4.0 GB). Free memory was 100.9 MB in the beginning and 1.0 GB in the end (delta: -918.2 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2019-12-27 23:27:27,681 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 23:27:27,681 INFO L168 Benchmark]: CACSL2BoogieTranslator took 823.47 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 100.5 MB in the beginning and 131.3 MB in the end (delta: -30.8 MB). Peak memory consumption was 38.4 MB. Max. memory is 7.1 GB. [2019-12-27 23:27:27,682 INFO L168 Benchmark]: Boogie Procedure Inliner took 107.39 ms. Allocated memory is still 202.4 MB. Free memory was 131.3 MB in the beginning and 128.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-27 23:27:27,682 INFO L168 Benchmark]: Boogie Preprocessor took 82.11 ms. Allocated memory is still 202.4 MB. Free memory was 128.0 MB in the beginning and 125.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 23:27:27,682 INFO L168 Benchmark]: RCFGBuilder took 718.40 ms. Allocated memory was 202.4 MB in the beginning and 235.9 MB in the end (delta: 33.6 MB). Free memory was 125.9 MB in the beginning and 200.9 MB in the end (delta: -75.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 7.1 GB. [2019-12-27 23:27:27,683 INFO L168 Benchmark]: TraceAbstraction took 52079.96 ms. Allocated memory was 235.9 MB in the beginning and 4.1 GB in the end (delta: 3.9 GB). Free memory was 200.9 MB in the beginning and 1.0 GB in the end (delta: -818.2 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2019-12-27 23:27:27,689 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 823.47 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 100.5 MB in the beginning and 131.3 MB in the end (delta: -30.8 MB). Peak memory consumption was 38.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 107.39 ms. Allocated memory is still 202.4 MB. Free memory was 131.3 MB in the beginning and 128.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 82.11 ms. Allocated memory is still 202.4 MB. Free memory was 128.0 MB in the beginning and 125.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 718.40 ms. Allocated memory was 202.4 MB in the beginning and 235.9 MB in the end (delta: 33.6 MB). Free memory was 125.9 MB in the beginning and 200.9 MB in the end (delta: -75.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 52079.96 ms. Allocated memory was 235.9 MB in the beginning and 4.1 GB in the end (delta: 3.9 GB). Free memory was 200.9 MB in the beginning and 1.0 GB in the end (delta: -818.2 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@8a10454 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@8a10454: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:340) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...