/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-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix001_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 05:00:05,365 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 05:00:05,367 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 05:00:05,379 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 05:00:05,379 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 05:00:05,380 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 05:00:05,382 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 05:00:05,383 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 05:00:05,385 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 05:00:05,386 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 05:00:05,387 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 05:00:05,388 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 05:00:05,388 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 05:00:05,389 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 05:00:05,390 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 05:00:05,391 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 05:00:05,392 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 05:00:05,393 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 05:00:05,394 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 05:00:05,396 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 05:00:05,397 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 05:00:05,398 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 05:00:05,399 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 05:00:05,400 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 05:00:05,402 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 05:00:05,403 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 05:00:05,403 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 05:00:05,404 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 05:00:05,404 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 05:00:05,405 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 05:00:05,405 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 05:00:05,406 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 05:00:05,407 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 05:00:05,407 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 05:00:05,408 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 05:00:05,409 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 05:00:05,409 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 05:00:05,409 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 05:00:05,410 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 05:00:05,410 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 05:00:05,411 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 05:00:05,412 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-VariableLbe.epf [2019-12-27 05:00:05,431 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 05:00:05,431 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 05:00:05,432 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 05:00:05,433 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 05:00:05,433 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 05:00:05,433 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 05:00:05,433 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 05:00:05,433 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 05:00:05,434 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 05:00:05,434 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 05:00:05,434 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 05:00:05,434 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 05:00:05,434 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 05:00:05,435 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 05:00:05,435 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 05:00:05,435 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 05:00:05,435 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 05:00:05,435 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 05:00:05,436 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 05:00:05,436 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 05:00:05,436 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 05:00:05,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:00:05,436 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 05:00:05,437 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 05:00:05,437 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 05:00:05,437 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 05:00:05,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 05:00:05,437 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 05:00:05,438 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 05:00:05,438 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 05:00:05,714 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 05:00:05,729 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 05:00:05,734 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 05:00:05,735 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 05:00:05,738 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 05:00:05,739 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix001_pso.opt.i [2019-12-27 05:00:05,811 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7ac5d41e/d199193bab744e75bcd24dc9fce329e6/FLAG9fa06ae02 [2019-12-27 05:00:06,380 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 05:00:06,381 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix001_pso.opt.i [2019-12-27 05:00:06,408 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7ac5d41e/d199193bab744e75bcd24dc9fce329e6/FLAG9fa06ae02 [2019-12-27 05:00:06,617 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7ac5d41e/d199193bab744e75bcd24dc9fce329e6 [2019-12-27 05:00:06,627 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 05:00:06,629 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 05:00:06,630 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 05:00:06,630 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 05:00:06,633 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 05:00:06,634 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:00:06" (1/1) ... [2019-12-27 05:00:06,637 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40cfcebb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:00:06, skipping insertion in model container [2019-12-27 05:00:06,638 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:00:06" (1/1) ... [2019-12-27 05:00:06,645 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 05:00:06,702 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 05:00:07,242 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:00:07,255 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 05:00:07,364 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:00:07,446 INFO L208 MainTranslator]: Completed translation [2019-12-27 05:00:07,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:00:07 WrapperNode [2019-12-27 05:00:07,447 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 05:00:07,448 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 05:00:07,448 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 05:00:07,448 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 05:00:07,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:00:07" (1/1) ... [2019-12-27 05:00:07,485 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:00:07" (1/1) ... [2019-12-27 05:00:07,524 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 05:00:07,524 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 05:00:07,525 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 05:00:07,525 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 05:00:07,535 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:00:07" (1/1) ... [2019-12-27 05:00:07,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:00:07" (1/1) ... [2019-12-27 05:00:07,540 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:00:07" (1/1) ... [2019-12-27 05:00:07,541 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:00:07" (1/1) ... [2019-12-27 05:00:07,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:00:07" (1/1) ... [2019-12-27 05:00:07,558 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:00:07" (1/1) ... [2019-12-27 05:00:07,562 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:00:07" (1/1) ... [2019-12-27 05:00:07,567 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 05:00:07,568 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 05:00:07,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 05:00:07,568 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 05:00:07,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:00:07" (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 05:00:07,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 05:00:07,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 05:00:07,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 05:00:07,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 05:00:07,640 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 05:00:07,641 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 05:00:07,641 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 05:00:07,641 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 05:00:07,641 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 05:00:07,641 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 05:00:07,642 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 05:00:07,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 05:00:07,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 05:00:07,644 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 05:00:08,552 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 05:00:08,552 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 05:00:08,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:00:08 BoogieIcfgContainer [2019-12-27 05:00:08,554 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 05:00:08,555 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 05:00:08,555 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 05:00:08,559 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 05:00:08,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:00:06" (1/3) ... [2019-12-27 05:00:08,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a0e89f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:00:08, skipping insertion in model container [2019-12-27 05:00:08,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:00:07" (2/3) ... [2019-12-27 05:00:08,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a0e89f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:00:08, skipping insertion in model container [2019-12-27 05:00:08,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:00:08" (3/3) ... [2019-12-27 05:00:08,563 INFO L109 eAbstractionObserver]: Analyzing ICFG mix001_pso.opt.i [2019-12-27 05:00:08,573 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 05:00:08,573 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 05:00:08,581 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 05:00:08,582 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 05:00:08,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,639 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,640 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,642 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,643 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,663 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,663 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,664 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,664 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,664 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,691 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,692 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,694 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,701 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,701 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,706 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,708 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:00:08,723 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 05:00:08,740 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 05:00:08,740 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 05:00:08,740 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 05:00:08,740 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 05:00:08,740 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 05:00:08,740 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 05:00:08,741 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 05:00:08,741 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 05:00:08,757 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 243 transitions [2019-12-27 05:00:08,759 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-27 05:00:08,901 INFO L132 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-27 05:00:08,902 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:00:08,921 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 561 event pairs. 0/182 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-27 05:00:08,945 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-27 05:00:09,008 INFO L132 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-27 05:00:09,009 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:00:09,020 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 561 event pairs. 0/182 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-27 05:00:09,053 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-27 05:00:09,055 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 05:00:12,883 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-27 05:00:12,998 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-27 05:00:13,323 WARN L192 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 05:00:13,454 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 05:00:13,483 INFO L206 etLargeBlockEncoding]: Checked pairs total: 134958 [2019-12-27 05:00:13,483 INFO L214 etLargeBlockEncoding]: Total number of compositions: 125 [2019-12-27 05:00:13,487 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 107 places, 127 transitions [2019-12-27 05:00:17,344 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 43566 states. [2019-12-27 05:00:17,346 INFO L276 IsEmpty]: Start isEmpty. Operand 43566 states. [2019-12-27 05:00:17,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 05:00:17,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:00:17,355 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:00:17,355 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:00:17,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:00:17,362 INFO L82 PathProgramCache]: Analyzing trace with hash -616580539, now seen corresponding path program 1 times [2019-12-27 05:00:17,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:00:17,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894860883] [2019-12-27 05:00:17,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:00:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:00:17,622 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 05:00:17,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894860883] [2019-12-27 05:00:17,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:00:17,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:00:17,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216225312] [2019-12-27 05:00:17,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:00:17,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:00:17,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:00:17,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:00:17,647 INFO L87 Difference]: Start difference. First operand 43566 states. Second operand 3 states. [2019-12-27 05:00:18,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:00:18,635 INFO L93 Difference]: Finished difference Result 43014 states and 174370 transitions. [2019-12-27 05:00:18,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:00:18,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 05:00:18,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:00:18,975 INFO L225 Difference]: With dead ends: 43014 [2019-12-27 05:00:18,975 INFO L226 Difference]: Without dead ends: 40044 [2019-12-27 05:00:18,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 05:00:19,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40044 states. [2019-12-27 05:00:22,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40044 to 40044. [2019-12-27 05:00:22,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40044 states. [2019-12-27 05:00:22,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40044 states to 40044 states and 162217 transitions. [2019-12-27 05:00:22,723 INFO L78 Accepts]: Start accepts. Automaton has 40044 states and 162217 transitions. Word has length 7 [2019-12-27 05:00:22,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:00:22,724 INFO L462 AbstractCegarLoop]: Abstraction has 40044 states and 162217 transitions. [2019-12-27 05:00:22,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:00:22,725 INFO L276 IsEmpty]: Start isEmpty. Operand 40044 states and 162217 transitions. [2019-12-27 05:00:22,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 05:00:22,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:00:22,730 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:00:22,731 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:00:22,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:00:22,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1408183665, now seen corresponding path program 1 times [2019-12-27 05:00:22,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:00:22,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794347340] [2019-12-27 05:00:22,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:00:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:00:22,902 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 05:00:22,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794347340] [2019-12-27 05:00:22,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:00:22,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:00:22,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611130395] [2019-12-27 05:00:22,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:00:22,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:00:22,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:00:22,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:00:22,907 INFO L87 Difference]: Start difference. First operand 40044 states and 162217 transitions. Second operand 4 states. [2019-12-27 05:00:25,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:00:25,472 INFO L93 Difference]: Finished difference Result 63338 states and 247308 transitions. [2019-12-27 05:00:25,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:00:25,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 05:00:25,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:00:25,822 INFO L225 Difference]: With dead ends: 63338 [2019-12-27 05:00:25,823 INFO L226 Difference]: Without dead ends: 63310 [2019-12-27 05:00:25,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:00:26,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63310 states. [2019-12-27 05:00:28,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63310 to 60640. [2019-12-27 05:00:28,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60640 states. [2019-12-27 05:00:28,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60640 states to 60640 states and 238729 transitions. [2019-12-27 05:00:28,468 INFO L78 Accepts]: Start accepts. Automaton has 60640 states and 238729 transitions. Word has length 13 [2019-12-27 05:00:28,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:00:28,468 INFO L462 AbstractCegarLoop]: Abstraction has 60640 states and 238729 transitions. [2019-12-27 05:00:28,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:00:28,469 INFO L276 IsEmpty]: Start isEmpty. Operand 60640 states and 238729 transitions. [2019-12-27 05:00:28,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 05:00:28,475 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:00:28,475 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:00:28,476 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:00:28,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:00:28,476 INFO L82 PathProgramCache]: Analyzing trace with hash -903300069, now seen corresponding path program 1 times [2019-12-27 05:00:28,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:00:28,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349889004] [2019-12-27 05:00:28,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:00:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:00:28,603 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 05:00:28,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349889004] [2019-12-27 05:00:28,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:00:28,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:00:28,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765008875] [2019-12-27 05:00:28,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:00:28,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:00:28,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:00:28,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:00:28,608 INFO L87 Difference]: Start difference. First operand 60640 states and 238729 transitions. Second operand 4 states. [2019-12-27 05:00:31,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:00:31,404 INFO L93 Difference]: Finished difference Result 77848 states and 302341 transitions. [2019-12-27 05:00:31,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:00:31,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 05:00:31,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:00:31,687 INFO L225 Difference]: With dead ends: 77848 [2019-12-27 05:00:31,687 INFO L226 Difference]: Without dead ends: 77820 [2019-12-27 05:00:31,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:00:32,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77820 states. [2019-12-27 05:00:33,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77820 to 68750. [2019-12-27 05:00:33,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68750 states. [2019-12-27 05:00:34,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68750 states to 68750 states and 269586 transitions. [2019-12-27 05:00:34,070 INFO L78 Accepts]: Start accepts. Automaton has 68750 states and 269586 transitions. Word has length 16 [2019-12-27 05:00:34,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:00:34,070 INFO L462 AbstractCegarLoop]: Abstraction has 68750 states and 269586 transitions. [2019-12-27 05:00:34,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:00:34,070 INFO L276 IsEmpty]: Start isEmpty. Operand 68750 states and 269586 transitions. [2019-12-27 05:00:34,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 05:00:34,081 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:00:34,081 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:00:34,082 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:00:34,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:00:34,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1875943098, now seen corresponding path program 1 times [2019-12-27 05:00:34,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:00:34,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875912745] [2019-12-27 05:00:34,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:00:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:00:34,135 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 05:00:34,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875912745] [2019-12-27 05:00:34,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:00:34,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:00:34,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618871073] [2019-12-27 05:00:34,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:00:34,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:00:34,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:00:34,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:00:34,138 INFO L87 Difference]: Start difference. First operand 68750 states and 269586 transitions. Second operand 3 states. [2019-12-27 05:00:35,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:00:35,008 INFO L93 Difference]: Finished difference Result 65858 states and 256753 transitions. [2019-12-27 05:00:35,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:00:35,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 05:00:35,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:00:35,178 INFO L225 Difference]: With dead ends: 65858 [2019-12-27 05:00:35,178 INFO L226 Difference]: Without dead ends: 65858 [2019-12-27 05:00:35,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 05:00:35,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65858 states. [2019-12-27 05:00:37,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65858 to 65858. [2019-12-27 05:00:37,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65858 states. [2019-12-27 05:00:40,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65858 states to 65858 states and 256753 transitions. [2019-12-27 05:00:40,951 INFO L78 Accepts]: Start accepts. Automaton has 65858 states and 256753 transitions. Word has length 18 [2019-12-27 05:00:40,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:00:40,951 INFO L462 AbstractCegarLoop]: Abstraction has 65858 states and 256753 transitions. [2019-12-27 05:00:40,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:00:40,952 INFO L276 IsEmpty]: Start isEmpty. Operand 65858 states and 256753 transitions. [2019-12-27 05:00:40,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 05:00:40,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:00:40,963 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:00:40,964 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:00:40,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:00:40,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1842577503, now seen corresponding path program 1 times [2019-12-27 05:00:40,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:00:40,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103746545] [2019-12-27 05:00:40,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:00:40,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:00:41,013 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 05:00:41,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103746545] [2019-12-27 05:00:41,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:00:41,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:00:41,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225774047] [2019-12-27 05:00:41,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:00:41,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:00:41,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:00:41,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:00:41,015 INFO L87 Difference]: Start difference. First operand 65858 states and 256753 transitions. Second operand 3 states. [2019-12-27 05:00:41,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:00:41,300 INFO L93 Difference]: Finished difference Result 63720 states and 249248 transitions. [2019-12-27 05:00:41,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:00:41,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-27 05:00:41,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:00:41,456 INFO L225 Difference]: With dead ends: 63720 [2019-12-27 05:00:41,457 INFO L226 Difference]: Without dead ends: 63552 [2019-12-27 05:00:41,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 05:00:42,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63552 states. [2019-12-27 05:00:43,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63552 to 63552. [2019-12-27 05:00:43,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63552 states. [2019-12-27 05:00:43,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63552 states to 63552 states and 248652 transitions. [2019-12-27 05:00:43,798 INFO L78 Accepts]: Start accepts. Automaton has 63552 states and 248652 transitions. Word has length 19 [2019-12-27 05:00:43,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:00:43,798 INFO L462 AbstractCegarLoop]: Abstraction has 63552 states and 248652 transitions. [2019-12-27 05:00:43,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:00:43,799 INFO L276 IsEmpty]: Start isEmpty. Operand 63552 states and 248652 transitions. [2019-12-27 05:00:43,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 05:00:43,818 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:00:43,818 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:00:43,818 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:00:43,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:00:43,819 INFO L82 PathProgramCache]: Analyzing trace with hash -813341911, now seen corresponding path program 1 times [2019-12-27 05:00:43,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:00:43,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830424104] [2019-12-27 05:00:43,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:00:43,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:00:43,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:00:43,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830424104] [2019-12-27 05:00:43,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:00:43,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:00:43,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102232621] [2019-12-27 05:00:43,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:00:43,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:00:43,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:00:43,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:00:43,924 INFO L87 Difference]: Start difference. First operand 63552 states and 248652 transitions. Second operand 5 states. [2019-12-27 05:00:44,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:00:44,924 INFO L93 Difference]: Finished difference Result 75918 states and 293174 transitions. [2019-12-27 05:00:44,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 05:00:44,924 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 05:00:44,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:00:45,860 INFO L225 Difference]: With dead ends: 75918 [2019-12-27 05:00:45,860 INFO L226 Difference]: Without dead ends: 75866 [2019-12-27 05:00:45,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:00:46,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75866 states. [2019-12-27 05:00:50,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75866 to 63240. [2019-12-27 05:00:50,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63240 states. [2019-12-27 05:00:50,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63240 states to 63240 states and 247578 transitions. [2019-12-27 05:00:50,422 INFO L78 Accepts]: Start accepts. Automaton has 63240 states and 247578 transitions. Word has length 22 [2019-12-27 05:00:50,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:00:50,422 INFO L462 AbstractCegarLoop]: Abstraction has 63240 states and 247578 transitions. [2019-12-27 05:00:50,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:00:50,422 INFO L276 IsEmpty]: Start isEmpty. Operand 63240 states and 247578 transitions. [2019-12-27 05:00:50,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 05:00:50,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:00:50,497 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:00:50,498 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:00:50,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:00:50,498 INFO L82 PathProgramCache]: Analyzing trace with hash 905995009, now seen corresponding path program 1 times [2019-12-27 05:00:50,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:00:50,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467626367] [2019-12-27 05:00:50,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:00:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:00:50,593 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 05:00:50,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467626367] [2019-12-27 05:00:50,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:00:50,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:00:50,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011349358] [2019-12-27 05:00:50,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:00:50,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:00:50,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:00:50,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:00:50,595 INFO L87 Difference]: Start difference. First operand 63240 states and 247578 transitions. Second operand 5 states. [2019-12-27 05:00:51,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:00:51,120 INFO L93 Difference]: Finished difference Result 96384 states and 382320 transitions. [2019-12-27 05:00:51,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 05:00:51,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-27 05:00:51,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:00:51,916 INFO L225 Difference]: With dead ends: 96384 [2019-12-27 05:00:51,916 INFO L226 Difference]: Without dead ends: 84152 [2019-12-27 05:00:51,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:00:52,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84152 states. [2019-12-27 05:00:56,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84152 to 84152. [2019-12-27 05:00:56,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84152 states. [2019-12-27 05:00:56,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84152 states to 84152 states and 335460 transitions. [2019-12-27 05:00:56,685 INFO L78 Accepts]: Start accepts. Automaton has 84152 states and 335460 transitions. Word has length 33 [2019-12-27 05:00:56,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:00:56,685 INFO L462 AbstractCegarLoop]: Abstraction has 84152 states and 335460 transitions. [2019-12-27 05:00:56,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:00:56,686 INFO L276 IsEmpty]: Start isEmpty. Operand 84152 states and 335460 transitions. [2019-12-27 05:00:56,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 05:00:56,811 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:00:56,811 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:00:56,811 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:00:56,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:00:56,812 INFO L82 PathProgramCache]: Analyzing trace with hash 830115435, now seen corresponding path program 2 times [2019-12-27 05:00:56,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:00:56,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984935201] [2019-12-27 05:00:56,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:00:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:00:56,865 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 05:00:56,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984935201] [2019-12-27 05:00:56,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:00:56,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:00:56,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258240181] [2019-12-27 05:00:56,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:00:56,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:00:56,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:00:56,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:00:56,867 INFO L87 Difference]: Start difference. First operand 84152 states and 335460 transitions. Second operand 3 states. [2019-12-27 05:00:58,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:00:58,208 INFO L93 Difference]: Finished difference Result 84126 states and 335383 transitions. [2019-12-27 05:00:58,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:00:58,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-27 05:00:58,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:00:58,433 INFO L225 Difference]: With dead ends: 84126 [2019-12-27 05:00:58,433 INFO L226 Difference]: Without dead ends: 84126 [2019-12-27 05:00:58,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 05:00:59,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84126 states. [2019-12-27 05:01:00,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84126 to 84126. [2019-12-27 05:01:00,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84126 states. [2019-12-27 05:01:01,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84126 states to 84126 states and 335383 transitions. [2019-12-27 05:01:01,075 INFO L78 Accepts]: Start accepts. Automaton has 84126 states and 335383 transitions. Word has length 33 [2019-12-27 05:01:01,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:01:01,076 INFO L462 AbstractCegarLoop]: Abstraction has 84126 states and 335383 transitions. [2019-12-27 05:01:01,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:01:01,076 INFO L276 IsEmpty]: Start isEmpty. Operand 84126 states and 335383 transitions. [2019-12-27 05:01:01,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 05:01:01,215 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:01:01,215 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:01:01,215 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:01:01,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:01:01,215 INFO L82 PathProgramCache]: Analyzing trace with hash -893352396, now seen corresponding path program 1 times [2019-12-27 05:01:01,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:01:01,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70011934] [2019-12-27 05:01:01,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:01:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:01:01,298 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 05:01:01,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70011934] [2019-12-27 05:01:01,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:01:01,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:01:01,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129772816] [2019-12-27 05:01:01,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:01:01,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:01:01,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:01:01,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:01:01,300 INFO L87 Difference]: Start difference. First operand 84126 states and 335383 transitions. Second operand 5 states. [2019-12-27 05:01:01,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:01:01,430 INFO L93 Difference]: Finished difference Result 13498 states and 45792 transitions. [2019-12-27 05:01:01,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:01:01,430 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-27 05:01:01,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:01:01,447 INFO L225 Difference]: With dead ends: 13498 [2019-12-27 05:01:01,448 INFO L226 Difference]: Without dead ends: 7538 [2019-12-27 05:01:01,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:01:01,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7538 states. [2019-12-27 05:01:01,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7538 to 7538. [2019-12-27 05:01:01,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7538 states. [2019-12-27 05:01:01,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7538 states to 7538 states and 21885 transitions. [2019-12-27 05:01:01,544 INFO L78 Accepts]: Start accepts. Automaton has 7538 states and 21885 transitions. Word has length 34 [2019-12-27 05:01:01,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:01:01,545 INFO L462 AbstractCegarLoop]: Abstraction has 7538 states and 21885 transitions. [2019-12-27 05:01:01,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:01:01,545 INFO L276 IsEmpty]: Start isEmpty. Operand 7538 states and 21885 transitions. [2019-12-27 05:01:01,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-27 05:01:01,553 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:01:01,553 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:01:01,553 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:01:01,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:01:01,554 INFO L82 PathProgramCache]: Analyzing trace with hash -266810409, now seen corresponding path program 1 times [2019-12-27 05:01:01,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:01:01,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527902531] [2019-12-27 05:01:01,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:01:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:01:01,674 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 05:01:01,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527902531] [2019-12-27 05:01:01,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:01:01,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:01:01,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048026356] [2019-12-27 05:01:01,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:01:01,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:01:01,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:01:01,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:01:01,677 INFO L87 Difference]: Start difference. First operand 7538 states and 21885 transitions. Second operand 4 states. [2019-12-27 05:01:01,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:01:01,720 INFO L93 Difference]: Finished difference Result 8639 states and 24400 transitions. [2019-12-27 05:01:01,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:01:01,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-12-27 05:01:01,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:01:01,732 INFO L225 Difference]: With dead ends: 8639 [2019-12-27 05:01:01,732 INFO L226 Difference]: Without dead ends: 7549 [2019-12-27 05:01:01,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:01:01,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7549 states. [2019-12-27 05:01:01,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7549 to 7531. [2019-12-27 05:01:01,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7531 states. [2019-12-27 05:01:01,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7531 states to 7531 states and 21800 transitions. [2019-12-27 05:01:01,840 INFO L78 Accepts]: Start accepts. Automaton has 7531 states and 21800 transitions. Word has length 46 [2019-12-27 05:01:01,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:01:01,841 INFO L462 AbstractCegarLoop]: Abstraction has 7531 states and 21800 transitions. [2019-12-27 05:01:01,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:01:01,841 INFO L276 IsEmpty]: Start isEmpty. Operand 7531 states and 21800 transitions. [2019-12-27 05:01:01,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-27 05:01:01,850 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:01:01,850 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:01:01,850 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:01:01,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:01:01,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1234135045, now seen corresponding path program 2 times [2019-12-27 05:01:01,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:01:01,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963703936] [2019-12-27 05:01:01,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:01:01,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:01:02,725 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 05:01:02,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963703936] [2019-12-27 05:01:02,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:01:02,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:01:02,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767575885] [2019-12-27 05:01:02,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:01:02,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:01:02,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:01:02,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:01:02,727 INFO L87 Difference]: Start difference. First operand 7531 states and 21800 transitions. Second operand 4 states. [2019-12-27 05:01:02,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:01:02,780 INFO L93 Difference]: Finished difference Result 11616 states and 31974 transitions. [2019-12-27 05:01:02,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:01:02,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-12-27 05:01:02,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:01:02,787 INFO L225 Difference]: With dead ends: 11616 [2019-12-27 05:01:02,787 INFO L226 Difference]: Without dead ends: 4301 [2019-12-27 05:01:02,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:01:02,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4301 states. [2019-12-27 05:01:02,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4301 to 4301. [2019-12-27 05:01:02,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4301 states. [2019-12-27 05:01:02,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4301 states to 4301 states and 10659 transitions. [2019-12-27 05:01:02,841 INFO L78 Accepts]: Start accepts. Automaton has 4301 states and 10659 transitions. Word has length 46 [2019-12-27 05:01:02,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:01:02,842 INFO L462 AbstractCegarLoop]: Abstraction has 4301 states and 10659 transitions. [2019-12-27 05:01:02,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:01:02,842 INFO L276 IsEmpty]: Start isEmpty. Operand 4301 states and 10659 transitions. [2019-12-27 05:01:02,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-27 05:01:02,845 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:01:02,846 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:01:02,846 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:01:02,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:01:02,846 INFO L82 PathProgramCache]: Analyzing trace with hash -970485165, now seen corresponding path program 3 times [2019-12-27 05:01:02,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:01:02,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021469809] [2019-12-27 05:01:02,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:01:02,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:01:02,923 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 05:01:02,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021469809] [2019-12-27 05:01:02,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:01:02,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:01:02,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329701344] [2019-12-27 05:01:02,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:01:02,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:01:02,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:01:02,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:01:02,926 INFO L87 Difference]: Start difference. First operand 4301 states and 10659 transitions. Second operand 5 states. [2019-12-27 05:01:03,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:01:03,372 INFO L93 Difference]: Finished difference Result 4901 states and 11942 transitions. [2019-12-27 05:01:03,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 05:01:03,372 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-12-27 05:01:03,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:01:03,379 INFO L225 Difference]: With dead ends: 4901 [2019-12-27 05:01:03,379 INFO L226 Difference]: Without dead ends: 4901 [2019-12-27 05:01:03,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 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 05:01:03,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4901 states. [2019-12-27 05:01:03,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4901 to 4732. [2019-12-27 05:01:03,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4732 states. [2019-12-27 05:01:03,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4732 states to 4732 states and 11616 transitions. [2019-12-27 05:01:03,430 INFO L78 Accepts]: Start accepts. Automaton has 4732 states and 11616 transitions. Word has length 46 [2019-12-27 05:01:03,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:01:03,430 INFO L462 AbstractCegarLoop]: Abstraction has 4732 states and 11616 transitions. [2019-12-27 05:01:03,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:01:03,431 INFO L276 IsEmpty]: Start isEmpty. Operand 4732 states and 11616 transitions. [2019-12-27 05:01:03,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 05:01:03,435 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:01:03,435 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:01:03,435 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:01:03,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:01:03,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1930278651, now seen corresponding path program 1 times [2019-12-27 05:01:03,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:01:03,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93499369] [2019-12-27 05:01:03,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:01:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:01:03,533 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 05:01:03,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93499369] [2019-12-27 05:01:03,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:01:03,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:01:03,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759506845] [2019-12-27 05:01:03,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:01:03,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:01:03,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:01:03,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:01:03,535 INFO L87 Difference]: Start difference. First operand 4732 states and 11616 transitions. Second operand 6 states. [2019-12-27 05:01:03,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:01:03,599 INFO L93 Difference]: Finished difference Result 3454 states and 8540 transitions. [2019-12-27 05:01:03,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 05:01:03,599 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-27 05:01:03,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:01:03,600 INFO L225 Difference]: With dead ends: 3454 [2019-12-27 05:01:03,600 INFO L226 Difference]: Without dead ends: 732 [2019-12-27 05:01:03,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:01:03,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2019-12-27 05:01:03,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 714. [2019-12-27 05:01:03,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2019-12-27 05:01:03,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1528 transitions. [2019-12-27 05:01:03,607 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1528 transitions. Word has length 47 [2019-12-27 05:01:03,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:01:03,608 INFO L462 AbstractCegarLoop]: Abstraction has 714 states and 1528 transitions. [2019-12-27 05:01:03,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:01:03,609 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1528 transitions. [2019-12-27 05:01:03,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 05:01:03,610 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:01:03,610 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:01:03,610 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:01:03,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:01:03,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1549401206, now seen corresponding path program 1 times [2019-12-27 05:01:03,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:01:03,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764915171] [2019-12-27 05:01:03,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:01:03,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:01:03,696 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 05:01:03,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764915171] [2019-12-27 05:01:03,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:01:03,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:01:03,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547809754] [2019-12-27 05:01:03,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:01:03,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:01:03,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:01:03,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:01:03,698 INFO L87 Difference]: Start difference. First operand 714 states and 1528 transitions. Second operand 8 states. [2019-12-27 05:01:03,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:01:03,937 INFO L93 Difference]: Finished difference Result 1349 states and 2832 transitions. [2019-12-27 05:01:03,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 05:01:03,938 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2019-12-27 05:01:03,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:01:03,940 INFO L225 Difference]: With dead ends: 1349 [2019-12-27 05:01:03,940 INFO L226 Difference]: Without dead ends: 989 [2019-12-27 05:01:03,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-27 05:01:03,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2019-12-27 05:01:03,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 785. [2019-12-27 05:01:03,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2019-12-27 05:01:03,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1653 transitions. [2019-12-27 05:01:03,959 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1653 transitions. Word has length 62 [2019-12-27 05:01:03,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:01:03,960 INFO L462 AbstractCegarLoop]: Abstraction has 785 states and 1653 transitions. [2019-12-27 05:01:03,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:01:03,960 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1653 transitions. [2019-12-27 05:01:03,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 05:01:03,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:01:03,962 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:01:03,962 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:01:03,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:01:03,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1783952234, now seen corresponding path program 2 times [2019-12-27 05:01:03,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:01:03,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007054338] [2019-12-27 05:01:03,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:01:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:01:04,111 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 05:01:04,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007054338] [2019-12-27 05:01:04,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:01:04,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:01:04,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436062816] [2019-12-27 05:01:04,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:01:04,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:01:04,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:01:04,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:01:04,113 INFO L87 Difference]: Start difference. First operand 785 states and 1653 transitions. Second operand 6 states. [2019-12-27 05:01:04,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:01:04,541 INFO L93 Difference]: Finished difference Result 906 states and 1889 transitions. [2019-12-27 05:01:04,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 05:01:04,541 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-27 05:01:04,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:01:04,543 INFO L225 Difference]: With dead ends: 906 [2019-12-27 05:01:04,543 INFO L226 Difference]: Without dead ends: 906 [2019-12-27 05:01:04,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:01:04,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2019-12-27 05:01:04,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 791. [2019-12-27 05:01:04,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2019-12-27 05:01:04,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1664 transitions. [2019-12-27 05:01:04,555 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1664 transitions. Word has length 62 [2019-12-27 05:01:04,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:01:04,555 INFO L462 AbstractCegarLoop]: Abstraction has 791 states and 1664 transitions. [2019-12-27 05:01:04,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:01:04,555 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1664 transitions. [2019-12-27 05:01:04,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 05:01:04,556 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:01:04,556 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:01:04,556 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:01:04,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:01:04,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1868045874, now seen corresponding path program 3 times [2019-12-27 05:01:04,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:01:04,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278712364] [2019-12-27 05:01:04,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:01:04,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:01:04,620 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 05:01:04,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278712364] [2019-12-27 05:01:04,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:01:04,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:01:04,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686855456] [2019-12-27 05:01:04,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:01:04,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:01:04,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:01:04,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:01:04,623 INFO L87 Difference]: Start difference. First operand 791 states and 1664 transitions. Second operand 3 states. [2019-12-27 05:01:04,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:01:04,636 INFO L93 Difference]: Finished difference Result 791 states and 1663 transitions. [2019-12-27 05:01:04,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:01:04,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-12-27 05:01:04,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:01:04,637 INFO L225 Difference]: With dead ends: 791 [2019-12-27 05:01:04,638 INFO L226 Difference]: Without dead ends: 791 [2019-12-27 05:01:04,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 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 05:01:04,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2019-12-27 05:01:04,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 709. [2019-12-27 05:01:04,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709 states. [2019-12-27 05:01:04,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1508 transitions. [2019-12-27 05:01:04,647 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1508 transitions. Word has length 62 [2019-12-27 05:01:04,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:01:04,648 INFO L462 AbstractCegarLoop]: Abstraction has 709 states and 1508 transitions. [2019-12-27 05:01:04,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:01:04,648 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1508 transitions. [2019-12-27 05:01:04,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 05:01:04,649 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:01:04,649 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:01:04,649 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:01:04,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:01:04,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1377954014, now seen corresponding path program 1 times [2019-12-27 05:01:04,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:01:04,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4752268] [2019-12-27 05:01:04,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:01:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:01:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:01:04,813 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 05:01:04,813 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 05:01:04,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_58| 0 0))) (and (= v_~y$w_buff1_used~0_73 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t23~0.base_24| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t23~0.base_24|) |v_ULTIMATE.start_main_~#t23~0.offset_19| 0)) |v_#memory_int_21|) (= 0 v_~__unbuffered_p1_EAX~0_13) (= v_~main$tmp_guard1~0_18 0) (= 0 v_~y$read_delayed_var~0.offset_7) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t23~0.base_24|) (= 0 v_~weak$$choice0~0_9) (= 0 v_~y$r_buff1_thd2~0_31) (= v_~__unbuffered_p1_EBX~0_14 0) (= v_~y$read_delayed~0_7 0) (= |v_#valid_56| (store .cse0 |v_ULTIMATE.start_main_~#t23~0.base_24| 1)) (= v_~main$tmp_guard0~0_12 0) (= v_~y~0_30 0) (= v_~y$r_buff0_thd1~0_9 0) (= v_~__unbuffered_p2_EBX~0_16 0) (= 0 v_~weak$$choice2~0_34) (= v_~x~0_10 0) (= 0 v_~y$w_buff1~0_31) (= 0 v_~y$r_buff1_thd0~0_25) (= v_~y$mem_tmp~0_11 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$r_buff1_thd1~0_9 0) (= v_~y$r_buff0_thd3~0_76 0) (= 0 v_~y$flush_delayed~0_18) (= 0 v_~__unbuffered_cnt~0_19) (= 0 v_~y$w_buff0~0_37) (= v_~y$r_buff0_thd0~0_21 0) (= 0 v_~y$read_delayed_var~0.base_7) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t23~0.base_24| 4) |v_#length_25|) (= |v_#NULL.offset_5| 0) (= v_~y$r_buff0_thd2~0_55 0) (= 0 v_~__unbuffered_p0_EAX~0_16) (= (select .cse0 |v_ULTIMATE.start_main_~#t23~0.base_24|) 0) (= 0 v_~z~0_9) (= |v_ULTIMATE.start_main_~#t23~0.offset_19| 0) (= 0 v_~__unbuffered_p2_EAX~0_14) (= v_~y$w_buff0_used~0_133 0) (= v_~__unbuffered_p0_EBX~0_16 0) (= 0 v_~y$r_buff1_thd3~0_39) (= 0 |v_#NULL.base_5|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_8|, ULTIMATE.start_main_~#t25~0.base=|v_ULTIMATE.start_main_~#t25~0.base_19|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, #NULL.offset=|v_#NULL.offset_5|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_39, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, ULTIMATE.start_main_~#t25~0.offset=|v_ULTIMATE.start_main_~#t25~0.offset_16|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_9, ~y$flush_delayed~0=v_~y$flush_delayed~0_18, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_16, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_13|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_25|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_11|, ~y$w_buff1~0=v_~y$w_buff1~0_31, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_55, ULTIMATE.start_main_~#t24~0.base=|v_ULTIMATE.start_main_~#t24~0.base_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_25, ~x~0=v_~x~0_10, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_133, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_9, ULTIMATE.start_main_~#t23~0.base=|v_ULTIMATE.start_main_~#t23~0.base_24|, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_76, ~y~0=v_~y~0_30, ULTIMATE.start_main_~#t24~0.offset=|v_ULTIMATE.start_main_~#t24~0.offset_16|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_14, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_11|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_31, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_11|, ULTIMATE.start_main_~#t23~0.offset=|v_ULTIMATE.start_main_~#t23~0.offset_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_73} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t25~0.base, ULTIMATE.start_main_#t~nondet55, #NULL.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t25~0.offset, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_~#t24~0.base, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t23~0.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t24~0.offset, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t23~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 05:01:04,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [998] [998] L840-1-->L842: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t24~0.base_11|) (= |v_ULTIMATE.start_main_~#t24~0.offset_10| 0) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t24~0.base_11| 1) |v_#valid_32|) (not (= |v_ULTIMATE.start_main_~#t24~0.base_11| 0)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t24~0.base_11| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t24~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t24~0.base_11|) |v_ULTIMATE.start_main_~#t24~0.offset_10| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t24~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t24~0.offset=|v_ULTIMATE.start_main_~#t24~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t24~0.base=|v_ULTIMATE.start_main_~#t24~0.base_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t24~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t24~0.base, #length] because there is no mapped edge [2019-12-27 05:01:04,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L842-1-->L844: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t25~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t25~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t25~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t25~0.base_11|) |v_ULTIMATE.start_main_~#t25~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t25~0.base_11| 4)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t25~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t25~0.offset_10| 0) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t25~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t25~0.base=|v_ULTIMATE.start_main_~#t25~0.base_11|, ULTIMATE.start_main_~#t25~0.offset=|v_ULTIMATE.start_main_~#t25~0.offset_10|, #valid=|v_#valid_34|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t25~0.base, ULTIMATE.start_main_~#t25~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-12-27 05:01:04,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [927] [927] P2ENTRY-->L4-3: Formula: (and (= (mod v_~y$w_buff1_used~0_57 256) 0) (= v_~y$w_buff0~0_26 v_~y$w_buff1~0_21) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5| v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_7) (= 1 v_~y$w_buff0~0_25) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= v_~y$w_buff0_used~0_104 1) (= v_~y$w_buff1_used~0_57 v_~y$w_buff0_used~0_105)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff0~0=v_~y$w_buff0~0_26, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_104, ~y$w_buff1~0=v_~y$w_buff1~0_21, ~y$w_buff0~0=v_~y$w_buff0~0_25, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_7, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_57} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 05:01:04,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L802-2-->L802-4: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In591560004 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In591560004 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_Out591560004| ~y$w_buff1~0_In591560004) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out591560004| ~y$w_buff0~0_In591560004) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In591560004, ~y$w_buff1~0=~y$w_buff1~0_In591560004, ~y$w_buff0~0=~y$w_buff0~0_In591560004, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In591560004} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out591560004|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In591560004, ~y$w_buff1~0=~y$w_buff1~0_In591560004, ~y$w_buff0~0=~y$w_buff0~0_In591560004, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In591560004} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 05:01:04,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L802-4-->L803: Formula: (= v_~y~0_18 |v_P2Thread1of1ForFork0_#t~ite28_8|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_8|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_7|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_7|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-27 05:01:04,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L807-->L808: Formula: (and (= v_~y$r_buff0_thd3~0_46 v_~y$r_buff0_thd3~0_45) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_46, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_45, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 05:01:04,843 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1481172014 256) 0))) (or (and (= ~y~0_In1481172014 |P2Thread1of1ForFork0_#t~ite48_Out1481172014|) .cse0) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite48_Out1481172014| ~y$mem_tmp~0_In1481172014)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1481172014, ~y$flush_delayed~0=~y$flush_delayed~0_In1481172014, ~y~0=~y~0_In1481172014} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out1481172014|, ~y$mem_tmp~0=~y$mem_tmp~0_In1481172014, ~y$flush_delayed~0=~y$flush_delayed~0_In1481172014, ~y~0=~y~0_In1481172014} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-27 05:01:04,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_4 |v_P0Thread1of1ForFork1_#in~arg.base_4|) (= v_P0Thread1of1ForFork1_~arg.offset_4 |v_P0Thread1of1ForFork1_#in~arg.offset_4|) (= 1 v_~z~0_5) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= v_~__unbuffered_p0_EBX~0_7 v_~x~0_5) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_p0_EAX~0_7 v_~z~0_5)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_4|, ~x~0=v_~x~0_5} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_4|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z~0=v_~z~0_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_4|, ~x~0=v_~x~0_5, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_4} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 05:01:04,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In507836983 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In507836983 256) 0))) (or (and (= ~y$w_buff0_used~0_In507836983 |P2Thread1of1ForFork0_#t~ite51_Out507836983|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork0_#t~ite51_Out507836983|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In507836983, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In507836983} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In507836983, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In507836983, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out507836983|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-27 05:01:04,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In249546577 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In249546577 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In249546577 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In249546577 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite52_Out249546577|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork0_#t~ite52_Out249546577| ~y$w_buff1_used~0_In249546577) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In249546577, ~y$w_buff0_used~0=~y$w_buff0_used~0_In249546577, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In249546577, ~y$w_buff1_used~0=~y$w_buff1_used~0_In249546577} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In249546577, ~y$w_buff0_used~0=~y$w_buff0_used~0_In249546577, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In249546577, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out249546577|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In249546577} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-27 05:01:04,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L820-->L821: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1037330209 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1037330209 256)))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd3~0_Out1037330209 0)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_Out1037330209 ~y$r_buff0_thd3~0_In1037330209)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1037330209, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1037330209} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1037330209, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1037330209, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out1037330209|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-27 05:01:04,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L821-->L821-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In955541574 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In955541574 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In955541574 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In955541574 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite54_Out955541574| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In955541574 |P2Thread1of1ForFork0_#t~ite54_Out955541574|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In955541574, ~y$w_buff0_used~0=~y$w_buff0_used~0_In955541574, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In955541574, ~y$w_buff1_used~0=~y$w_buff1_used~0_In955541574} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In955541574, ~y$w_buff0_used~0=~y$w_buff0_used~0_In955541574, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out955541574|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In955541574, ~y$w_buff1_used~0=~y$w_buff1_used~0_In955541574} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-27 05:01:04,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L821-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= v_~y$r_buff1_thd3~0_33 |v_P2Thread1of1ForFork0_#t~ite54_8|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_33, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 05:01:04,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1806906906 256) 0))) (or (and .cse0 (= ~y~0_In1806906906 |P1Thread1of1ForFork2_#t~ite25_Out1806906906|)) (and (= |P1Thread1of1ForFork2_#t~ite25_Out1806906906| ~y$mem_tmp~0_In1806906906) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1806906906, ~y$flush_delayed~0=~y$flush_delayed~0_In1806906906, ~y~0=~y~0_In1806906906} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1806906906, ~y$flush_delayed~0=~y$flush_delayed~0_In1806906906, ~y~0=~y~0_In1806906906, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out1806906906|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 05:01:04,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L773-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite25_8| v_~y~0_25) (= 0 v_~y$flush_delayed~0_13) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~y~0=v_~y~0_25, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 05:01:04,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [898] [898] L848-->L850-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_16 256)) (= 0 (mod v_~y$w_buff0_used~0_93 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_93, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_93, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 05:01:04,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L850-2-->L850-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite59_Out-1888584389| |ULTIMATE.start_main_#t~ite58_Out-1888584389|)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1888584389 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-1888584389 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite58_Out-1888584389| ~y~0_In-1888584389)) (and .cse0 (not .cse1) (= ~y$w_buff1~0_In-1888584389 |ULTIMATE.start_main_#t~ite58_Out-1888584389|) (not .cse2)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1888584389, ~y~0=~y~0_In-1888584389, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1888584389, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1888584389} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1888584389, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-1888584389|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1888584389|, ~y~0=~y~0_In-1888584389, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1888584389, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1888584389} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-27 05:01:04,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L851-->L851-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In956851080 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In956851080 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite60_Out956851080|) (not .cse1)) (and (= ~y$w_buff0_used~0_In956851080 |ULTIMATE.start_main_#t~ite60_Out956851080|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In956851080, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In956851080} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out956851080|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In956851080, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In956851080} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-27 05:01:04,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L852-->L852-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-1803919286 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1803919286 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1803919286 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1803919286 256)))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out-1803919286| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite61_Out-1803919286| ~y$w_buff1_used~0_In-1803919286) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1803919286, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1803919286, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1803919286, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1803919286} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1803919286|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1803919286, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1803919286, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1803919286, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1803919286} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-27 05:01:04,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L853-->L853-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In829330026 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In829330026 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In829330026 |ULTIMATE.start_main_#t~ite62_Out829330026|)) (and (= |ULTIMATE.start_main_#t~ite62_Out829330026| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In829330026, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In829330026} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out829330026|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In829330026, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In829330026} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-27 05:01:04,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L854-->L854-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-43573314 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-43573314 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-43573314 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-43573314 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out-43573314| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd0~0_In-43573314 |ULTIMATE.start_main_#t~ite63_Out-43573314|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-43573314, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-43573314, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-43573314, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-43573314} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-43573314|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-43573314, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-43573314, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-43573314, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-43573314} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-27 05:01:04,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p1_EAX~0_6) (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p0_EBX~0_8 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~__unbuffered_p2_EAX~0_7 1) (= v_~__unbuffered_p0_EAX~0_8 1) (= 0 v_~__unbuffered_p1_EBX~0_7) (= v_~__unbuffered_p2_EBX~0_7 0) (= |v_ULTIMATE.start_main_#t~ite63_11| v_~y$r_buff1_thd0~0_17)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_11|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_6, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_6, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_17, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 05:01:05,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:01:05 BasicIcfg [2019-12-27 05:01:05,061 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 05:01:05,065 INFO L168 Benchmark]: Toolchain (without parser) took 58434.84 ms. Allocated memory was 145.8 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 101.8 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 568.5 MB. Max. memory is 7.1 GB. [2019-12-27 05:01:05,065 INFO L168 Benchmark]: CDTParser took 1.40 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 05:01:05,068 INFO L168 Benchmark]: CACSL2BoogieTranslator took 817.76 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 101.4 MB in the beginning and 154.8 MB in the end (delta: -53.4 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-27 05:01:05,070 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.32 ms. Allocated memory is still 202.4 MB. Free memory was 154.8 MB in the beginning and 152.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 05:01:05,070 INFO L168 Benchmark]: Boogie Preprocessor took 43.31 ms. Allocated memory is still 202.4 MB. Free memory was 152.1 MB in the beginning and 149.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 05:01:05,073 INFO L168 Benchmark]: RCFGBuilder took 986.07 ms. Allocated memory is still 202.4 MB. Free memory was 149.5 MB in the beginning and 93.5 MB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 7.1 GB. [2019-12-27 05:01:05,074 INFO L168 Benchmark]: TraceAbstraction took 56505.90 ms. Allocated memory was 202.4 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 93.5 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 503.5 MB. Max. memory is 7.1 GB. [2019-12-27 05:01:05,083 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.40 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 817.76 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 101.4 MB in the beginning and 154.8 MB in the end (delta: -53.4 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.32 ms. Allocated memory is still 202.4 MB. Free memory was 154.8 MB in the beginning and 152.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.31 ms. Allocated memory is still 202.4 MB. Free memory was 152.1 MB in the beginning and 149.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 986.07 ms. Allocated memory is still 202.4 MB. Free memory was 149.5 MB in the beginning and 93.5 MB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 56505.90 ms. Allocated memory was 202.4 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 93.5 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 503.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.7s, 197 ProgramPointsBefore, 107 ProgramPointsAfterwards, 243 TransitionsBefore, 127 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 49 ConcurrentYvCompositions, 30 ChoiceCompositions, 9080 VarBasedMoverChecksPositive, 248 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 134958 CheckedPairsTotal, 125 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L840] FCALL, FORK 0 pthread_create(&t23, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L842] FCALL, FORK 0 pthread_create(&t24, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t25, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L792] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L793] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L794] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L795] 3 y$r_buff0_thd3 = (_Bool)1 [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 y$flush_delayed = weak$$choice2 [L801] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L804] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L805] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L805] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L808] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L810] 3 y = y$flush_delayed ? y$mem_tmp : y [L811] 3 y$flush_delayed = (_Bool)0 [L814] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L755] 2 x = 1 [L758] 2 __unbuffered_p1_EAX = x [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 y$flush_delayed = weak$$choice2 [L764] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L817] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L818] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L819] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L765] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L766] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L767] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L768] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L769] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L771] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L771] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L846] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L850] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L851] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L852] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L853] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 188 locations, 2 error locations. Result: UNSAFE, OverallTime: 56.0s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 15.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3130 SDtfs, 3146 SDslu, 5090 SDs, 0 SdLazy, 1841 SolverSat, 90 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 18 SyntacticMatches, 6 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84152occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 29.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 24972 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 629 NumberOfCodeBlocks, 629 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 550 ConstructedInterpolants, 0 QuantifiedInterpolants, 70816 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 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...