/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-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread/stack-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 00:46:41,218 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 00:46:41,220 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 00:46:41,241 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 00:46:41,241 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 00:46:41,243 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 00:46:41,245 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 00:46:41,255 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 00:46:41,258 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 00:46:41,261 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 00:46:41,263 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 00:46:41,265 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 00:46:41,265 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 00:46:41,267 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 00:46:41,269 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 00:46:41,270 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 00:46:41,272 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 00:46:41,272 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 00:46:41,274 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 00:46:41,279 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 00:46:41,283 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 00:46:41,287 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 00:46:41,288 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 00:46:41,289 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 00:46:41,291 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 00:46:41,291 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 00:46:41,292 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 00:46:41,293 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 00:46:41,294 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 00:46:41,295 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 00:46:41,295 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 00:46:41,297 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 00:46:41,298 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 00:46:41,299 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 00:46:41,300 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 00:46:41,300 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 00:46:41,301 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 00:46:41,301 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 00:46:41,301 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 00:46:41,302 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 00:46:41,303 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 00:46:41,304 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-SemanticLbe.epf [2019-12-27 00:46:41,324 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 00:46:41,325 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 00:46:41,327 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 00:46:41,328 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 00:46:41,328 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 00:46:41,328 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 00:46:41,328 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 00:46:41,328 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 00:46:41,329 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 00:46:41,330 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 00:46:41,331 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 00:46:41,331 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 00:46:41,331 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 00:46:41,331 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 00:46:41,331 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 00:46:41,332 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 00:46:41,333 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 00:46:41,333 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 00:46:41,333 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 00:46:41,334 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 00:46:41,334 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 00:46:41,334 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 00:46:41,334 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 00:46:41,334 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 00:46:41,335 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 00:46:41,335 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 00:46:41,335 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 00:46:41,335 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 00:46:41,335 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 00:46:41,621 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 00:46:41,634 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 00:46:41,638 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 00:46:41,639 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 00:46:41,640 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 00:46:41,640 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack-2.i [2019-12-27 00:46:41,714 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7aa8e5e2b/32c465dbcf4c44b698ef354b34cff62d/FLAG89680cc12 [2019-12-27 00:46:42,289 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 00:46:42,290 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-2.i [2019-12-27 00:46:42,308 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7aa8e5e2b/32c465dbcf4c44b698ef354b34cff62d/FLAG89680cc12 [2019-12-27 00:46:42,529 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7aa8e5e2b/32c465dbcf4c44b698ef354b34cff62d [2019-12-27 00:46:42,541 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 00:46:42,543 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 00:46:42,545 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 00:46:42,545 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 00:46:42,548 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 00:46:42,550 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:46:42" (1/1) ... [2019-12-27 00:46:42,553 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ba65df4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:46:42, skipping insertion in model container [2019-12-27 00:46:42,553 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:46:42" (1/1) ... [2019-12-27 00:46:42,559 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 00:46:42,615 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 00:46:43,161 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:46:43,178 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 00:46:43,254 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:46:43,409 INFO L208 MainTranslator]: Completed translation [2019-12-27 00:46:43,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:46:43 WrapperNode [2019-12-27 00:46:43,410 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 00:46:43,411 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 00:46:43,411 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 00:46:43,411 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 00:46:43,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:46:43" (1/1) ... [2019-12-27 00:46:43,464 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:46:43" (1/1) ... [2019-12-27 00:46:43,504 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 00:46:43,505 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 00:46:43,505 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 00:46:43,505 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 00:46:43,516 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:46:43" (1/1) ... [2019-12-27 00:46:43,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:46:43" (1/1) ... [2019-12-27 00:46:43,520 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:46:43" (1/1) ... [2019-12-27 00:46:43,521 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:46:43" (1/1) ... [2019-12-27 00:46:43,529 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:46:43" (1/1) ... [2019-12-27 00:46:43,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:46:43" (1/1) ... [2019-12-27 00:46:43,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:46:43" (1/1) ... [2019-12-27 00:46:43,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 00:46:43,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 00:46:43,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 00:46:43,542 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 00:46:43,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:46:43" (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 00:46:43,599 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-12-27 00:46:43,600 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-12-27 00:46:43,600 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-12-27 00:46:43,600 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-12-27 00:46:43,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 00:46:43,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 00:46:43,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-27 00:46:43,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 00:46:43,602 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2019-12-27 00:46:43,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-27 00:46:43,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 00:46:43,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 00:46:43,606 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 00:46:44,139 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 00:46:44,140 INFO L287 CfgBuilder]: Removed 24 assume(true) statements. [2019-12-27 00:46:44,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:46:44 BoogieIcfgContainer [2019-12-27 00:46:44,141 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 00:46:44,142 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 00:46:44,142 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 00:46:44,146 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 00:46:44,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 12:46:42" (1/3) ... [2019-12-27 00:46:44,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17452223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:46:44, skipping insertion in model container [2019-12-27 00:46:44,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:46:43" (2/3) ... [2019-12-27 00:46:44,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17452223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:46:44, skipping insertion in model container [2019-12-27 00:46:44,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:46:44" (3/3) ... [2019-12-27 00:46:44,150 INFO L109 eAbstractionObserver]: Analyzing ICFG stack-2.i [2019-12-27 00:46:44,163 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 00:46:44,163 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 00:46:44,171 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 00:46:44,172 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 00:46:44,213 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,213 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,213 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,214 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,214 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,214 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,215 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,215 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,215 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,215 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,216 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,216 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,235 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,235 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,236 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,236 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,236 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,236 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,236 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,237 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,237 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,237 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,237 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,237 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,238 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,238 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,238 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,238 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,238 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,239 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,239 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,239 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,239 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,240 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,240 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,240 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,240 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,241 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,241 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,241 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,241 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,241 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,242 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,242 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,243 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,243 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,244 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,244 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,244 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,244 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,244 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,245 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,245 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,245 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,245 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,246 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,246 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,246 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,246 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,246 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,247 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,247 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,249 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,249 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,250 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,250 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,250 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,250 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,250 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,251 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,251 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,252 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,252 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,253 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,254 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,254 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,254 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,255 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,255 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,255 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,255 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,255 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,255 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,256 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,256 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,256 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,256 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,257 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,257 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,257 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,258 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,258 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,258 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,258 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,259 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,259 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,260 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,260 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,261 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,261 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,261 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,262 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,262 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,263 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,267 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,267 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,268 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,269 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,276 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,278 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,278 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,278 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,278 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,279 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,279 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,279 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,279 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,284 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,284 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,285 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,285 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,285 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,285 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,285 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,285 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,286 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,286 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,292 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,293 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,293 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,293 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,293 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,293 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,294 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,294 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,294 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,294 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,294 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,295 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,295 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,295 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,295 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,295 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,296 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,296 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,296 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,296 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,296 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,306 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,306 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,306 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,306 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,307 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,307 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,307 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,307 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,307 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,307 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,308 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,308 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,308 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,308 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,308 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,309 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,309 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,309 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,309 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:44,339 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 00:46:44,364 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:46:44,364 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:46:44,364 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:46:44,364 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:46:44,366 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:46:44,366 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:46:44,366 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:46:44,367 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:46:44,388 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 144 transitions [2019-12-27 00:46:44,390 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 140 places, 144 transitions [2019-12-27 00:46:44,496 INFO L132 PetriNetUnfolder]: 10/144 cut-off events. [2019-12-27 00:46:44,497 INFO L133 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2019-12-27 00:46:44,514 INFO L76 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 144 events. 10/144 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 363 event pairs. 0/133 useless extension candidates. Maximal degree in co-relation 108. Up to 3 conditions per place. [2019-12-27 00:46:44,524 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 140 places, 144 transitions [2019-12-27 00:46:44,603 INFO L132 PetriNetUnfolder]: 10/144 cut-off events. [2019-12-27 00:46:44,603 INFO L133 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2019-12-27 00:46:44,608 INFO L76 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 144 events. 10/144 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 363 event pairs. 0/133 useless extension candidates. Maximal degree in co-relation 108. Up to 3 conditions per place. [2019-12-27 00:46:44,620 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 5952 [2019-12-27 00:46:44,621 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:46:46,486 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-12-27 00:46:47,755 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 90 [2019-12-27 00:46:47,870 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-12-27 00:46:48,151 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-12-27 00:46:48,273 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-12-27 00:46:48,858 WARN L192 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 121 [2019-12-27 00:46:49,109 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-12-27 00:46:49,123 INFO L206 etLargeBlockEncoding]: Checked pairs total: 8014 [2019-12-27 00:46:49,124 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-27 00:46:49,127 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 41 transitions [2019-12-27 00:46:49,152 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 362 states. [2019-12-27 00:46:49,155 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states. [2019-12-27 00:46:49,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-27 00:46:49,162 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:46:49,163 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-27 00:46:49,164 INFO L410 AbstractCegarLoop]: === Iteration 1 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:46:49,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:46:49,170 INFO L82 PathProgramCache]: Analyzing trace with hash 150516578, now seen corresponding path program 1 times [2019-12-27 00:46:49,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:46:49,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320354655] [2019-12-27 00:46:49,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:46:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:46:49,391 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 00:46:49,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320354655] [2019-12-27 00:46:49,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:46:49,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:46:49,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707670145] [2019-12-27 00:46:49,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:46:49,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:46:49,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:46:49,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:46:49,411 INFO L87 Difference]: Start difference. First operand 362 states. Second operand 3 states. [2019-12-27 00:46:49,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:46:49,527 INFO L93 Difference]: Finished difference Result 575 states and 1450 transitions. [2019-12-27 00:46:49,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:46:49,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-12-27 00:46:49,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:46:49,571 INFO L225 Difference]: With dead ends: 575 [2019-12-27 00:46:49,572 INFO L226 Difference]: Without dead ends: 548 [2019-12-27 00:46:49,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:46:49,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2019-12-27 00:46:49,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 501. [2019-12-27 00:46:49,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-12-27 00:46:49,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 1328 transitions. [2019-12-27 00:46:49,663 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 1328 transitions. Word has length 6 [2019-12-27 00:46:49,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:46:49,665 INFO L462 AbstractCegarLoop]: Abstraction has 501 states and 1328 transitions. [2019-12-27 00:46:49,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:46:49,665 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 1328 transitions. [2019-12-27 00:46:49,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-27 00:46:49,666 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:46:49,666 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:46:49,667 INFO L410 AbstractCegarLoop]: === Iteration 2 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:46:49,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:46:49,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1112244910, now seen corresponding path program 1 times [2019-12-27 00:46:49,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:46:49,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643053679] [2019-12-27 00:46:49,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:46:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:46:49,795 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 00:46:49,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643053679] [2019-12-27 00:46:49,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:46:49,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:46:49,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614797679] [2019-12-27 00:46:49,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:46:49,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:46:49,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:46:49,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:46:49,799 INFO L87 Difference]: Start difference. First operand 501 states and 1328 transitions. Second operand 3 states. [2019-12-27 00:46:49,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:46:49,818 INFO L93 Difference]: Finished difference Result 614 states and 1590 transitions. [2019-12-27 00:46:49,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:46:49,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-27 00:46:49,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:46:49,823 INFO L225 Difference]: With dead ends: 614 [2019-12-27 00:46:49,823 INFO L226 Difference]: Without dead ends: 582 [2019-12-27 00:46:49,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:46:49,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-12-27 00:46:49,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 542. [2019-12-27 00:46:49,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-12-27 00:46:49,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1446 transitions. [2019-12-27 00:46:49,859 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 1446 transitions. Word has length 8 [2019-12-27 00:46:49,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:46:49,860 INFO L462 AbstractCegarLoop]: Abstraction has 542 states and 1446 transitions. [2019-12-27 00:46:49,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:46:49,860 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1446 transitions. [2019-12-27 00:46:49,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 00:46:49,861 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:46:49,861 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:46:49,862 INFO L410 AbstractCegarLoop]: === Iteration 3 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:46:49,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:46:49,862 INFO L82 PathProgramCache]: Analyzing trace with hash -726344194, now seen corresponding path program 1 times [2019-12-27 00:46:49,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:46:49,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725543687] [2019-12-27 00:46:49,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:46:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:46:49,924 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 00:46:49,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725543687] [2019-12-27 00:46:49,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:46:49,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:46:49,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323266511] [2019-12-27 00:46:49,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:46:49,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:46:49,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:46:49,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:46:49,927 INFO L87 Difference]: Start difference. First operand 542 states and 1446 transitions. Second operand 3 states. [2019-12-27 00:46:49,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:46:49,948 INFO L93 Difference]: Finished difference Result 574 states and 1527 transitions. [2019-12-27 00:46:49,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:46:49,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-27 00:46:49,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:46:49,956 INFO L225 Difference]: With dead ends: 574 [2019-12-27 00:46:49,956 INFO L226 Difference]: Without dead ends: 574 [2019-12-27 00:46:49,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:46:49,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-12-27 00:46:49,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-12-27 00:46:49,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-12-27 00:46:49,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 1527 transitions. [2019-12-27 00:46:49,992 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 1527 transitions. Word has length 10 [2019-12-27 00:46:49,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:46:49,994 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 1527 transitions. [2019-12-27 00:46:49,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:46:49,994 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 1527 transitions. [2019-12-27 00:46:49,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 00:46:49,999 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:46:50,000 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:46:50,000 INFO L410 AbstractCegarLoop]: === Iteration 4 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:46:50,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:46:50,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1779312196, now seen corresponding path program 1 times [2019-12-27 00:46:50,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:46:50,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195105734] [2019-12-27 00:46:50,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:46:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:46:50,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:46:50,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195105734] [2019-12-27 00:46:50,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730219924] [2019-12-27 00:46:50,137 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 00:46:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:46:50,237 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-27 00:46:50,243 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:46:50,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:46:50,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:46:50,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-12-27 00:46:50,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537050705] [2019-12-27 00:46:50,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:46:50,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:46:50,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:46:50,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:46:50,281 INFO L87 Difference]: Start difference. First operand 574 states and 1527 transitions. Second operand 7 states. [2019-12-27 00:46:50,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:46:50,369 INFO L93 Difference]: Finished difference Result 881 states and 2258 transitions. [2019-12-27 00:46:50,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:46:50,369 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-12-27 00:46:50,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:46:50,375 INFO L225 Difference]: With dead ends: 881 [2019-12-27 00:46:50,375 INFO L226 Difference]: Without dead ends: 876 [2019-12-27 00:46:50,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 00:46:50,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2019-12-27 00:46:50,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 698. [2019-12-27 00:46:50,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2019-12-27 00:46:50,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1846 transitions. [2019-12-27 00:46:50,399 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1846 transitions. Word has length 14 [2019-12-27 00:46:50,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:46:50,399 INFO L462 AbstractCegarLoop]: Abstraction has 698 states and 1846 transitions. [2019-12-27 00:46:50,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:46:50,399 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1846 transitions. [2019-12-27 00:46:50,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 00:46:50,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:46:50,400 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:46:50,603 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:46:50,604 INFO L410 AbstractCegarLoop]: === Iteration 5 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:46:50,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:46:50,604 INFO L82 PathProgramCache]: Analyzing trace with hash 624439316, now seen corresponding path program 1 times [2019-12-27 00:46:50,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:46:50,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448372423] [2019-12-27 00:46:50,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:46:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:46:50,651 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 00:46:50,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448372423] [2019-12-27 00:46:50,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:46:50,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:46:50,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047941523] [2019-12-27 00:46:50,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:46:50,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:46:50,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:46:50,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:46:50,654 INFO L87 Difference]: Start difference. First operand 698 states and 1846 transitions. Second operand 3 states. [2019-12-27 00:46:50,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:46:50,679 INFO L93 Difference]: Finished difference Result 367 states and 824 transitions. [2019-12-27 00:46:50,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:46:50,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 00:46:50,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:46:50,681 INFO L225 Difference]: With dead ends: 367 [2019-12-27 00:46:50,682 INFO L226 Difference]: Without dead ends: 355 [2019-12-27 00:46:50,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:46:50,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-12-27 00:46:50,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 335. [2019-12-27 00:46:50,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-12-27 00:46:50,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 751 transitions. [2019-12-27 00:46:50,691 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 751 transitions. Word has length 16 [2019-12-27 00:46:50,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:46:50,692 INFO L462 AbstractCegarLoop]: Abstraction has 335 states and 751 transitions. [2019-12-27 00:46:50,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:46:50,692 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 751 transitions. [2019-12-27 00:46:50,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 00:46:50,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:46:50,693 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:46:50,693 INFO L410 AbstractCegarLoop]: === Iteration 6 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:46:50,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:46:50,694 INFO L82 PathProgramCache]: Analyzing trace with hash -374234950, now seen corresponding path program 1 times [2019-12-27 00:46:50,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:46:50,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974994798] [2019-12-27 00:46:50,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:46:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:46:50,764 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 00:46:50,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974994798] [2019-12-27 00:46:50,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:46:50,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 00:46:50,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281716648] [2019-12-27 00:46:50,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:46:50,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:46:50,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:46:50,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:46:50,766 INFO L87 Difference]: Start difference. First operand 335 states and 751 transitions. Second operand 5 states. [2019-12-27 00:46:50,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:46:50,836 INFO L93 Difference]: Finished difference Result 456 states and 1016 transitions. [2019-12-27 00:46:50,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:46:50,837 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 00:46:50,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:46:50,840 INFO L225 Difference]: With dead ends: 456 [2019-12-27 00:46:50,840 INFO L226 Difference]: Without dead ends: 456 [2019-12-27 00:46:50,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:46:50,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-12-27 00:46:50,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 373. [2019-12-27 00:46:50,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-12-27 00:46:50,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 848 transitions. [2019-12-27 00:46:50,877 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 848 transitions. Word has length 17 [2019-12-27 00:46:50,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:46:50,877 INFO L462 AbstractCegarLoop]: Abstraction has 373 states and 848 transitions. [2019-12-27 00:46:50,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:46:50,877 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 848 transitions. [2019-12-27 00:46:50,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:46:50,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:46:50,879 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] [2019-12-27 00:46:50,879 INFO L410 AbstractCegarLoop]: === Iteration 7 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:46:50,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:46:50,879 INFO L82 PathProgramCache]: Analyzing trace with hash 2006895005, now seen corresponding path program 1 times [2019-12-27 00:46:50,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:46:50,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124808894] [2019-12-27 00:46:50,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:46:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:46:51,418 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 00:46:51,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124808894] [2019-12-27 00:46:51,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:46:51,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 00:46:51,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481504911] [2019-12-27 00:46:51,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 00:46:51,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:46:51,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 00:46:51,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-12-27 00:46:51,420 INFO L87 Difference]: Start difference. First operand 373 states and 848 transitions. Second operand 14 states. [2019-12-27 00:46:52,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:46:52,478 INFO L93 Difference]: Finished difference Result 779 states and 1709 transitions. [2019-12-27 00:46:52,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 00:46:52,478 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2019-12-27 00:46:52,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:46:52,484 INFO L225 Difference]: With dead ends: 779 [2019-12-27 00:46:52,484 INFO L226 Difference]: Without dead ends: 765 [2019-12-27 00:46:52,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2019-12-27 00:46:52,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2019-12-27 00:46:52,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 458. [2019-12-27 00:46:52,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-12-27 00:46:52,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 1045 transitions. [2019-12-27 00:46:52,500 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 1045 transitions. Word has length 21 [2019-12-27 00:46:52,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:46:52,500 INFO L462 AbstractCegarLoop]: Abstraction has 458 states and 1045 transitions. [2019-12-27 00:46:52,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 00:46:52,501 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 1045 transitions. [2019-12-27 00:46:52,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:46:52,502 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:46:52,502 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-12-27 00:46:52,502 INFO L410 AbstractCegarLoop]: === Iteration 8 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:46:52,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:46:52,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1651770902, now seen corresponding path program 2 times [2019-12-27 00:46:52,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:46:52,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914027179] [2019-12-27 00:46:52,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:46:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:46:52,592 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:46:52,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914027179] [2019-12-27 00:46:52,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448395695] [2019-12-27 00:46:52,593 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 00:46:52,685 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 00:46:52,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:46:52,687 INFO L264 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 00:46:52,688 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:46:52,712 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:46:52,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:46:52,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-12-27 00:46:52,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421373276] [2019-12-27 00:46:52,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:46:52,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:46:52,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:46:52,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:46:52,714 INFO L87 Difference]: Start difference. First operand 458 states and 1045 transitions. Second operand 9 states. [2019-12-27 00:46:52,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:46:52,784 INFO L93 Difference]: Finished difference Result 805 states and 1787 transitions. [2019-12-27 00:46:52,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 00:46:52,785 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-27 00:46:52,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:46:52,788 INFO L225 Difference]: With dead ends: 805 [2019-12-27 00:46:52,788 INFO L226 Difference]: Without dead ends: 794 [2019-12-27 00:46:52,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 00:46:52,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-12-27 00:46:52,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 570. [2019-12-27 00:46:52,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2019-12-27 00:46:52,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1311 transitions. [2019-12-27 00:46:52,806 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1311 transitions. Word has length 22 [2019-12-27 00:46:52,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:46:52,807 INFO L462 AbstractCegarLoop]: Abstraction has 570 states and 1311 transitions. [2019-12-27 00:46:52,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:46:52,807 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1311 transitions. [2019-12-27 00:46:52,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 00:46:52,808 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:46:52,809 INFO L411 BasicCegarLoop]: trace histogram [2, 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 00:46:53,012 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:46:53,014 INFO L410 AbstractCegarLoop]: === Iteration 9 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:46:53,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:46:53,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1466304191, now seen corresponding path program 1 times [2019-12-27 00:46:53,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:46:53,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504299355] [2019-12-27 00:46:53,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:46:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:46:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:46:53,102 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 00:46:53,102 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 00:46:53,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [560] [560] ULTIMATE.startENTRY-->L1001-1: Formula: (let ((.cse7 (store |v_#valid_63| 0 0))) (let ((.cse3 (store .cse7 |v_#t~string35.base_8| 1))) (let ((.cse4 (store .cse3 |v_#t~string39.base_8| 1))) (let ((.cse5 (store .cse4 |v_~#arr~0.base_45| 1))) (let ((.cse6 (store .cse5 |v_~#m~0.base_95| 1))) (let ((.cse2 (store .cse6 |v_ULTIMATE.start_main_~#id1~0.base_22| 1)) (.cse0 (select |v_#memory_int_72| |v_~#arr~0.base_45|)) (.cse1 (select |v_#memory_int_72| |v_~#m~0.base_95|))) (and (= |v_~#m~0.offset_95| 0) (< |v_#StackHeapBarrier_21| |v_~#m~0.base_95|) (= 0 |v_ULTIMATE.start_main_~#id2~0.offset_25|) (= |v_#NULL.offset_3| 0) (< 0 |v_#StackHeapBarrier_21|) (= 0 (select .cse0 (+ |v_~#arr~0.offset_45| 4))) (= 0 (select .cse1 (+ |v_~#m~0.offset_95| 12))) (= (select .cse1 (+ |v_~#m~0.offset_95| 4)) 0) (< |v_#StackHeapBarrier_21| |v_#t~string35.base_8|) (< |v_#StackHeapBarrier_21| |v_#t~string39.base_8|) (= 0 |v_ULTIMATE.start_main_~#id1~0.offset_19|) (= |v_#t~string35.offset_8| 0) (= (select .cse0 (+ |v_~#arr~0.offset_45| 16)) 0) (= (store |v_#memory_int_72| |v_ULTIMATE.start_main_~#id1~0.base_22| (store (select |v_#memory_int_72| |v_ULTIMATE.start_main_~#id1~0.base_22|) |v_ULTIMATE.start_main_~#id1~0.offset_19| 0)) |v_#memory_int_71|) (= (select .cse2 |v_ULTIMATE.start_main_~#id2~0.base_28|) 0) (= 0 |v_#t~string39.offset_8|) (= 0 |v_~#arr~0.offset_45|) (= (select .cse1 (+ |v_~#m~0.offset_95| 8)) 0) (= |v_#valid_61| (store .cse2 |v_ULTIMATE.start_main_~#id2~0.base_28| 1)) (= (select .cse0 (+ |v_~#arr~0.offset_45| 12)) 0) (= 0 (select .cse3 |v_#t~string39.base_8|)) (= 0 (select .cse1 |v_~#m~0.offset_95|)) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#id1~0.base_22|) (= |v_#pthreadsMutex_212| (store |v_#pthreadsMutex_213| |v_~#m~0.base_95| (store (select |v_#pthreadsMutex_213| |v_~#m~0.base_95|) |v_~#m~0.offset_95| 0))) (= 0 (select .cse4 |v_~#arr~0.base_45|)) (= (select .cse0 (+ |v_~#arr~0.offset_45| 8)) 0) (= (select .cse0 |v_~#arr~0.offset_45|) 0) (= 0 |v_#NULL.base_3|) (= (select .cse5 |v_~#m~0.base_95|) 0) (= 0 v_~top~0_145) (= (select .cse6 |v_ULTIMATE.start_main_~#id1~0.base_22|) 0) (= (select .cse1 (+ |v_~#m~0.offset_95| 16)) 0) (= v_~flag~0_63 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#id2~0.base_28|) (< |v_#StackHeapBarrier_21| |v_~#arr~0.base_45|) (= (select .cse7 |v_#t~string35.base_8|) 0) (= |v_#length_41| (store (store (store (store (store (store |v_#length_43| |v_#t~string35.base_8| 16) |v_#t~string39.base_8| 17) |v_~#arr~0.base_45| 20) |v_~#m~0.base_95| 24) |v_ULTIMATE.start_main_~#id1~0.base_22| 4) |v_ULTIMATE.start_main_~#id2~0.base_28| 4))))))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_213|, #StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_72|, #length=|v_#length_43|} OutVars{ULTIMATE.start_main_~#id1~0.base=|v_ULTIMATE.start_main_~#id1~0.base_22|, #t~string35.offset=|v_#t~string35.offset_8|, ~flag~0=v_~flag~0_63, #t~string39.base=|v_#t~string39.base_8|, #NULL.offset=|v_#NULL.offset_3|, ~top~0=v_~top~0_145, ULTIMATE.start_main_#t~nondet50=|v_ULTIMATE.start_main_#t~nondet50_10|, ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_28|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_25|, #t~string39.offset=|v_#t~string39.offset_8|, #length=|v_#length_41|, ULTIMATE.start_main_#t~nondet49=|v_ULTIMATE.start_main_#t~nondet49_10|, ~#arr~0.base=|v_~#arr~0.base_45|, #pthreadsMutex=|v_#pthreadsMutex_212|, ~#arr~0.offset=|v_~#arr~0.offset_45|, ULTIMATE.start_main_#t~mem52=|v_ULTIMATE.start_main_#t~mem52_20|, ULTIMATE.start_main_#t~mem51=|v_ULTIMATE.start_main_#t~mem51_15|, #t~string35.base=|v_#t~string35.base_8|, #NULL.base=|v_#NULL.base_3|, ~#m~0.base=|v_~#m~0.base_95|, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ~#m~0.offset=|v_~#m~0.offset_95|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_15|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_71|, ULTIMATE.start_main_~#id1~0.offset=|v_ULTIMATE.start_main_~#id1~0.offset_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id1~0.base, #t~string35.offset, ~flag~0, #t~string39.base, #NULL.offset, ~top~0, ULTIMATE.start_main_#t~nondet50, ULTIMATE.start_main_~#id2~0.base, ULTIMATE.start_main_~#id2~0.offset, #t~string39.offset, #length, ULTIMATE.start_main_#t~nondet49, ~#arr~0.base, #pthreadsMutex, ~#arr~0.offset, ULTIMATE.start_main_#t~mem52, ULTIMATE.start_main_#t~mem51, #t~string35.base, #NULL.base, ~#m~0.base, ~#m~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#id1~0.offset] because there is no mapped edge [2019-12-27 00:46:53,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [467] [467] L1001-2-->L1002-1: Formula: (= (store |v_#memory_int_27| |v_ULTIMATE.start_main_~#id2~0.base_10| (store (select |v_#memory_int_27| |v_ULTIMATE.start_main_~#id2~0.base_10|) |v_ULTIMATE.start_main_~#id2~0.offset_9| 1)) |v_#memory_int_26|) InVars {ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_10|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_9|, #memory_int=|v_#memory_int_27|} OutVars{ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_10|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_9|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_main_#t~nondet49=|v_ULTIMATE.start_main_#t~nondet49_3|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~nondet49] because there is no mapped edge [2019-12-27 00:46:53,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [502] [502] t2ENTRY-->L985-6: Formula: (and (= |v_t2Thread1of1ForFork1_#in~arg.offset_5| v_t2Thread1of1ForFork1_~arg.offset_5) (= |v_t2Thread1of1ForFork1_#in~arg.base_5| v_t2Thread1of1ForFork1_~arg.base_5) (= v_t2Thread1of1ForFork1_~i~1_18 0)) InVars {t2Thread1of1ForFork1_#in~arg.base=|v_t2Thread1of1ForFork1_#in~arg.base_5|, t2Thread1of1ForFork1_#in~arg.offset=|v_t2Thread1of1ForFork1_#in~arg.offset_5|} OutVars{t2Thread1of1ForFork1_#in~arg.base=|v_t2Thread1of1ForFork1_#in~arg.base_5|, t2Thread1of1ForFork1_~arg.base=v_t2Thread1of1ForFork1_~arg.base_5, t2Thread1of1ForFork1_~arg.offset=v_t2Thread1of1ForFork1_~arg.offset_5, t2Thread1of1ForFork1_#in~arg.offset=|v_t2Thread1of1ForFork1_#in~arg.offset_5|, t2Thread1of1ForFork1_~i~1=v_t2Thread1of1ForFork1_~i~1_18} AuxVars[] AssignedVars[t2Thread1of1ForFork1_~arg.base, t2Thread1of1ForFork1_~arg.offset, t2Thread1of1ForFork1_~i~1] because there is no mapped edge [2019-12-27 00:46:53,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [526] [526] t1ENTRY-->L970-6: Formula: (and (= |v_t1Thread1of1ForFork0_#in~arg.base_5| v_t1Thread1of1ForFork0_~arg.base_5) (= v_t1Thread1of1ForFork0_~i~0_18 0) (= |v_t1Thread1of1ForFork0_#in~arg.offset_5| v_t1Thread1of1ForFork0_~arg.offset_5)) InVars {t1Thread1of1ForFork0_#in~arg.base=|v_t1Thread1of1ForFork0_#in~arg.base_5|, t1Thread1of1ForFork0_#in~arg.offset=|v_t1Thread1of1ForFork0_#in~arg.offset_5|} OutVars{t1Thread1of1ForFork0_~i~0=v_t1Thread1of1ForFork0_~i~0_18, t1Thread1of1ForFork0_~tmp~0=v_t1Thread1of1ForFork0_~tmp~0_12, t1Thread1of1ForFork0_~arg.base=v_t1Thread1of1ForFork0_~arg.base_5, t1Thread1of1ForFork0_#in~arg.base=|v_t1Thread1of1ForFork0_#in~arg.base_5|, t1Thread1of1ForFork0_~arg.offset=v_t1Thread1of1ForFork0_~arg.offset_5, t1Thread1of1ForFork0_#in~arg.offset=|v_t1Thread1of1ForFork0_#in~arg.offset_5|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_~i~0, t1Thread1of1ForFork0_~tmp~0, t1Thread1of1ForFork0_~arg.base, t1Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 00:46:53,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [539] [539] L970-6-->L975: Formula: (let ((.cse0 (select |v_#pthreadsMutex_122| |v_~#m~0.base_58|))) (and (< v_t1Thread1of1ForFork0_~i~0_30 5) (= 0 (select .cse0 |v_~#m~0.offset_58|)) (< (mod v_t1Thread1of1ForFork0_~tmp~0_13 4294967296) 5) (= (store |v_#pthreadsMutex_122| |v_~#m~0.base_58| (store .cse0 |v_~#m~0.offset_58| 1)) |v_#pthreadsMutex_121|) (= |v_t1Thread1of1ForFork0_#t~nondet44_10| v_t1Thread1of1ForFork0_~tmp~0_13))) InVars {#pthreadsMutex=|v_#pthreadsMutex_122|, ~#m~0.base=|v_~#m~0.base_58|, t1Thread1of1ForFork0_~i~0=v_t1Thread1of1ForFork0_~i~0_30, ~#m~0.offset=|v_~#m~0.offset_58|, t1Thread1of1ForFork0_#t~nondet44=|v_t1Thread1of1ForFork0_#t~nondet44_10|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_121|, ~#m~0.base=|v_~#m~0.base_58|, t1Thread1of1ForFork0_~i~0=v_t1Thread1of1ForFork0_~i~0_30, t1Thread1of1ForFork0_~tmp~0=v_t1Thread1of1ForFork0_~tmp~0_13, ~#m~0.offset=|v_~#m~0.offset_58|, t1Thread1of1ForFork0_#t~nondet43=|v_t1Thread1of1ForFork0_#t~nondet43_24|, t1Thread1of1ForFork0_#t~nondet44=|v_t1Thread1of1ForFork0_#t~nondet44_9|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork0_~tmp~0, t1Thread1of1ForFork0_#t~nondet43, t1Thread1of1ForFork0_#t~nondet44] because there is no mapped edge [2019-12-27 00:46:53,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [546] [546] L975-->L932: Formula: (and (= |v_t1Thread1of1ForFork0_push_#in~stack.offset_8| |v_~#arr~0.offset_20|) (= |v_t1Thread1of1ForFork0_push_#in~stack.base_8| v_t1Thread1of1ForFork0_push_~stack.base_19) (not (= 5 v_~top~0_94)) (= |v_t1Thread1of1ForFork0_push_#in~stack.offset_8| v_t1Thread1of1ForFork0_push_~stack.offset_19) (= |v_t1Thread1of1ForFork0_push_#in~x_22| v_t1Thread1of1ForFork0_push_~x_33) (let ((.cse1 (mod v_t1Thread1of1ForFork0_~tmp~0_14 4294967296))) (let ((.cse0 (<= .cse1 2147483647))) (or (and .cse0 (= |v_t1Thread1of1ForFork0_push_#in~x_22| .cse1)) (and (not .cse0) (= |v_t1Thread1of1ForFork0_push_#in~x_22| (+ .cse1 (- 4294967296))))))) (= |v_~#arr~0.base_20| |v_t1Thread1of1ForFork0_push_#in~stack.base_8|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_20|, t1Thread1of1ForFork0_~tmp~0=v_t1Thread1of1ForFork0_~tmp~0_14, ~top~0=v_~top~0_94, ~#arr~0.base=|v_~#arr~0.base_20|} OutVars{t1Thread1of1ForFork0_push_#in~x=|v_t1Thread1of1ForFork0_push_#in~x_22|, ~#arr~0.offset=|v_~#arr~0.offset_20|, t1Thread1of1ForFork0_push_~stack.offset=v_t1Thread1of1ForFork0_push_~stack.offset_19, t1Thread1of1ForFork0_push_#res=|v_t1Thread1of1ForFork0_push_#res_22|, t1Thread1of1ForFork0_push_#t~ret36=|v_t1Thread1of1ForFork0_push_#t~ret36_32|, ~top~0=v_~top~0_94, t1Thread1of1ForFork0_push_~stack.base=v_t1Thread1of1ForFork0_push_~stack.base_19, t1Thread1of1ForFork0_push_#in~stack.base=|v_t1Thread1of1ForFork0_push_#in~stack.base_8|, t1Thread1of1ForFork0_~tmp~0=v_t1Thread1of1ForFork0_~tmp~0_14, t1Thread1of1ForFork0_push_~x=v_t1Thread1of1ForFork0_push_~x_33, t1Thread1of1ForFork0_push_#t~nondet34=|v_t1Thread1of1ForFork0_push_#t~nondet34_11|, t1Thread1of1ForFork0_get_top_#res=|v_t1Thread1of1ForFork0_get_top_#res_18|, t1Thread1of1ForFork0_push_#in~stack.offset=|v_t1Thread1of1ForFork0_push_#in~stack.offset_8|, ~#arr~0.base=|v_~#arr~0.base_20|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#in~x, t1Thread1of1ForFork0_push_~stack.base, t1Thread1of1ForFork0_push_#in~stack.base, t1Thread1of1ForFork0_push_~x, t1Thread1of1ForFork0_push_#t~nondet34, t1Thread1of1ForFork0_get_top_#res, t1Thread1of1ForFork0_push_~stack.offset, t1Thread1of1ForFork0_push_#res, t1Thread1of1ForFork0_push_#t~ret36, t1Thread1of1ForFork0_push_#in~stack.offset] because there is no mapped edge [2019-12-27 00:46:53,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [490] [490] L932-->L947-1: Formula: (and (= |v_t1Thread1of1ForFork0_get_top_#res_8| |v_t1Thread1of1ForFork0_push_#t~ret36_10|) (= |v_t1Thread1of1ForFork0_get_top_#res_8| v_~top~0_33)) InVars {~top~0=v_~top~0_33} OutVars{t1Thread1of1ForFork0_get_top_#res=|v_t1Thread1of1ForFork0_get_top_#res_8|, t1Thread1of1ForFork0_push_#t~ret36=|v_t1Thread1of1ForFork0_push_#t~ret36_10|, ~top~0=v_~top~0_33} AuxVars[] AssignedVars[t1Thread1of1ForFork0_get_top_#res, t1Thread1of1ForFork0_push_#t~ret36] because there is no mapped edge [2019-12-27 00:46:53,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [503] [503] L947-1-->L948: Formula: (and (= (store |v_#memory_int_39| v_t1Thread1of1ForFork0_push_~stack.base_11 (store (select |v_#memory_int_39| v_t1Thread1of1ForFork0_push_~stack.base_11) (+ v_t1Thread1of1ForFork0_push_~stack.offset_11 (* |v_t1Thread1of1ForFork0_push_#t~ret36_14| 4)) v_t1Thread1of1ForFork0_push_~x_12)) |v_#memory_int_38|) (<= 0 (+ |v_t1Thread1of1ForFork0_push_#t~ret36_14| 2147483648)) (<= |v_t1Thread1of1ForFork0_push_#t~ret36_14| 2147483647)) InVars {t1Thread1of1ForFork0_push_~stack.base=v_t1Thread1of1ForFork0_push_~stack.base_11, t1Thread1of1ForFork0_push_~x=v_t1Thread1of1ForFork0_push_~x_12, #memory_int=|v_#memory_int_39|, t1Thread1of1ForFork0_push_~stack.offset=v_t1Thread1of1ForFork0_push_~stack.offset_11, t1Thread1of1ForFork0_push_#t~ret36=|v_t1Thread1of1ForFork0_push_#t~ret36_14|} OutVars{t1Thread1of1ForFork0_push_~stack.base=v_t1Thread1of1ForFork0_push_~stack.base_11, t1Thread1of1ForFork0_push_~x=v_t1Thread1of1ForFork0_push_~x_12, #memory_int=|v_#memory_int_38|, t1Thread1of1ForFork0_push_~stack.offset=v_t1Thread1of1ForFork0_push_~stack.offset_11, t1Thread1of1ForFork0_push_#t~ret36=|v_t1Thread1of1ForFork0_push_#t~ret36_13|} AuxVars[] AssignedVars[#memory_int, t1Thread1of1ForFork0_push_#t~ret36] because there is no mapped edge [2019-12-27 00:46:53,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [457] [457] L948-->L924-1: Formula: (= |v_t1Thread1of1ForFork0_inc_top_#t~post31_7| v_~top~0_11) InVars {~top~0=v_~top~0_11} OutVars{t1Thread1of1ForFork0_inc_top_#t~post31=|v_t1Thread1of1ForFork0_inc_top_#t~post31_7|, ~top~0=v_~top~0_11} AuxVars[] AssignedVars[t1Thread1of1ForFork0_inc_top_#t~post31] because there is no mapped edge [2019-12-27 00:46:53,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [533] [533] L924-1-->L975-4: Formula: (and (= |v_t1Thread1of1ForFork0_#t~ret45_26| |v_t1Thread1of1ForFork0_push_#res_16|) (= 0 |v_t1Thread1of1ForFork0_push_#res_16|) (= (+ |v_t1Thread1of1ForFork0_inc_top_#t~post31_33| 1) v_~top~0_68)) InVars {t1Thread1of1ForFork0_inc_top_#t~post31=|v_t1Thread1of1ForFork0_inc_top_#t~post31_33|} OutVars{t1Thread1of1ForFork0_#t~ret45=|v_t1Thread1of1ForFork0_#t~ret45_26|, t1Thread1of1ForFork0_inc_top_#t~post31=|v_t1Thread1of1ForFork0_inc_top_#t~post31_32|, t1Thread1of1ForFork0_push_#res=|v_t1Thread1of1ForFork0_push_#res_16|, ~top~0=v_~top~0_68} AuxVars[] AssignedVars[t1Thread1of1ForFork0_#t~ret45, t1Thread1of1ForFork0_inc_top_#t~post31, t1Thread1of1ForFork0_push_#res, ~top~0] because there is no mapped edge [2019-12-27 00:46:53,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [532] [532] L975-4-->L978: Formula: (and (not (= (- 1) |t1Thread1of1ForFork0_#t~ret45_In1774689337|)) (= ~flag~0_Out1774689337 1)) InVars {t1Thread1of1ForFork0_#t~ret45=|t1Thread1of1ForFork0_#t~ret45_In1774689337|} OutVars{t1Thread1of1ForFork0_#t~ret45=|t1Thread1of1ForFork0_#t~ret45_Out1774689337|, ~flag~0=~flag~0_Out1774689337} AuxVars[] AssignedVars[t1Thread1of1ForFork0_#t~ret45, ~flag~0] because there is no mapped edge [2019-12-27 00:46:53,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [538] [538] L978-->L970-6: Formula: (and (= v_t1Thread1of1ForFork0_~i~0_26 (+ v_t1Thread1of1ForFork0_~i~0_27 1)) (= (store |v_#pthreadsMutex_114| |v_~#m~0.base_55| (store (select |v_#pthreadsMutex_114| |v_~#m~0.base_55|) |v_~#m~0.offset_55| 0)) |v_#pthreadsMutex_113|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_114|, ~#m~0.base=|v_~#m~0.base_55|, t1Thread1of1ForFork0_~i~0=v_t1Thread1of1ForFork0_~i~0_27, ~#m~0.offset=|v_~#m~0.offset_55|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_113|, ~#m~0.base=|v_~#m~0.base_55|, t1Thread1of1ForFork0_#t~post42=|v_t1Thread1of1ForFork0_#t~post42_9|, t1Thread1of1ForFork0_~i~0=v_t1Thread1of1ForFork0_~i~0_26, ~#m~0.offset=|v_~#m~0.offset_55|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork0_#t~post42, t1Thread1of1ForFork0_~i~0] because there is no mapped edge [2019-12-27 00:46:53,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [482] [482] L985-6-->L987-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_24| |v_~#m~0.base_20|))) (and (< v_t2Thread1of1ForFork1_~i~1_12 5) (= 0 |v_t2Thread1of1ForFork1_#t~nondet47_7|) (= 0 (select .cse0 |v_~#m~0.offset_20|)) (= (store |v_#pthreadsMutex_24| |v_~#m~0.base_20| (store .cse0 |v_~#m~0.offset_20| 1)) |v_#pthreadsMutex_23|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_24|, ~#m~0.base=|v_~#m~0.base_20|, ~#m~0.offset=|v_~#m~0.offset_20|, t2Thread1of1ForFork1_~i~1=v_t2Thread1of1ForFork1_~i~1_12} OutVars{t2Thread1of1ForFork1_#t~nondet47=|v_t2Thread1of1ForFork1_#t~nondet47_7|, #pthreadsMutex=|v_#pthreadsMutex_23|, ~#m~0.base=|v_~#m~0.base_20|, ~#m~0.offset=|v_~#m~0.offset_20|, t2Thread1of1ForFork1_~i~1=v_t2Thread1of1ForFork1_~i~1_12} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~nondet47, #pthreadsMutex] because there is no mapped edge [2019-12-27 00:46:53,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [551] [551] L987-1-->L954-4: Formula: (and (= |v_t2Thread1of1ForFork1_get_top_#res_38| v_~top~0_126) (not (= (mod v_~flag~0_47 256) 0)) (= |v_t2Thread1of1ForFork1_pop_#t~ret37_44| |v_t2Thread1of1ForFork1_get_top_#res_38|) (= |v_~#arr~0.base_29| |v_t2Thread1of1ForFork1_pop_#in~stack.base_19|) (<= 0 (+ |v_t2Thread1of1ForFork1_pop_#t~ret37_44| 2147483648)) (<= |v_t2Thread1of1ForFork1_pop_#t~ret37_44| 2147483647) (= v_t2Thread1of1ForFork1_pop_~stack.base_21 |v_t2Thread1of1ForFork1_pop_#in~stack.base_19|) (not (= |v_t2Thread1of1ForFork1_pop_#t~ret37_44| 0)) (= v_t2Thread1of1ForFork1_pop_~stack.offset_21 |v_t2Thread1of1ForFork1_pop_#in~stack.offset_19|) (= |v_~#arr~0.offset_29| |v_t2Thread1of1ForFork1_pop_#in~stack.offset_19|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_29|, ~flag~0=v_~flag~0_47, ~top~0=v_~top~0_126, ~#arr~0.base=|v_~#arr~0.base_29|} OutVars{t2Thread1of1ForFork1_#t~nondet47=|v_t2Thread1of1ForFork1_#t~nondet47_43|, t2Thread1of1ForFork1_pop_~stack.offset=v_t2Thread1of1ForFork1_pop_~stack.offset_21, ~#arr~0.offset=|v_~#arr~0.offset_29|, t2Thread1of1ForFork1_pop_#res=|v_t2Thread1of1ForFork1_pop_#res_23|, ~flag~0=v_~flag~0_47, t2Thread1of1ForFork1_pop_#in~stack.offset=|v_t2Thread1of1ForFork1_pop_#in~stack.offset_19|, ~top~0=v_~top~0_126, t2Thread1of1ForFork1_pop_#t~ret37=|v_t2Thread1of1ForFork1_pop_#t~ret37_44|, t2Thread1of1ForFork1_get_top_#res=|v_t2Thread1of1ForFork1_get_top_#res_38|, t2Thread1of1ForFork1_pop_#t~mem41=|v_t2Thread1of1ForFork1_pop_#t~mem41_25|, t2Thread1of1ForFork1_pop_#t~ret40=|v_t2Thread1of1ForFork1_pop_#t~ret40_29|, t2Thread1of1ForFork1_pop_#t~nondet38=|v_t2Thread1of1ForFork1_pop_#t~nondet38_17|, t2Thread1of1ForFork1_pop_#in~stack.base=|v_t2Thread1of1ForFork1_pop_#in~stack.base_19|, t2Thread1of1ForFork1_pop_~stack.base=v_t2Thread1of1ForFork1_pop_~stack.base_21, ~#arr~0.base=|v_~#arr~0.base_29|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~nondet47, t2Thread1of1ForFork1_pop_~stack.offset, t2Thread1of1ForFork1_get_top_#res, t2Thread1of1ForFork1_pop_#res, t2Thread1of1ForFork1_pop_#t~mem41, t2Thread1of1ForFork1_pop_#t~ret40, t2Thread1of1ForFork1_pop_#t~nondet38, t2Thread1of1ForFork1_pop_#in~stack.offset, t2Thread1of1ForFork1_pop_#in~stack.base, t2Thread1of1ForFork1_pop_~stack.base, t2Thread1of1ForFork1_pop_#t~ret37] because there is no mapped edge [2019-12-27 00:46:53,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [516] [516] L954-4-->L928-1: Formula: (= |v_t2Thread1of1ForFork1_dec_top_#t~post32_34| v_~top~0_55) InVars {~top~0=v_~top~0_55} OutVars{t2Thread1of1ForFork1_dec_top_#t~post32=|v_t2Thread1of1ForFork1_dec_top_#t~post32_34|, ~top~0=v_~top~0_55, t2Thread1of1ForFork1_pop_#t~ret37=|v_t2Thread1of1ForFork1_pop_#t~ret37_18|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_dec_top_#t~post32, t2Thread1of1ForFork1_pop_#t~ret37] because there is no mapped edge [2019-12-27 00:46:53,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [487] [487] L928-1-->L926: Formula: (= v_~top~0_29 (+ |v_t2Thread1of1ForFork1_dec_top_#t~post32_15| (- 1))) InVars {t2Thread1of1ForFork1_dec_top_#t~post32=|v_t2Thread1of1ForFork1_dec_top_#t~post32_15|} OutVars{t2Thread1of1ForFork1_dec_top_#t~post32=|v_t2Thread1of1ForFork1_dec_top_#t~post32_14|, ~top~0=v_~top~0_29} AuxVars[] AssignedVars[t2Thread1of1ForFork1_dec_top_#t~post32, ~top~0] because there is no mapped edge [2019-12-27 00:46:53,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [508] [508] L926-->L962: Formula: (and (= v_~top~0_43 |v_t2Thread1of1ForFork1_get_top_#res_19|) (= |v_t2Thread1of1ForFork1_pop_#t~ret40_12| |v_t2Thread1of1ForFork1_get_top_#res_19|)) InVars {~top~0=v_~top~0_43} OutVars{t2Thread1of1ForFork1_get_top_#res=|v_t2Thread1of1ForFork1_get_top_#res_19|, t2Thread1of1ForFork1_pop_#t~ret40=|v_t2Thread1of1ForFork1_pop_#t~ret40_12|, ~top~0=v_~top~0_43} AuxVars[] AssignedVars[t2Thread1of1ForFork1_get_top_#res, t2Thread1of1ForFork1_pop_#t~ret40] because there is no mapped edge [2019-12-27 00:46:53,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [541] [541] L962-->L990-3: Formula: (and (<= |v_t2Thread1of1ForFork1_pop_#t~ret40_21| 2147483647) (let ((.cse0 (mod (select (select |v_#memory_int_49| v_t2Thread1of1ForFork1_pop_~stack.base_15) (+ v_t2Thread1of1ForFork1_pop_~stack.offset_15 (* |v_t2Thread1of1ForFork1_pop_#t~ret40_21| 4))) 4294967296))) (let ((.cse1 (<= .cse0 2147483647))) (or (and (= |v_t2Thread1of1ForFork1_pop_#res_15| (+ .cse0 (- 4294967296))) (not .cse1)) (and .cse1 (= |v_t2Thread1of1ForFork1_pop_#res_15| .cse0))))) (= |v_t2Thread1of1ForFork1_pop_#res_15| |v_t2Thread1of1ForFork1_#t~ret48_31|) (<= 0 (+ |v_t2Thread1of1ForFork1_pop_#t~ret40_21| 2147483648))) InVars {t2Thread1of1ForFork1_pop_~stack.offset=v_t2Thread1of1ForFork1_pop_~stack.offset_15, t2Thread1of1ForFork1_pop_#t~ret40=|v_t2Thread1of1ForFork1_pop_#t~ret40_21|, #memory_int=|v_#memory_int_49|, t2Thread1of1ForFork1_pop_~stack.base=v_t2Thread1of1ForFork1_pop_~stack.base_15} OutVars{t2Thread1of1ForFork1_pop_~stack.offset=v_t2Thread1of1ForFork1_pop_~stack.offset_15, t2Thread1of1ForFork1_#t~ret48=|v_t2Thread1of1ForFork1_#t~ret48_31|, t2Thread1of1ForFork1_pop_#res=|v_t2Thread1of1ForFork1_pop_#res_15|, t2Thread1of1ForFork1_pop_#t~mem41=|v_t2Thread1of1ForFork1_pop_#t~mem41_18|, t2Thread1of1ForFork1_pop_#t~ret40=|v_t2Thread1of1ForFork1_pop_#t~ret40_20|, #memory_int=|v_#memory_int_49|, t2Thread1of1ForFork1_pop_~stack.base=v_t2Thread1of1ForFork1_pop_~stack.base_15} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~ret48, t2Thread1of1ForFork1_pop_#res, t2Thread1of1ForFork1_pop_#t~mem41, t2Thread1of1ForFork1_pop_#t~ret40] because there is no mapped edge [2019-12-27 00:46:53,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [556] [556] L990-3-->L985-6: Formula: (and (= (+ t2Thread1of1ForFork1_~i~1_In1382957328 1) t2Thread1of1ForFork1_~i~1_Out1382957328) (not (= |t2Thread1of1ForFork1_#t~ret48_In1382957328| (- 2))) (<= |t2Thread1of1ForFork1_#t~ret48_In1382957328| 2147483647) (= |#pthreadsMutex_Out1382957328| (store |#pthreadsMutex_In1382957328| |~#m~0.base_In1382957328| (store (select |#pthreadsMutex_In1382957328| |~#m~0.base_In1382957328|) |~#m~0.offset_In1382957328| 0))) (<= 0 (+ |t2Thread1of1ForFork1_#t~ret48_In1382957328| 2147483648))) InVars {#pthreadsMutex=|#pthreadsMutex_In1382957328|, ~#m~0.base=|~#m~0.base_In1382957328|, t2Thread1of1ForFork1_#t~ret48=|t2Thread1of1ForFork1_#t~ret48_In1382957328|, ~#m~0.offset=|~#m~0.offset_In1382957328|, t2Thread1of1ForFork1_~i~1=t2Thread1of1ForFork1_~i~1_In1382957328} OutVars{#pthreadsMutex=|#pthreadsMutex_Out1382957328|, ~#m~0.base=|~#m~0.base_In1382957328|, t2Thread1of1ForFork1_#t~ret48=|t2Thread1of1ForFork1_#t~ret48_Out1382957328|, ~#m~0.offset=|~#m~0.offset_In1382957328|, t2Thread1of1ForFork1_#t~post46=|t2Thread1of1ForFork1_#t~post46_Out1382957328|, t2Thread1of1ForFork1_~i~1=t2Thread1of1ForFork1_~i~1_Out1382957328} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret48, t2Thread1of1ForFork1_#t~post46, t2Thread1of1ForFork1_~i~1] because there is no mapped edge [2019-12-27 00:46:53,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [482] [482] L985-6-->L987-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_24| |v_~#m~0.base_20|))) (and (< v_t2Thread1of1ForFork1_~i~1_12 5) (= 0 |v_t2Thread1of1ForFork1_#t~nondet47_7|) (= 0 (select .cse0 |v_~#m~0.offset_20|)) (= (store |v_#pthreadsMutex_24| |v_~#m~0.base_20| (store .cse0 |v_~#m~0.offset_20| 1)) |v_#pthreadsMutex_23|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_24|, ~#m~0.base=|v_~#m~0.base_20|, ~#m~0.offset=|v_~#m~0.offset_20|, t2Thread1of1ForFork1_~i~1=v_t2Thread1of1ForFork1_~i~1_12} OutVars{t2Thread1of1ForFork1_#t~nondet47=|v_t2Thread1of1ForFork1_#t~nondet47_7|, #pthreadsMutex=|v_#pthreadsMutex_23|, ~#m~0.base=|v_~#m~0.base_20|, ~#m~0.offset=|v_~#m~0.offset_20|, t2Thread1of1ForFork1_~i~1=v_t2Thread1of1ForFork1_~i~1_12} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~nondet47, #pthreadsMutex] because there is no mapped edge [2019-12-27 00:46:53,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [558] [558] L987-1-->L990-3: Formula: (and (= |v_t2Thread1of1ForFork1_pop_#res_30| (- 2)) (= |v_t2Thread1of1ForFork1_get_top_#res_43| v_~top~0_133) (not (= 0 (mod v_~flag~0_53 256))) (= v_t2Thread1of1ForFork1_pop_~stack.offset_28 |v_t2Thread1of1ForFork1_pop_#in~stack.offset_22|) (= |v_~#arr~0.offset_35| |v_t2Thread1of1ForFork1_pop_#in~stack.offset_22|) (= v_t2Thread1of1ForFork1_pop_~stack.base_28 |v_t2Thread1of1ForFork1_pop_#in~stack.base_22|) (= 0 |v_t2Thread1of1ForFork1_get_top_#res_43|) (= |v_t2Thread1of1ForFork1_pop_#res_30| |v_t2Thread1of1ForFork1_#t~ret48_50|) (= |v_~#arr~0.base_35| |v_t2Thread1of1ForFork1_pop_#in~stack.base_22|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_35|, ~flag~0=v_~flag~0_53, ~top~0=v_~top~0_133, ~#arr~0.base=|v_~#arr~0.base_35|} OutVars{t2Thread1of1ForFork1_#t~nondet47=|v_t2Thread1of1ForFork1_#t~nondet47_48|, t2Thread1of1ForFork1_pop_~stack.offset=v_t2Thread1of1ForFork1_pop_~stack.offset_28, ~#arr~0.offset=|v_~#arr~0.offset_35|, t2Thread1of1ForFork1_#t~ret48=|v_t2Thread1of1ForFork1_#t~ret48_50|, t2Thread1of1ForFork1_pop_#res=|v_t2Thread1of1ForFork1_pop_#res_30|, ~flag~0=v_~flag~0_53, t2Thread1of1ForFork1_pop_#in~stack.offset=|v_t2Thread1of1ForFork1_pop_#in~stack.offset_22|, ~top~0=v_~top~0_133, t2Thread1of1ForFork1_pop_#t~ret37=|v_t2Thread1of1ForFork1_pop_#t~ret37_47|, t2Thread1of1ForFork1_get_top_#res=|v_t2Thread1of1ForFork1_get_top_#res_43|, t2Thread1of1ForFork1_pop_#t~mem41=|v_t2Thread1of1ForFork1_pop_#t~mem41_32|, t2Thread1of1ForFork1_pop_#t~ret40=|v_t2Thread1of1ForFork1_pop_#t~ret40_42|, t2Thread1of1ForFork1_pop_#t~nondet38=|v_t2Thread1of1ForFork1_pop_#t~nondet38_20|, t2Thread1of1ForFork1_pop_#in~stack.base=|v_t2Thread1of1ForFork1_pop_#in~stack.base_22|, t2Thread1of1ForFork1_pop_~stack.base=v_t2Thread1of1ForFork1_pop_~stack.base_28, ~#arr~0.base=|v_~#arr~0.base_35|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~nondet47, t2Thread1of1ForFork1_pop_~stack.offset, t2Thread1of1ForFork1_get_top_#res, t2Thread1of1ForFork1_#t~ret48, t2Thread1of1ForFork1_pop_#res, t2Thread1of1ForFork1_pop_#t~mem41, t2Thread1of1ForFork1_pop_#t~ret40, t2Thread1of1ForFork1_pop_#t~nondet38, t2Thread1of1ForFork1_pop_#in~stack.offset, t2Thread1of1ForFork1_pop_#in~stack.base, t2Thread1of1ForFork1_pop_~stack.base, t2Thread1of1ForFork1_pop_#t~ret37] because there is no mapped edge [2019-12-27 00:46:53,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [506] [506] L990-3-->t2Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (= (- 2) |v_t2Thread1of1ForFork1_#t~ret48_18|) InVars {t2Thread1of1ForFork1_#t~ret48=|v_t2Thread1of1ForFork1_#t~ret48_18|} OutVars{t2Thread1of1ForFork1_#t~ret48=|v_t2Thread1of1ForFork1_#t~ret48_17|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~ret48] because there is no mapped edge [2019-12-27 00:46:53,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 12:46:53 BasicIcfg [2019-12-27 00:46:53,131 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 00:46:53,135 INFO L168 Benchmark]: Toolchain (without parser) took 10590.56 ms. Allocated memory was 138.4 MB in the beginning and 310.9 MB in the end (delta: 172.5 MB). Free memory was 100.5 MB in the beginning and 194.8 MB in the end (delta: -94.3 MB). Peak memory consumption was 78.2 MB. Max. memory is 7.1 GB. [2019-12-27 00:46:53,136 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 00:46:53,137 INFO L168 Benchmark]: CACSL2BoogieTranslator took 865.72 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.1 MB in the beginning and 134.6 MB in the end (delta: -34.5 MB). Peak memory consumption was 35.2 MB. Max. memory is 7.1 GB. [2019-12-27 00:46:53,146 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.58 ms. Allocated memory is still 202.9 MB. Free memory was 134.6 MB in the beginning and 131.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 00:46:53,146 INFO L168 Benchmark]: Boogie Preprocessor took 36.75 ms. Allocated memory is still 202.9 MB. Free memory was 131.3 MB in the beginning and 130.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-12-27 00:46:53,149 INFO L168 Benchmark]: RCFGBuilder took 599.25 ms. Allocated memory is still 202.9 MB. Free memory was 130.0 MB in the beginning and 97.5 MB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 7.1 GB. [2019-12-27 00:46:53,151 INFO L168 Benchmark]: TraceAbstraction took 8989.00 ms. Allocated memory was 202.9 MB in the beginning and 310.9 MB in the end (delta: 108.0 MB). Free memory was 96.8 MB in the beginning and 194.8 MB in the end (delta: -98.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-12-27 00:46:53,156 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.25 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 865.72 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.1 MB in the beginning and 134.6 MB in the end (delta: -34.5 MB). Peak memory consumption was 35.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 93.58 ms. Allocated memory is still 202.9 MB. Free memory was 134.6 MB in the beginning and 131.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.75 ms. Allocated memory is still 202.9 MB. Free memory was 131.3 MB in the beginning and 130.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 599.25 ms. Allocated memory is still 202.9 MB. Free memory was 130.0 MB in the beginning and 97.5 MB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8989.00 ms. Allocated memory was 202.9 MB in the beginning and 310.9 MB in the end (delta: 108.0 MB). Free memory was 96.8 MB in the beginning and 194.8 MB in the end (delta: -98.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.7s, 140 ProgramPointsBefore, 40 ProgramPointsAfterwards, 144 TransitionsBefore, 41 TransitionsAfterwards, 5952 CoEnabledTransitionPairs, 8 FixpointIterations, 30 TrivialSequentialCompositions, 76 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 17 ConcurrentYvCompositions, 4 ChoiceCompositions, 3254 VarBasedMoverChecksPositive, 57 VarBasedMoverChecksNegative, 22 SemBasedMoverChecksPositive, 57 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.4s, 0 MoverChecksTotal, 8014 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 919]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1001] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, m={2:0}, top=0] [L1002] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, m={2:0}, top=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 134 locations, 2 error locations. Result: UNSAFE, OverallTime: 8.7s, OverallIterations: 9, TraceHistogramMax: 2, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 401 SDtfs, 436 SDslu, 1087 SDs, 0 SdLazy, 742 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=698occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 899 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 174 NumberOfCodeBlocks, 174 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 11866 SizeOfPredicates, 5 NumberOfNonLiveVariables, 328 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 6/28 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...