/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_longer.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 23:27:29,972 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 23:27:29,975 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 23:27:29,992 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 23:27:29,993 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 23:27:29,995 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 23:27:29,997 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 23:27:30,010 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 23:27:30,011 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 23:27:30,013 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 23:27:30,014 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 23:27:30,015 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 23:27:30,017 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 23:27:30,019 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 23:27:30,022 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 23:27:30,023 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 23:27:30,025 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 23:27:30,027 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 23:27:30,029 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 23:27:30,036 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 23:27:30,040 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 23:27:30,041 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 23:27:30,042 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 23:27:30,043 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 23:27:30,045 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 23:27:30,045 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 23:27:30,045 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 23:27:30,046 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 23:27:30,046 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 23:27:30,047 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 23:27:30,047 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 23:27:30,048 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 23:27:30,049 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 23:27:30,049 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 23:27:30,050 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 23:27:30,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 23:27:30,051 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 23:27:30,051 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 23:27:30,052 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 23:27:30,052 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 23:27:30,053 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 23:27:30,054 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:27:30,067 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 23:27:30,068 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 23:27:30,069 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 23:27:30,069 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 23:27:30,069 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 23:27:30,069 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 23:27:30,070 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 23:27:30,070 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 23:27:30,070 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 23:27:30,070 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 23:27:30,070 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 23:27:30,071 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 23:27:30,071 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 23:27:30,071 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 23:27:30,071 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 23:27:30,071 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 23:27:30,071 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 23:27:30,072 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 23:27:30,072 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 23:27:30,072 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 23:27:30,072 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 23:27:30,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 23:27:30,073 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 23:27:30,073 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 23:27:30,073 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 23:27:30,073 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 23:27:30,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 23:27:30,074 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 23:27:30,074 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 23:27:30,074 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 23:27:30,074 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 23:27:30,074 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 23:27:30,347 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 23:27:30,358 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 23:27:30,361 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 23:27:30,363 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 23:27:30,363 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 23:27:30,364 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longer.i [2019-12-27 23:27:30,437 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59b6ff078/be02ff869c774a4ab545af26024fcc00/FLAGf8d35f839 [2019-12-27 23:27:31,001 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 23:27:31,002 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i [2019-12-27 23:27:31,026 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59b6ff078/be02ff869c774a4ab545af26024fcc00/FLAGf8d35f839 [2019-12-27 23:27:31,263 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59b6ff078/be02ff869c774a4ab545af26024fcc00 [2019-12-27 23:27:31,273 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 23:27:31,276 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 23:27:31,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 23:27:31,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 23:27:31,280 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 23:27:31,281 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:27:31" (1/1) ... [2019-12-27 23:27:31,284 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@150a9350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:27:31, skipping insertion in model container [2019-12-27 23:27:31,284 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:27:31" (1/1) ... [2019-12-27 23:27:31,292 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 23:27:31,335 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 23:27:31,985 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:27:32,005 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 23:27:32,053 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:27:32,227 INFO L208 MainTranslator]: Completed translation [2019-12-27 23:27:32,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:27:32 WrapperNode [2019-12-27 23:27:32,228 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 23:27:32,229 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 23:27:32,229 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 23:27:32,229 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 23:27:32,239 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:27:32" (1/1) ... [2019-12-27 23:27:32,292 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:27:32" (1/1) ... [2019-12-27 23:27:32,325 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 23:27:32,325 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 23:27:32,326 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 23:27:32,326 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 23:27:32,335 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:27:32" (1/1) ... [2019-12-27 23:27:32,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:27:32" (1/1) ... [2019-12-27 23:27:32,340 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:27:32" (1/1) ... [2019-12-27 23:27:32,340 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:27:32" (1/1) ... [2019-12-27 23:27:32,352 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:27:32" (1/1) ... [2019-12-27 23:27:32,357 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:27:32" (1/1) ... [2019-12-27 23:27:32,360 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:27:32" (1/1) ... [2019-12-27 23:27:32,365 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 23:27:32,366 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 23:27:32,366 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 23:27:32,366 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 23:27:32,367 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:27:32" (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:27:32,426 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-12-27 23:27:32,426 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-12-27 23:27:32,426 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-12-27 23:27:32,427 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-12-27 23:27:32,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 23:27:32,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 23:27:32,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-27 23:27:32,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 23:27:32,428 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2019-12-27 23:27:32,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-27 23:27:32,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 23:27:32,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 23:27:32,431 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:27:33,107 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 23:27:33,108 INFO L287 CfgBuilder]: Removed 16 assume(true) statements. [2019-12-27 23:27:33,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:27:33 BoogieIcfgContainer [2019-12-27 23:27:33,109 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 23:27:33,111 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 23:27:33,111 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 23:27:33,114 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 23:27:33,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 11:27:31" (1/3) ... [2019-12-27 23:27:33,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c348201 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:27:33, skipping insertion in model container [2019-12-27 23:27:33,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:27:32" (2/3) ... [2019-12-27 23:27:33,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c348201 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:27:33, skipping insertion in model container [2019-12-27 23:27:33,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:27:33" (3/3) ... [2019-12-27 23:27:33,119 INFO L109 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2019-12-27 23:27:33,129 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 23:27:33,129 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 23:27:33,137 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 23:27:33,138 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 23:27:33,195 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,195 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,196 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,196 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,196 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,196 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,197 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,197 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,197 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,197 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,197 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,198 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,198 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,198 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,198 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,199 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,199 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,199 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,199 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,199 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,199 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,200 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,200 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,200 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,200 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,200 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,201 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,201 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,201 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,201 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,201 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,202 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,202 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,202 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,202 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,202 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,202 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,203 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,203 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,203 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,203 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,203 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,204 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,204 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,204 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,204 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,204 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,205 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,205 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,205 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,205 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,205 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,206 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,206 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,206 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,206 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,206 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,207 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,207 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,207 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,207 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,207 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,208 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,208 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,208 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,208 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,208 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,209 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,209 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,209 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,209 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,209 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,210 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,210 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,210 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,210 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,210 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,210 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,211 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,211 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,211 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,211 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,211 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,212 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,212 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,212 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,213 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,214 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,214 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,214 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,214 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,214 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,215 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,215 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,215 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,215 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,216 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,216 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,216 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,216 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,217 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,217 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,217 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,217 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,217 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,217 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,218 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,218 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,218 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,218 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,218 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,219 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,219 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,219 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,219 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,219 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,220 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,220 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,220 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,220 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,220 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,220 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,221 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,221 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,221 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,221 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,221 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,222 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,222 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,222 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,222 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,222 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,223 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,223 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,223 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,223 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,223 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,223 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,224 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,224 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,224 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,224 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,224 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,225 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,225 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,225 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,225 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,225 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,225 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,226 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,226 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,226 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,226 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,226 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,227 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,227 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,227 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,227 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,227 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,227 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,228 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,228 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,228 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,228 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,228 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,228 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,229 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,229 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,229 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,229 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,229 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,230 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,230 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,230 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,230 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,230 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,231 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,231 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,231 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,231 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,231 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,231 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,232 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,232 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,232 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,232 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,232 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,233 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,233 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,233 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,233 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,233 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,233 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,234 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,234 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,234 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,234 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,234 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,234 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,235 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,235 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,235 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,235 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,235 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,236 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,236 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,236 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,236 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,236 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,236 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,237 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,237 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,240 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,241 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,241 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,241 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,241 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,242 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,242 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,242 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,242 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,242 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,243 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,243 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,243 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,243 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,243 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,244 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,244 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,244 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,244 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,244 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,244 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,250 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,251 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,262 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,263 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,263 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,263 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,263 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,263 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,264 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,264 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,264 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,264 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,265 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,265 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,265 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,265 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,265 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,265 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,266 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,266 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,266 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,266 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,267 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,267 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,267 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,268 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,268 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,268 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,268 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,269 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,269 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,269 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,269 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:27:33,289 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 23:27:33,313 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 23:27:33,313 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 23:27:33,313 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 23:27:33,313 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 23:27:33,313 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 23:27:33,313 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 23:27:33,314 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 23:27:33,314 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 23:27:33,336 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 196 places, 204 transitions [2019-12-27 23:27:33,812 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 10787 states. [2019-12-27 23:27:33,815 INFO L276 IsEmpty]: Start isEmpty. Operand 10787 states. [2019-12-27 23:27:33,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:27:33,828 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:33,830 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:27:33,830 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:27:33,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:33,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1929394428, now seen corresponding path program 1 times [2019-12-27 23:27:33,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:33,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70785127] [2019-12-27 23:27:33,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:34,171 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:27:34,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70785127] [2019-12-27 23:27:34,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:27:34,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 23:27:34,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1986937807] [2019-12-27 23:27:34,175 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:34,190 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:34,228 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 45 states and 44 transitions. [2019-12-27 23:27:34,228 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:34,234 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:27:34,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-27 23:27:34,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:34,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-27 23:27:34,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-27 23:27:34,253 INFO L87 Difference]: Start difference. First operand 10787 states. Second operand 2 states. [2019-12-27 23:27:34,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:34,395 INFO L93 Difference]: Finished difference Result 10784 states and 29353 transitions. [2019-12-27 23:27:34,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-27 23:27:34,396 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 44 [2019-12-27 23:27:34,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:34,487 INFO L225 Difference]: With dead ends: 10784 [2019-12-27 23:27:34,487 INFO L226 Difference]: Without dead ends: 9749 [2019-12-27 23:27:34,489 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:27:34,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9749 states. [2019-12-27 23:27:35,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9749 to 9749. [2019-12-27 23:27:35,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9749 states. [2019-12-27 23:27:35,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9749 states to 9749 states and 26526 transitions. [2019-12-27 23:27:35,064 INFO L78 Accepts]: Start accepts. Automaton has 9749 states and 26526 transitions. Word has length 44 [2019-12-27 23:27:35,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:35,066 INFO L462 AbstractCegarLoop]: Abstraction has 9749 states and 26526 transitions. [2019-12-27 23:27:35,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-27 23:27:35,066 INFO L276 IsEmpty]: Start isEmpty. Operand 9749 states and 26526 transitions. [2019-12-27 23:27:35,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 23:27:35,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:35,097 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:27:35,097 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:27:35,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:35,098 INFO L82 PathProgramCache]: Analyzing trace with hash -593181059, now seen corresponding path program 1 times [2019-12-27 23:27:35,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:35,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734511120] [2019-12-27 23:27:35,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:35,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:35,580 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:27:35,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734511120] [2019-12-27 23:27:35,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:27:35,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 23:27:35,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1765058277] [2019-12-27 23:27:35,581 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:35,726 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:35,805 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 98 states and 97 transitions. [2019-12-27 23:27:35,805 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:35,806 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:27:35,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:27:35,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:35,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:27:35,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:27:35,809 INFO L87 Difference]: Start difference. First operand 9749 states and 26526 transitions. Second operand 12 states. [2019-12-27 23:27:36,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:36,596 INFO L93 Difference]: Finished difference Result 9780 states and 26590 transitions. [2019-12-27 23:27:36,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:27:36,596 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 97 [2019-12-27 23:27:36,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:36,663 INFO L225 Difference]: With dead ends: 9780 [2019-12-27 23:27:36,663 INFO L226 Difference]: Without dead ends: 9780 [2019-12-27 23:27:36,666 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:27:36,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9780 states. [2019-12-27 23:27:36,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9780 to 9746. [2019-12-27 23:27:36,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9746 states. [2019-12-27 23:27:36,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9746 states to 9746 states and 26522 transitions. [2019-12-27 23:27:36,970 INFO L78 Accepts]: Start accepts. Automaton has 9746 states and 26522 transitions. Word has length 97 [2019-12-27 23:27:36,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:36,971 INFO L462 AbstractCegarLoop]: Abstraction has 9746 states and 26522 transitions. [2019-12-27 23:27:36,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:27:36,979 INFO L276 IsEmpty]: Start isEmpty. Operand 9746 states and 26522 transitions. [2019-12-27 23:27:36,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-27 23:27:36,996 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:36,996 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:27:36,996 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:27:36,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:36,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1482308150, now seen corresponding path program 1 times [2019-12-27 23:27:36,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:36,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377534654] [2019-12-27 23:27:36,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:37,436 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 15 [2019-12-27 23:27:37,920 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:27:37,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377534654] [2019-12-27 23:27:37,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:27:37,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 23:27:37,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [16243917] [2019-12-27 23:27:37,921 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:37,954 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:38,005 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 99 states and 98 transitions. [2019-12-27 23:27:38,005 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:38,009 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:27:38,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 23:27:38,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:38,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 23:27:38,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:27:38,011 INFO L87 Difference]: Start difference. First operand 9746 states and 26522 transitions. Second operand 18 states. [2019-12-27 23:27:40,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:40,504 INFO L93 Difference]: Finished difference Result 13022 states and 35325 transitions. [2019-12-27 23:27:40,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 23:27:40,505 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2019-12-27 23:27:40,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:40,539 INFO L225 Difference]: With dead ends: 13022 [2019-12-27 23:27:40,539 INFO L226 Difference]: Without dead ends: 13022 [2019-12-27 23:27:40,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=304, Invalid=956, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 23:27:40,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13022 states. [2019-12-27 23:27:40,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13022 to 11672. [2019-12-27 23:27:40,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11672 states. [2019-12-27 23:27:40,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11672 states to 11672 states and 31707 transitions. [2019-12-27 23:27:40,920 INFO L78 Accepts]: Start accepts. Automaton has 11672 states and 31707 transitions. Word has length 98 [2019-12-27 23:27:40,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:40,920 INFO L462 AbstractCegarLoop]: Abstraction has 11672 states and 31707 transitions. [2019-12-27 23:27:40,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 23:27:40,921 INFO L276 IsEmpty]: Start isEmpty. Operand 11672 states and 31707 transitions. [2019-12-27 23:27:40,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-27 23:27:40,938 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:40,938 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:27:40,939 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:27:40,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:40,939 INFO L82 PathProgramCache]: Analyzing trace with hash 921844576, now seen corresponding path program 1 times [2019-12-27 23:27:40,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:40,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034585951] [2019-12-27 23:27:40,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:41,017 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:27:41,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034585951] [2019-12-27 23:27:41,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:27:41,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 23:27:41,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1463152087] [2019-12-27 23:27:41,019 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:41,049 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:41,200 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 100 states and 99 transitions. [2019-12-27 23:27:41,200 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:41,202 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:27:41,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 23:27:41,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:41,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 23:27:41,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 23:27:41,203 INFO L87 Difference]: Start difference. First operand 11672 states and 31707 transitions. Second operand 4 states. [2019-12-27 23:27:41,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:41,273 INFO L93 Difference]: Finished difference Result 11918 states and 32061 transitions. [2019-12-27 23:27:41,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 23:27:41,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-12-27 23:27:41,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:41,329 INFO L225 Difference]: With dead ends: 11918 [2019-12-27 23:27:41,329 INFO L226 Difference]: Without dead ends: 11312 [2019-12-27 23:27:41,330 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:27:41,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11312 states. [2019-12-27 23:27:41,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11312 to 10268. [2019-12-27 23:27:41,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10268 states. [2019-12-27 23:27:41,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10268 states to 10268 states and 27635 transitions. [2019-12-27 23:27:41,603 INFO L78 Accepts]: Start accepts. Automaton has 10268 states and 27635 transitions. Word has length 99 [2019-12-27 23:27:41,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:41,605 INFO L462 AbstractCegarLoop]: Abstraction has 10268 states and 27635 transitions. [2019-12-27 23:27:41,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 23:27:41,606 INFO L276 IsEmpty]: Start isEmpty. Operand 10268 states and 27635 transitions. [2019-12-27 23:27:41,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-27 23:27:41,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:41,633 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:27:41,634 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:27:41,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:41,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1815021150, now seen corresponding path program 1 times [2019-12-27 23:27:41,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:41,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635424770] [2019-12-27 23:27:41,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:41,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:41,741 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:27:41,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635424770] [2019-12-27 23:27:41,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:27:41,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:27:41,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [360030424] [2019-12-27 23:27:41,743 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:41,797 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:42,149 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 329 states and 540 transitions. [2019-12-27 23:27:42,149 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:42,209 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 23:27:42,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 23:27:42,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:42,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 23:27:42,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 23:27:42,210 INFO L87 Difference]: Start difference. First operand 10268 states and 27635 transitions. Second operand 6 states. [2019-12-27 23:27:42,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:42,325 INFO L93 Difference]: Finished difference Result 1808 states and 4120 transitions. [2019-12-27 23:27:42,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 23:27:42,325 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 116 [2019-12-27 23:27:42,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:42,329 INFO L225 Difference]: With dead ends: 1808 [2019-12-27 23:27:42,329 INFO L226 Difference]: Without dead ends: 1544 [2019-12-27 23:27:42,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:27:42,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2019-12-27 23:27:42,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1424. [2019-12-27 23:27:42,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1424 states. [2019-12-27 23:27:42,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1424 states and 3200 transitions. [2019-12-27 23:27:42,367 INFO L78 Accepts]: Start accepts. Automaton has 1424 states and 3200 transitions. Word has length 116 [2019-12-27 23:27:42,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:42,367 INFO L462 AbstractCegarLoop]: Abstraction has 1424 states and 3200 transitions. [2019-12-27 23:27:42,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 23:27:42,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 3200 transitions. [2019-12-27 23:27:42,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-12-27 23:27:42,372 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:42,372 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:27:42,372 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:27:42,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:42,373 INFO L82 PathProgramCache]: Analyzing trace with hash -206631209, now seen corresponding path program 1 times [2019-12-27 23:27:42,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:42,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91180725] [2019-12-27 23:27:42,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:42,475 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:27:42,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91180725] [2019-12-27 23:27:42,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400398268] [2019-12-27 23:27:42,476 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:27:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:42,803 INFO L264 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-27 23:27:42,818 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:42,869 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:27:42,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:42,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-27 23:27:42,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [878706192] [2019-12-27 23:27:42,871 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:42,929 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:43,257 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 291 states and 442 transitions. [2019-12-27 23:27:43,257 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:43,259 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:27:43,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:27:43,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:43,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:27:43,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:27:43,260 INFO L87 Difference]: Start difference. First operand 1424 states and 3200 transitions. Second operand 5 states. [2019-12-27 23:27:43,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:43,304 INFO L93 Difference]: Finished difference Result 2240 states and 5060 transitions. [2019-12-27 23:27:43,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:27:43,305 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-12-27 23:27:43,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:43,310 INFO L225 Difference]: With dead ends: 2240 [2019-12-27 23:27:43,310 INFO L226 Difference]: Without dead ends: 2240 [2019-12-27 23:27:43,311 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:27:43,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2019-12-27 23:27:43,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 1844. [2019-12-27 23:27:43,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1844 states. [2019-12-27 23:27:43,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 4157 transitions. [2019-12-27 23:27:43,347 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 4157 transitions. Word has length 138 [2019-12-27 23:27:43,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:43,348 INFO L462 AbstractCegarLoop]: Abstraction has 1844 states and 4157 transitions. [2019-12-27 23:27:43,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:27:43,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 4157 transitions. [2019-12-27 23:27:43,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-12-27 23:27:43,353 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:43,353 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:27:43,557 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:43,558 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:27:43,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:43,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1577960977, now seen corresponding path program 2 times [2019-12-27 23:27:43,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:43,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615305759] [2019-12-27 23:27:43,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:43,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:43,686 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:27:43,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615305759] [2019-12-27 23:27:43,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690549777] [2019-12-27 23:27:43,687 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:27:43,822 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:27:43,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:43,824 INFO L264 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 23:27:43,829 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:43,877 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:27:43,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:43,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 23:27:43,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1237197197] [2019-12-27 23:27:43,878 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:43,933 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:45,557 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 407 states and 645 transitions. [2019-12-27 23:27:45,557 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:45,560 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:27:45,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:27:45,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:45,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:27:45,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:27:45,561 INFO L87 Difference]: Start difference. First operand 1844 states and 4157 transitions. Second operand 7 states. [2019-12-27 23:27:45,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:45,640 INFO L93 Difference]: Finished difference Result 2660 states and 6017 transitions. [2019-12-27 23:27:45,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 23:27:45,640 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 167 [2019-12-27 23:27:45,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:45,646 INFO L225 Difference]: With dead ends: 2660 [2019-12-27 23:27:45,646 INFO L226 Difference]: Without dead ends: 2660 [2019-12-27 23:27:45,647 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:27:45,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2660 states. [2019-12-27 23:27:45,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2660 to 2264. [2019-12-27 23:27:45,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2264 states. [2019-12-27 23:27:45,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 5114 transitions. [2019-12-27 23:27:45,690 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 5114 transitions. Word has length 167 [2019-12-27 23:27:45,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:45,691 INFO L462 AbstractCegarLoop]: Abstraction has 2264 states and 5114 transitions. [2019-12-27 23:27:45,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:27:45,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 5114 transitions. [2019-12-27 23:27:45,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-12-27 23:27:45,697 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:45,697 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:27:45,901 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:45,906 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:27:45,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:45,906 INFO L82 PathProgramCache]: Analyzing trace with hash -834842345, now seen corresponding path program 3 times [2019-12-27 23:27:45,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:45,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591955269] [2019-12-27 23:27:45,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:45,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:46,081 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:27:46,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591955269] [2019-12-27 23:27:46,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292434986] [2019-12-27 23:27:46,088 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:27:46,310 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 23:27:46,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:46,314 INFO L264 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 66 conjunts are in the unsatisfiable core [2019-12-27 23:27:46,328 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:46,405 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:46,405 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:46,408 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:46,409 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:27:46,409 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-27 23:27:46,448 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:46,448 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:27:46,449 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:46,455 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:46,455 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:27:46,456 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-27 23:27:46,584 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:27:46,584 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:46,594 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:46,594 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:27:46,594 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-12-27 23:27:46,628 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:46,629 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:46,639 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:46,640 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:46,641 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2019-12-27 23:27:46,748 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:27:46,762 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:46,763 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:27:46,764 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:46,796 INFO L614 ElimStorePlain]: treesize reduction 30, result has 55.2 percent of original size [2019-12-27 23:27:46,797 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:46,797 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:23 [2019-12-27 23:27:46,809 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:27:46,811 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:27:46,811 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:46,824 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:46,825 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:46,825 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:23 [2019-12-27 23:27:46,951 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:27:46,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-27 23:27:46,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [9] total 20 [2019-12-27 23:27:46,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1872772005] [2019-12-27 23:27:46,952 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:47,017 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:48,713 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 523 states and 848 transitions. [2019-12-27 23:27:48,713 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:48,715 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:27:48,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 23:27:48,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:48,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 23:27:48,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:27:48,716 INFO L87 Difference]: Start difference. First operand 2264 states and 5114 transitions. Second operand 13 states. [2019-12-27 23:27:49,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:49,223 INFO L93 Difference]: Finished difference Result 3701 states and 8378 transitions. [2019-12-27 23:27:49,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 23:27:49,223 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 196 [2019-12-27 23:27:49,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:49,230 INFO L225 Difference]: With dead ends: 3701 [2019-12-27 23:27:49,230 INFO L226 Difference]: Without dead ends: 3701 [2019-12-27 23:27:49,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 185 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=173, Invalid=639, Unknown=0, NotChecked=0, Total=812 [2019-12-27 23:27:49,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3701 states. [2019-12-27 23:27:49,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3701 to 3020. [2019-12-27 23:27:49,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3020 states. [2019-12-27 23:27:49,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3020 states to 3020 states and 6827 transitions. [2019-12-27 23:27:49,291 INFO L78 Accepts]: Start accepts. Automaton has 3020 states and 6827 transitions. Word has length 196 [2019-12-27 23:27:49,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:49,292 INFO L462 AbstractCegarLoop]: Abstraction has 3020 states and 6827 transitions. [2019-12-27 23:27:49,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 23:27:49,292 INFO L276 IsEmpty]: Start isEmpty. Operand 3020 states and 6827 transitions. [2019-12-27 23:27:49,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-12-27 23:27:49,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:49,301 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:27:49,506 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:49,506 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:27:49,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:49,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1197311036, now seen corresponding path program 1 times [2019-12-27 23:27:49,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:49,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696574380] [2019-12-27 23:27:49,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:49,715 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:27:49,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696574380] [2019-12-27 23:27:49,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503586042] [2019-12-27 23:27:49,716 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:27:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:49,973 INFO L264 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:27:49,977 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:50,036 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:27:50,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:50,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2019-12-27 23:27:50,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1378258800] [2019-12-27 23:27:50,037 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:50,118 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:51,753 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 539 states and 876 transitions. [2019-12-27 23:27:51,753 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:51,756 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:27:51,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:27:51,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:51,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:27:51,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-27 23:27:51,757 INFO L87 Difference]: Start difference. First operand 3020 states and 6827 transitions. Second operand 9 states. [2019-12-27 23:27:51,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:51,874 INFO L93 Difference]: Finished difference Result 4460 states and 10091 transitions. [2019-12-27 23:27:51,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 23:27:51,875 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 200 [2019-12-27 23:27:51,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:51,881 INFO L225 Difference]: With dead ends: 4460 [2019-12-27 23:27:51,881 INFO L226 Difference]: Without dead ends: 4460 [2019-12-27 23:27:51,882 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:27:51,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4460 states. [2019-12-27 23:27:52,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4460 to 3764. [2019-12-27 23:27:52,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3764 states. [2019-12-27 23:27:52,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 8513 transitions. [2019-12-27 23:27:52,075 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 8513 transitions. Word has length 200 [2019-12-27 23:27:52,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:52,076 INFO L462 AbstractCegarLoop]: Abstraction has 3764 states and 8513 transitions. [2019-12-27 23:27:52,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:27:52,076 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 8513 transitions. [2019-12-27 23:27:52,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-12-27 23:27:52,088 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:52,088 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:27:52,292 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:52,295 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:27:52,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:52,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1476674553, now seen corresponding path program 2 times [2019-12-27 23:27:52,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:52,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164729181] [2019-12-27 23:27:52,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:52,511 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:27:52,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164729181] [2019-12-27 23:27:52,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286420342] [2019-12-27 23:27:52,511 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:27:52,668 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:27:52,668 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:52,670 INFO L264 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 23:27:52,673 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:52,743 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:27:52,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:52,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2019-12-27 23:27:52,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2106145102] [2019-12-27 23:27:52,744 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:52,811 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:55,076 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 671 states and 1107 transitions. [2019-12-27 23:27:55,076 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:55,078 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:27:55,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:27:55,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:55,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:27:55,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-12-27 23:27:55,079 INFO L87 Difference]: Start difference. First operand 3764 states and 8513 transitions. Second operand 11 states. [2019-12-27 23:27:55,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:55,223 INFO L93 Difference]: Finished difference Result 5204 states and 11777 transitions. [2019-12-27 23:27:55,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 23:27:55,224 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 233 [2019-12-27 23:27:55,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:55,230 INFO L225 Difference]: With dead ends: 5204 [2019-12-27 23:27:55,230 INFO L226 Difference]: Without dead ends: 5204 [2019-12-27 23:27:55,231 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:27:55,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5204 states. [2019-12-27 23:27:55,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5204 to 4508. [2019-12-27 23:27:55,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4508 states. [2019-12-27 23:27:55,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4508 states to 4508 states and 10199 transitions. [2019-12-27 23:27:55,311 INFO L78 Accepts]: Start accepts. Automaton has 4508 states and 10199 transitions. Word has length 233 [2019-12-27 23:27:55,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:55,312 INFO L462 AbstractCegarLoop]: Abstraction has 4508 states and 10199 transitions. [2019-12-27 23:27:55,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:27:55,312 INFO L276 IsEmpty]: Start isEmpty. Operand 4508 states and 10199 transitions. [2019-12-27 23:27:55,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-12-27 23:27:55,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:55,332 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:27:55,537 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:55,537 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:27:55,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:55,538 INFO L82 PathProgramCache]: Analyzing trace with hash -308517151, now seen corresponding path program 3 times [2019-12-27 23:27:55,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:55,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271327369] [2019-12-27 23:27:55,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:56,142 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:27:56,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271327369] [2019-12-27 23:27:56,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069939241] [2019-12-27 23:27:56,143 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:27:56,448 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-27 23:27:56,448 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:56,451 INFO L264 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 74 conjunts are in the unsatisfiable core [2019-12-27 23:27:56,461 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:56,466 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:56,466 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:56,472 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:56,472 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:27:56,473 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-27 23:27:56,499 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:56,499 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:27:56,500 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:56,505 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:56,506 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:27:56,506 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-12-27 23:27:56,636 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:27:56,637 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:56,644 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:56,644 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:27:56,645 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-12-27 23:27:56,680 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:56,681 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:56,692 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:56,693 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:56,693 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:20 [2019-12-27 23:27:56,811 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:27:56,833 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:56,834 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 49 [2019-12-27 23:27:56,837 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:56,872 INFO L614 ElimStorePlain]: treesize reduction 26, result has 57.4 percent of original size [2019-12-27 23:27:56,873 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:56,873 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:26 [2019-12-27 23:27:56,885 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:27:56,887 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:27:56,888 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:56,902 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:56,903 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:56,903 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:26 [2019-12-27 23:27:57,061 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:57,061 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:57,068 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:57,069 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:27:57,069 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:20 [2019-12-27 23:27:57,107 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 23 treesize of output 22 [2019-12-27 23:27:57,107 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:57,115 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:57,116 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:27:57,116 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:30, output treesize:13 [2019-12-27 23:27:57,284 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:27:57,298 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:57,299 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:57,300 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:57,332 INFO L614 ElimStorePlain]: treesize reduction 26, result has 54.4 percent of original size [2019-12-27 23:27:57,332 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:57,333 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:22 [2019-12-27 23:27:57,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:27:57,342 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:57,343 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:57,357 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:57,358 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:57,358 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:22 [2019-12-27 23:27:57,364 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:57,365 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:27:57,370 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:27:57,370 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:27:57,371 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:10 [2019-12-27 23:27:57,571 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:57,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:57,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 22] total 33 [2019-12-27 23:27:57,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [63500821] [2019-12-27 23:27:57,572 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:57,656 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:28:01,269 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 787 states and 1310 transitions. [2019-12-27 23:28:01,269 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:28:01,272 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:28:01,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 23:28:01,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:28:01,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 23:28:01,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=931, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 23:28:01,273 INFO L87 Difference]: Start difference. First operand 4508 states and 10199 transitions. Second operand 13 states. [2019-12-27 23:28:01,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:28:01,485 INFO L93 Difference]: Finished difference Result 5948 states and 13463 transitions. [2019-12-27 23:28:01,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:28:01,490 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 262 [2019-12-27 23:28:01,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:28:01,497 INFO L225 Difference]: With dead ends: 5948 [2019-12-27 23:28:01,497 INFO L226 Difference]: Without dead ends: 5948 [2019-12-27 23:28:01,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 254 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=255, Invalid=1551, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 23:28:01,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5948 states. [2019-12-27 23:28:01,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5948 to 5252. [2019-12-27 23:28:01,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5252 states. [2019-12-27 23:28:01,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5252 states to 5252 states and 11885 transitions. [2019-12-27 23:28:01,583 INFO L78 Accepts]: Start accepts. Automaton has 5252 states and 11885 transitions. Word has length 262 [2019-12-27 23:28:01,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:28:01,583 INFO L462 AbstractCegarLoop]: Abstraction has 5252 states and 11885 transitions. [2019-12-27 23:28:01,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 23:28:01,583 INFO L276 IsEmpty]: Start isEmpty. Operand 5252 states and 11885 transitions. [2019-12-27 23:28:01,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-12-27 23:28:01,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:28:01,596 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:28:01,801 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:28:01,802 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:28:01,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:28:01,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1306885630, now seen corresponding path program 4 times [2019-12-27 23:28:01,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:28:01,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295608860] [2019-12-27 23:28:01,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:28:01,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:28:02,084 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:28:02,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295608860] [2019-12-27 23:28:02,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109963632] [2019-12-27 23:28:02,085 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:28:02,793 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:28:02,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:28:02,796 INFO L264 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:28:02,800 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:28:02,887 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:28:02,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:28:02,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2019-12-27 23:28:02,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1687137233] [2019-12-27 23:28:02,888 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:28:02,990 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:28:08,913 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 919 states and 1541 transitions. [2019-12-27 23:28:08,914 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:28:08,916 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:28:08,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 23:28:08,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:28:08,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 23:28:08,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-12-27 23:28:08,917 INFO L87 Difference]: Start difference. First operand 5252 states and 11885 transitions. Second operand 15 states. [2019-12-27 23:28:09,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:28:09,134 INFO L93 Difference]: Finished difference Result 6692 states and 15149 transitions. [2019-12-27 23:28:09,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 23:28:09,139 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 295 [2019-12-27 23:28:09,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:28:09,146 INFO L225 Difference]: With dead ends: 6692 [2019-12-27 23:28:09,147 INFO L226 Difference]: Without dead ends: 6692 [2019-12-27 23:28:09,147 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:28:09,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6692 states. [2019-12-27 23:28:09,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6692 to 5996. [2019-12-27 23:28:09,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5996 states. [2019-12-27 23:28:09,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5996 states to 5996 states and 13571 transitions. [2019-12-27 23:28:09,246 INFO L78 Accepts]: Start accepts. Automaton has 5996 states and 13571 transitions. Word has length 295 [2019-12-27 23:28:09,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:28:09,247 INFO L462 AbstractCegarLoop]: Abstraction has 5996 states and 13571 transitions. [2019-12-27 23:28:09,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 23:28:09,247 INFO L276 IsEmpty]: Start isEmpty. Operand 5996 states and 13571 transitions. [2019-12-27 23:28:09,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-12-27 23:28:09,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:28:09,262 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:28:09,476 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:28:09,476 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:28:09,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:28:09,476 INFO L82 PathProgramCache]: Analyzing trace with hash -912521530, now seen corresponding path program 5 times [2019-12-27 23:28:09,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:28:09,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272258511] [2019-12-27 23:28:09,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:28:09,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:28:09,926 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:28:09,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272258511] [2019-12-27 23:28:09,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681077086] [2019-12-27 23:28:09,928 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:28:10,165 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-12-27 23:28:10,165 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:28:10,169 INFO L264 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 82 conjunts are in the unsatisfiable core [2019-12-27 23:28:10,175 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:28:10,212 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:28:10,213 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:28:10,215 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:28:10,215 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:28:10,215 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-27 23:28:10,266 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:28:10,266 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:28:10,267 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:28:10,293 INFO L614 ElimStorePlain]: treesize reduction 24, result has 59.3 percent of original size [2019-12-27 23:28:10,294 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:28:10,294 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:23 [2019-12-27 23:28:10,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:10,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:10,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:10,568 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:28:10,569 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:28:10,589 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:28:10,590 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:28:10,591 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:28:10,615 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:28:10,615 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:28:10,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:10,617 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:28:10,704 INFO L614 ElimStorePlain]: treesize reduction 49, result has 65.2 percent of original size [2019-12-27 23:28:10,706 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:28:10,706 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:48 [2019-12-27 23:28:10,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:10,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:28:10,752 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:28:10,753 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:28:10,759 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:28:10,759 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:28:10,795 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:28:10,796 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:28:10,796 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:47 [2019-12-27 23:28:10,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:10,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:28:10,932 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:28:10,933 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:28:10,937 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:28:10,938 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:28:10,950 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:28:10,951 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 23:28:10,951 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:34 [2019-12-27 23:28:10,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:11,004 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:28:11,004 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:28:11,032 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:28:11,033 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:28:11,034 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:28:11,090 INFO L614 ElimStorePlain]: treesize reduction 23, result has 75.8 percent of original size [2019-12-27 23:28:11,091 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:28:11,092 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:48 [2019-12-27 23:28:11,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 23:28:11,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:11,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:11,444 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:28:11,446 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:28:11,465 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:28:11,465 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:28:11,466 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:28:11,493 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:28:11,493 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:28:11,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:11,495 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:28:11,584 INFO L614 ElimStorePlain]: treesize reduction 49, result has 65.2 percent of original size [2019-12-27 23:28:11,585 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:28:11,586 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:48 [2019-12-27 23:28:11,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:11,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:28:11,631 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:28:11,631 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:28:11,646 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:28:11,647 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:28:11,679 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:28:11,680 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:28:11,681 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:47 [2019-12-27 23:28:11,857 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:28:11,858 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:28:11,868 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:28:11,869 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:28:11,869 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:34 [2019-12-27 23:28:11,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:28:11,920 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:28:11,920 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:28:11,933 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:28:11,934 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:28:11,934 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:34 [2019-12-27 23:28:12,204 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:28:12,219 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:28:12,219 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:28:12,220 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:28:12,260 INFO L614 ElimStorePlain]: treesize reduction 26, result has 65.3 percent of original size [2019-12-27 23:28:12,261 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:28:12,261 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:40 [2019-12-27 23:28:12,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:28:12,267 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:28:12,268 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:28:12,285 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:28:12,285 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:28:12,286 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2019-12-27 23:28:12,567 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 34 treesize of output 18 [2019-12-27 23:28:12,568 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:28:12,581 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:28:12,582 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:28:12,583 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:34 [2019-12-27 23:28:12,636 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:28:12,637 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:28:12,637 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:28:12,648 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:28:12,649 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:28:12,650 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:19 [2019-12-27 23:28:12,872 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:28:12,873 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:28:12,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:12,874 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:28:12,896 INFO L614 ElimStorePlain]: treesize reduction 35, result has 46.2 percent of original size [2019-12-27 23:28:12,897 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:28:12,897 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:9 [2019-12-27 23:28:12,910 INFO L343 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2019-12-27 23:28:12,910 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:28:12,911 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:28:12,915 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:28:12,916 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:28:12,916 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:9 [2019-12-27 23:28:12,924 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:28:12,924 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:28:12,925 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:28:12,926 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:28:12,926 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-27 23:28:13,222 INFO L134 CoverageAnalysis]: Checked inductivity of 604 backedges. 438 proven. 119 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-12-27 23:28:13,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:28:13,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 36] total 51 [2019-12-27 23:28:13,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1373476701] [2019-12-27 23:28:13,223 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:28:13,793 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:28:20,811 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 1035 states and 1744 transitions. [2019-12-27 23:28:20,811 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:28:20,815 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:28:20,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 23:28:20,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:28:20,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 23:28:20,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=2244, Unknown=0, NotChecked=0, Total=2550 [2019-12-27 23:28:20,817 INFO L87 Difference]: Start difference. First operand 5996 states and 13571 transitions. Second operand 17 states. [2019-12-27 23:28:21,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:28:21,200 INFO L93 Difference]: Finished difference Result 7436 states and 16835 transitions. [2019-12-27 23:28:21,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 23:28:21,200 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 324 [2019-12-27 23:28:21,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:28:21,207 INFO L225 Difference]: With dead ends: 7436 [2019-12-27 23:28:21,208 INFO L226 Difference]: Without dead ends: 7436 [2019-12-27 23:28:21,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 301 SyntacticMatches, 6 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1412 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=544, Invalid=3616, Unknown=0, NotChecked=0, Total=4160 [2019-12-27 23:28:21,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7436 states. [2019-12-27 23:28:21,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7436 to 6740. [2019-12-27 23:28:21,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6740 states. [2019-12-27 23:28:21,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6740 states to 6740 states and 15257 transitions. [2019-12-27 23:28:21,311 INFO L78 Accepts]: Start accepts. Automaton has 6740 states and 15257 transitions. Word has length 324 [2019-12-27 23:28:21,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:28:21,312 INFO L462 AbstractCegarLoop]: Abstraction has 6740 states and 15257 transitions. [2019-12-27 23:28:21,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 23:28:21,312 INFO L276 IsEmpty]: Start isEmpty. Operand 6740 states and 15257 transitions. [2019-12-27 23:28:21,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-12-27 23:28:21,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:28:21,325 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:28:21,530 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:28:21,531 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:28:21,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:28:21,531 INFO L82 PathProgramCache]: Analyzing trace with hash -97176899, now seen corresponding path program 6 times [2019-12-27 23:28:21,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:28:21,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139942629] [2019-12-27 23:28:21,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:28:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:28:21,896 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:28:21,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139942629] [2019-12-27 23:28:21,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768001918] [2019-12-27 23:28:21,896 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:28:23,785 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-12-27 23:28:23,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:28:23,790 INFO L264 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 81 conjunts are in the unsatisfiable core [2019-12-27 23:28:23,798 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:28:23,833 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:28:23,833 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:28:23,837 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:28:23,837 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:28:23,837 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-27 23:28:23,868 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:28:23,868 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:28:23,869 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:28:23,892 INFO L614 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-12-27 23:28:23,892 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:28:23,893 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-12-27 23:28:23,922 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:28:23,922 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:28:23,936 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:28:23,936 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:28:23,936 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:27 [2019-12-27 23:28:23,999 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:28:23,999 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:28:24,000 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:28:24,046 INFO L614 ElimStorePlain]: treesize reduction 28, result has 58.8 percent of original size [2019-12-27 23:28:24,047 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:28:24,047 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:40 [2019-12-27 23:28:24,111 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:28:24,111 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:28:24,112 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:28:24,127 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:28:24,128 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:28:24,128 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:37 [2019-12-27 23:28:24,260 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:28:24,261 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:28:24,285 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:28:24,285 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:28:24,285 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:48 [2019-12-27 23:28:24,324 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:28:24,324 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:28:24,347 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:28:24,347 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:28:24,348 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:48 [2019-12-27 23:28:24,376 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:28:24,376 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:28:24,394 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:28:24,395 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:28:24,395 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:42 [2019-12-27 23:28:24,674 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:28:24,678 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:28:24,679 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:28:24,682 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:28:24,683 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:28:24,701 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:28:24,701 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:28:24,701 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:44 [2019-12-27 23:28:24,758 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:28:24,765 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:28:24,765 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:28:24,772 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:28:24,773 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:28:24,816 INFO L614 ElimStorePlain]: treesize reduction 4, result has 92.2 percent of original size [2019-12-27 23:28:24,817 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:28:24,817 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:55, output treesize:47 [2019-12-27 23:28:25,146 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-12-27 23:28:25,146 INFO L343 Elim1Store]: treesize reduction 8, result has 92.8 percent of original size [2019-12-27 23:28:25,147 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:28:25,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:25,248 INFO L430 ElimStorePlain]: Different costs {0=[v_arrayElimCell_55, v_arrayElimCell_53], 1=[v_arrayElimCell_54]} [2019-12-27 23:28:25,456 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:28:25,457 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@71db4b90 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@71db4b90 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:28:25,463 INFO L168 Benchmark]: Toolchain (without parser) took 54188.54 ms. Allocated memory was 145.8 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 101.7 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2019-12-27 23:28:25,464 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 23:28:25,464 INFO L168 Benchmark]: CACSL2BoogieTranslator took 952.02 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 101.2 MB in the beginning and 134.6 MB in the end (delta: -33.4 MB). Peak memory consumption was 32.9 MB. Max. memory is 7.1 GB. [2019-12-27 23:28:25,464 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.29 ms. Allocated memory is still 203.9 MB. Free memory was 134.6 MB in the beginning and 131.2 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:28:25,465 INFO L168 Benchmark]: Boogie Preprocessor took 39.72 ms. Allocated memory is still 203.9 MB. Free memory was 131.2 MB in the beginning and 129.2 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:28:25,465 INFO L168 Benchmark]: RCFGBuilder took 743.95 ms. Allocated memory was 203.9 MB in the beginning and 234.9 MB in the end (delta: 30.9 MB). Free memory was 129.2 MB in the beginning and 201.4 MB in the end (delta: -72.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. [2019-12-27 23:28:25,465 INFO L168 Benchmark]: TraceAbstraction took 52351.25 ms. Allocated memory was 234.9 MB in the beginning and 4.2 GB in the end (delta: 3.9 GB). Free memory was 201.4 MB in the beginning and 1.1 GB in the end (delta: -943.5 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2019-12-27 23:28:25,471 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.18 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 952.02 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 101.2 MB in the beginning and 134.6 MB in the end (delta: -33.4 MB). Peak memory consumption was 32.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 96.29 ms. Allocated memory is still 203.9 MB. Free memory was 134.6 MB in the beginning and 131.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.72 ms. Allocated memory is still 203.9 MB. Free memory was 131.2 MB in the beginning and 129.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 743.95 ms. Allocated memory was 203.9 MB in the beginning and 234.9 MB in the end (delta: 30.9 MB). Free memory was 129.2 MB in the beginning and 201.4 MB in the end (delta: -72.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 52351.25 ms. Allocated memory was 234.9 MB in the beginning and 4.2 GB in the end (delta: 3.9 GB). Free memory was 201.4 MB in the beginning and 1.1 GB in the end (delta: -943.5 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@71db4b90 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@71db4b90: 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...