/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/mix010_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:15:46,252 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:15:46,258 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:15:46,273 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:15:46,274 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:15:46,275 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:15:46,276 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:15:46,278 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:15:46,280 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:15:46,281 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:15:46,282 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:15:46,283 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:15:46,283 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:15:46,284 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:15:46,285 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:15:46,286 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:15:46,287 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:15:46,288 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:15:46,290 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:15:46,292 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:15:46,293 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:15:46,294 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:15:46,295 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:15:46,296 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:15:46,298 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:15:46,299 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:15:46,299 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:15:46,300 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:15:46,300 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:15:46,301 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:15:46,301 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:15:46,302 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:15:46,303 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:15:46,304 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:15:46,305 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:15:46,305 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:15:46,305 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:15:46,306 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:15:46,306 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:15:46,307 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:15:46,307 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:15:46,308 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-18 20:15:46,322 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:15:46,323 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:15:46,324 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:15:46,324 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:15:46,324 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:15:46,324 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:15:46,325 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:15:46,325 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:15:46,325 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:15:46,325 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:15:46,325 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:15:46,326 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:15:46,326 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:15:46,326 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:15:46,326 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:15:46,326 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:15:46,326 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:15:46,327 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:15:46,327 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:15:46,327 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:15:46,327 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:15:46,327 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:15:46,328 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:15:46,328 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:15:46,328 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:15:46,328 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:15:46,328 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:15:46,329 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:15:46,329 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:15:46,329 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:15:46,627 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:15:46,649 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:15:46,652 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:15:46,654 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:15:46,654 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:15:46,655 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix010_pso.opt.i [2019-12-18 20:15:46,742 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ac03ee02/d5ab24e1f04e4a8c8d08dd70c3666be4/FLAG23a1dfb89 [2019-12-18 20:15:47,300 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:15:47,301 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010_pso.opt.i [2019-12-18 20:15:47,324 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ac03ee02/d5ab24e1f04e4a8c8d08dd70c3666be4/FLAG23a1dfb89 [2019-12-18 20:15:47,588 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ac03ee02/d5ab24e1f04e4a8c8d08dd70c3666be4 [2019-12-18 20:15:47,598 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:15:47,601 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:15:47,602 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:15:47,602 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:15:47,605 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:15:47,606 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:15:47" (1/1) ... [2019-12-18 20:15:47,609 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a58602b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:15:47, skipping insertion in model container [2019-12-18 20:15:47,610 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:15:47" (1/1) ... [2019-12-18 20:15:47,618 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:15:47,672 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:15:48,281 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:15:48,293 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:15:48,355 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:15:48,442 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:15:48,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:15:48 WrapperNode [2019-12-18 20:15:48,443 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:15:48,444 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:15:48,444 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:15:48,444 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:15:48,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:15:48" (1/1) ... [2019-12-18 20:15:48,475 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:15:48" (1/1) ... [2019-12-18 20:15:48,517 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:15:48,517 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:15:48,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:15:48,518 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:15:48,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:15:48" (1/1) ... [2019-12-18 20:15:48,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:15:48" (1/1) ... [2019-12-18 20:15:48,532 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:15:48" (1/1) ... [2019-12-18 20:15:48,532 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:15:48" (1/1) ... [2019-12-18 20:15:48,544 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:15:48" (1/1) ... [2019-12-18 20:15:48,548 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:15:48" (1/1) ... [2019-12-18 20:15:48,552 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:15:48" (1/1) ... [2019-12-18 20:15:48,560 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:15:48,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:15:48,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:15:48,567 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:15:48,568 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:15:48" (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-18 20:15:48,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:15:48,643 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:15:48,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:15:48,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:15:48,644 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:15:48,645 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:15:48,645 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:15:48,646 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:15:48,646 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 20:15:48,647 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 20:15:48,647 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:15:48,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:15:48,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:15:48,650 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 20:15:49,481 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:15:49,481 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:15:49,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:15:49 BoogieIcfgContainer [2019-12-18 20:15:49,483 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:15:49,484 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:15:49,484 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:15:49,488 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:15:49,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:15:47" (1/3) ... [2019-12-18 20:15:49,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67bf5161 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:15:49, skipping insertion in model container [2019-12-18 20:15:49,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:15:48" (2/3) ... [2019-12-18 20:15:49,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67bf5161 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:15:49, skipping insertion in model container [2019-12-18 20:15:49,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:15:49" (3/3) ... [2019-12-18 20:15:49,492 INFO L109 eAbstractionObserver]: Analyzing ICFG mix010_pso.opt.i [2019-12-18 20:15:49,504 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:15:49,504 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:15:49,513 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:15:49,514 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:15:49,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,563 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,563 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,566 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,567 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,607 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,607 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,608 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,608 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,608 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,636 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,636 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,638 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,644 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,645 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,649 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,652 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:49,668 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 20:15:49,689 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:15:49,689 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:15:49,689 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:15:49,689 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:15:49,689 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:15:49,690 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:15:49,690 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:15:49,690 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:15:49,708 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 243 transitions [2019-12-18 20:15:49,710 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-18 20:15:49,810 INFO L126 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-18 20:15:49,810 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:15:49,833 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 568 event pairs. 9/191 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-18 20:15:49,868 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-18 20:15:49,932 INFO L126 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-18 20:15:49,932 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:15:49,942 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 568 event pairs. 9/191 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-18 20:15:49,971 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-18 20:15:49,972 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:15:54,124 WARN L192 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-18 20:15:54,275 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-18 20:15:54,322 INFO L206 etLargeBlockEncoding]: Checked pairs total: 134090 [2019-12-18 20:15:54,322 INFO L214 etLargeBlockEncoding]: Total number of compositions: 127 [2019-12-18 20:15:54,326 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 106 places, 126 transitions [2019-12-18 20:15:57,780 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 42246 states. [2019-12-18 20:15:57,782 INFO L276 IsEmpty]: Start isEmpty. Operand 42246 states. [2019-12-18 20:15:57,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 20:15:57,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:15:57,789 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:15:57,789 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-18 20:15:57,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:15:57,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1163944889, now seen corresponding path program 1 times [2019-12-18 20:15:57,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:15:57,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992536754] [2019-12-18 20:15:57,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:15:57,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:15:58,054 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-18 20:15:58,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992536754] [2019-12-18 20:15:58,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:15:58,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:15:58,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137884119] [2019-12-18 20:15:58,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:15:58,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:15:58,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:15:58,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:15:58,077 INFO L87 Difference]: Start difference. First operand 42246 states. Second operand 3 states. [2019-12-18 20:15:59,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:15:59,064 INFO L93 Difference]: Finished difference Result 41734 states and 169560 transitions. [2019-12-18 20:15:59,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:15:59,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 20:15:59,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:15:59,403 INFO L225 Difference]: With dead ends: 41734 [2019-12-18 20:15:59,403 INFO L226 Difference]: Without dead ends: 38854 [2019-12-18 20:15:59,405 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-18 20:16:00,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38854 states. [2019-12-18 20:16:01,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38854 to 38854. [2019-12-18 20:16:01,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38854 states. [2019-12-18 20:16:03,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38854 states to 38854 states and 157748 transitions. [2019-12-18 20:16:03,498 INFO L78 Accepts]: Start accepts. Automaton has 38854 states and 157748 transitions. Word has length 7 [2019-12-18 20:16:03,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:16:03,499 INFO L462 AbstractCegarLoop]: Abstraction has 38854 states and 157748 transitions. [2019-12-18 20:16:03,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:16:03,499 INFO L276 IsEmpty]: Start isEmpty. Operand 38854 states and 157748 transitions. [2019-12-18 20:16:03,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 20:16:03,505 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:16:03,505 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:16:03,506 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-18 20:16:03,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:16:03,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1542231911, now seen corresponding path program 1 times [2019-12-18 20:16:03,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:16:03,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659725359] [2019-12-18 20:16:03,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:16:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:16:03,657 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-18 20:16:03,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659725359] [2019-12-18 20:16:03,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:16:03,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:16:03,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530500641] [2019-12-18 20:16:03,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:16:03,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:16:03,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:16:03,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:16:03,662 INFO L87 Difference]: Start difference. First operand 38854 states and 157748 transitions. Second operand 4 states. [2019-12-18 20:16:04,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:16:04,339 INFO L93 Difference]: Finished difference Result 61490 states and 240522 transitions. [2019-12-18 20:16:04,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:16:04,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 20:16:04,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:16:06,611 INFO L225 Difference]: With dead ends: 61490 [2019-12-18 20:16:06,611 INFO L226 Difference]: Without dead ends: 61462 [2019-12-18 20:16:06,612 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-18 20:16:07,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61462 states. [2019-12-18 20:16:08,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61462 to 58792. [2019-12-18 20:16:08,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58792 states. [2019-12-18 20:16:09,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58792 states to 58792 states and 231943 transitions. [2019-12-18 20:16:09,405 INFO L78 Accepts]: Start accepts. Automaton has 58792 states and 231943 transitions. Word has length 13 [2019-12-18 20:16:09,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:16:09,406 INFO L462 AbstractCegarLoop]: Abstraction has 58792 states and 231943 transitions. [2019-12-18 20:16:09,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:16:09,406 INFO L276 IsEmpty]: Start isEmpty. Operand 58792 states and 231943 transitions. [2019-12-18 20:16:09,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:16:09,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:16:09,413 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:16:09,413 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-18 20:16:09,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:16:09,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1747872827, now seen corresponding path program 1 times [2019-12-18 20:16:09,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:16:09,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594130599] [2019-12-18 20:16:09,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:16:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:16:09,493 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-18 20:16:09,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594130599] [2019-12-18 20:16:09,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:16:09,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:16:09,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381164603] [2019-12-18 20:16:09,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:16:09,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:16:09,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:16:09,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:16:09,495 INFO L87 Difference]: Start difference. First operand 58792 states and 231943 transitions. Second operand 4 states. [2019-12-18 20:16:10,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:16:10,149 INFO L93 Difference]: Finished difference Result 76000 states and 295555 transitions. [2019-12-18 20:16:10,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:16:10,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 20:16:10,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:16:10,372 INFO L225 Difference]: With dead ends: 76000 [2019-12-18 20:16:10,373 INFO L226 Difference]: Without dead ends: 75972 [2019-12-18 20:16:10,373 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-18 20:16:13,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75972 states. [2019-12-18 20:16:14,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75972 to 66902. [2019-12-18 20:16:14,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66902 states. [2019-12-18 20:16:14,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66902 states to 66902 states and 262800 transitions. [2019-12-18 20:16:14,850 INFO L78 Accepts]: Start accepts. Automaton has 66902 states and 262800 transitions. Word has length 16 [2019-12-18 20:16:14,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:16:14,851 INFO L462 AbstractCegarLoop]: Abstraction has 66902 states and 262800 transitions. [2019-12-18 20:16:14,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:16:14,851 INFO L276 IsEmpty]: Start isEmpty. Operand 66902 states and 262800 transitions. [2019-12-18 20:16:14,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 20:16:14,860 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:16:14,861 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-18 20:16:14,861 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-18 20:16:14,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:16:14,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1292040923, now seen corresponding path program 1 times [2019-12-18 20:16:14,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:16:14,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465715452] [2019-12-18 20:16:14,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:16:14,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:16:14,942 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-18 20:16:14,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465715452] [2019-12-18 20:16:14,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:16:14,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:16:14,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090613835] [2019-12-18 20:16:14,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:16:14,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:16:14,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:16:14,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:16:14,944 INFO L87 Difference]: Start difference. First operand 66902 states and 262800 transitions. Second operand 3 states. [2019-12-18 20:16:15,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:16:15,775 INFO L93 Difference]: Finished difference Result 62750 states and 246122 transitions. [2019-12-18 20:16:15,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:16:15,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 20:16:15,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:16:15,978 INFO L225 Difference]: With dead ends: 62750 [2019-12-18 20:16:15,978 INFO L226 Difference]: Without dead ends: 62582 [2019-12-18 20:16:15,978 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-18 20:16:16,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62582 states. [2019-12-18 20:16:18,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62582 to 62582. [2019-12-18 20:16:18,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62582 states. [2019-12-18 20:16:18,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62582 states to 62582 states and 245526 transitions. [2019-12-18 20:16:18,273 INFO L78 Accepts]: Start accepts. Automaton has 62582 states and 245526 transitions. Word has length 18 [2019-12-18 20:16:18,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:16:18,273 INFO L462 AbstractCegarLoop]: Abstraction has 62582 states and 245526 transitions. [2019-12-18 20:16:18,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:16:18,273 INFO L276 IsEmpty]: Start isEmpty. Operand 62582 states and 245526 transitions. [2019-12-18 20:16:18,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 20:16:18,301 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:16:18,301 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-18 20:16:18,301 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-18 20:16:18,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:16:18,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1307614695, now seen corresponding path program 1 times [2019-12-18 20:16:18,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:16:18,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713433091] [2019-12-18 20:16:18,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:16:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:16:18,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:16:18,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713433091] [2019-12-18 20:16:18,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:16:18,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:16:18,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6437314] [2019-12-18 20:16:18,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:16:18,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:16:18,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:16:18,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:16:18,421 INFO L87 Difference]: Start difference. First operand 62582 states and 245526 transitions. Second operand 5 states. [2019-12-18 20:16:21,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:16:21,510 INFO L93 Difference]: Finished difference Result 75196 states and 291047 transitions. [2019-12-18 20:16:21,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:16:21,510 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 20:16:21,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:16:21,700 INFO L225 Difference]: With dead ends: 75196 [2019-12-18 20:16:21,700 INFO L226 Difference]: Without dead ends: 75144 [2019-12-18 20:16:21,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:16:22,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75144 states. [2019-12-18 20:16:23,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75144 to 62270. [2019-12-18 20:16:23,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62270 states. [2019-12-18 20:16:23,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62270 states to 62270 states and 244452 transitions. [2019-12-18 20:16:23,539 INFO L78 Accepts]: Start accepts. Automaton has 62270 states and 244452 transitions. Word has length 22 [2019-12-18 20:16:23,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:16:23,540 INFO L462 AbstractCegarLoop]: Abstraction has 62270 states and 244452 transitions. [2019-12-18 20:16:23,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:16:23,540 INFO L276 IsEmpty]: Start isEmpty. Operand 62270 states and 244452 transitions. [2019-12-18 20:16:23,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 20:16:23,612 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:16:23,612 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] [2019-12-18 20:16:23,612 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-18 20:16:23,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:16:23,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1189986838, now seen corresponding path program 1 times [2019-12-18 20:16:23,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:16:23,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176642091] [2019-12-18 20:16:23,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:16:23,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:16:23,684 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-18 20:16:23,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176642091] [2019-12-18 20:16:23,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:16:23,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:16:23,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702412063] [2019-12-18 20:16:23,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:16:23,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:16:23,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:16:23,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:16:23,687 INFO L87 Difference]: Start difference. First operand 62270 states and 244452 transitions. Second operand 5 states. [2019-12-18 20:16:24,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:16:24,810 INFO L93 Difference]: Finished difference Result 94430 states and 375492 transitions. [2019-12-18 20:16:24,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:16:24,811 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-12-18 20:16:24,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:16:25,028 INFO L225 Difference]: With dead ends: 94430 [2019-12-18 20:16:25,028 INFO L226 Difference]: Without dead ends: 82542 [2019-12-18 20:16:25,029 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-18 20:16:25,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82542 states. [2019-12-18 20:16:29,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82542 to 82542. [2019-12-18 20:16:29,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82542 states. [2019-12-18 20:16:29,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82542 states to 82542 states and 329856 transitions. [2019-12-18 20:16:29,849 INFO L78 Accepts]: Start accepts. Automaton has 82542 states and 329856 transitions. Word has length 32 [2019-12-18 20:16:29,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:16:29,850 INFO L462 AbstractCegarLoop]: Abstraction has 82542 states and 329856 transitions. [2019-12-18 20:16:29,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:16:29,850 INFO L276 IsEmpty]: Start isEmpty. Operand 82542 states and 329856 transitions. [2019-12-18 20:16:29,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 20:16:29,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:16:29,946 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] [2019-12-18 20:16:29,947 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-18 20:16:29,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:16:29,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1971502230, now seen corresponding path program 2 times [2019-12-18 20:16:29,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:16:29,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320712999] [2019-12-18 20:16:29,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:16:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:16:29,999 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-18 20:16:30,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320712999] [2019-12-18 20:16:30,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:16:30,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:16:30,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648301218] [2019-12-18 20:16:30,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:16:30,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:16:30,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:16:30,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:16:30,002 INFO L87 Difference]: Start difference. First operand 82542 states and 329856 transitions. Second operand 3 states. [2019-12-18 20:16:31,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:16:31,032 INFO L93 Difference]: Finished difference Result 82490 states and 329676 transitions. [2019-12-18 20:16:31,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:16:31,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-18 20:16:31,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:16:31,247 INFO L225 Difference]: With dead ends: 82490 [2019-12-18 20:16:31,247 INFO L226 Difference]: Without dead ends: 82490 [2019-12-18 20:16:31,247 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-18 20:16:31,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82490 states. [2019-12-18 20:16:36,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82490 to 82490. [2019-12-18 20:16:36,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82490 states. [2019-12-18 20:16:36,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82490 states to 82490 states and 329676 transitions. [2019-12-18 20:16:36,602 INFO L78 Accepts]: Start accepts. Automaton has 82490 states and 329676 transitions. Word has length 32 [2019-12-18 20:16:36,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:16:36,603 INFO L462 AbstractCegarLoop]: Abstraction has 82490 states and 329676 transitions. [2019-12-18 20:16:36,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:16:36,603 INFO L276 IsEmpty]: Start isEmpty. Operand 82490 states and 329676 transitions. [2019-12-18 20:16:36,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 20:16:36,735 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:16:36,736 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-18 20:16:36,736 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-18 20:16:36,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:16:36,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1739657011, now seen corresponding path program 1 times [2019-12-18 20:16:36,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:16:36,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174245377] [2019-12-18 20:16:36,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:16:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:16:36,818 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-18 20:16:36,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174245377] [2019-12-18 20:16:36,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:16:36,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:16:36,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620302486] [2019-12-18 20:16:36,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:16:36,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:16:36,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:16:36,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:16:36,820 INFO L87 Difference]: Start difference. First operand 82490 states and 329676 transitions. Second operand 4 states. [2019-12-18 20:16:37,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:16:37,069 INFO L93 Difference]: Finished difference Result 51474 states and 180046 transitions. [2019-12-18 20:16:37,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:16:37,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-18 20:16:37,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:16:37,161 INFO L225 Difference]: With dead ends: 51474 [2019-12-18 20:16:37,161 INFO L226 Difference]: Without dead ends: 45654 [2019-12-18 20:16:37,161 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-18 20:16:37,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45654 states. [2019-12-18 20:16:38,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45654 to 45654. [2019-12-18 20:16:38,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45654 states. [2019-12-18 20:16:38,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45654 states to 45654 states and 159580 transitions. [2019-12-18 20:16:38,709 INFO L78 Accepts]: Start accepts. Automaton has 45654 states and 159580 transitions. Word has length 33 [2019-12-18 20:16:38,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:16:38,709 INFO L462 AbstractCegarLoop]: Abstraction has 45654 states and 159580 transitions. [2019-12-18 20:16:38,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:16:38,710 INFO L276 IsEmpty]: Start isEmpty. Operand 45654 states and 159580 transitions. [2019-12-18 20:16:38,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 20:16:38,766 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:16:38,766 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-18 20:16:38,766 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-18 20:16:38,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:16:38,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1064433590, now seen corresponding path program 1 times [2019-12-18 20:16:38,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:16:38,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971515781] [2019-12-18 20:16:38,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:16:38,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:16:38,815 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-18 20:16:38,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971515781] [2019-12-18 20:16:38,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:16:38,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:16:38,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442899226] [2019-12-18 20:16:38,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:16:38,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:16:38,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:16:38,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:16:38,818 INFO L87 Difference]: Start difference. First operand 45654 states and 159580 transitions. Second operand 4 states. [2019-12-18 20:16:39,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:16:39,141 INFO L93 Difference]: Finished difference Result 85076 states and 297808 transitions. [2019-12-18 20:16:39,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:16:39,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-18 20:16:39,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:16:39,237 INFO L225 Difference]: With dead ends: 85076 [2019-12-18 20:16:39,237 INFO L226 Difference]: Without dead ends: 45706 [2019-12-18 20:16:39,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:16:39,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45706 states. [2019-12-18 20:16:40,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45706 to 45654. [2019-12-18 20:16:40,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45654 states. [2019-12-18 20:16:41,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45654 states to 45654 states and 155310 transitions. [2019-12-18 20:16:41,083 INFO L78 Accepts]: Start accepts. Automaton has 45654 states and 155310 transitions. Word has length 34 [2019-12-18 20:16:41,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:16:41,084 INFO L462 AbstractCegarLoop]: Abstraction has 45654 states and 155310 transitions. [2019-12-18 20:16:41,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:16:41,084 INFO L276 IsEmpty]: Start isEmpty. Operand 45654 states and 155310 transitions. [2019-12-18 20:16:41,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 20:16:41,126 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:16:41,127 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-18 20:16:41,127 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-18 20:16:41,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:16:41,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1108665900, now seen corresponding path program 2 times [2019-12-18 20:16:41,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:16:41,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096743170] [2019-12-18 20:16:41,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:16:41,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:16:41,192 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-18 20:16:41,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096743170] [2019-12-18 20:16:41,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:16:41,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:16:41,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758034760] [2019-12-18 20:16:41,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:16:41,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:16:41,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:16:41,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:16:41,195 INFO L87 Difference]: Start difference. First operand 45654 states and 155310 transitions. Second operand 4 states. [2019-12-18 20:16:41,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:16:41,584 INFO L93 Difference]: Finished difference Result 40526 states and 134014 transitions. [2019-12-18 20:16:41,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:16:41,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-18 20:16:41,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:16:41,659 INFO L225 Difference]: With dead ends: 40526 [2019-12-18 20:16:41,659 INFO L226 Difference]: Without dead ends: 40526 [2019-12-18 20:16:41,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:16:41,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40526 states. [2019-12-18 20:16:42,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40526 to 39560. [2019-12-18 20:16:42,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39560 states. [2019-12-18 20:16:42,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39560 states to 39560 states and 130996 transitions. [2019-12-18 20:16:42,490 INFO L78 Accepts]: Start accepts. Automaton has 39560 states and 130996 transitions. Word has length 34 [2019-12-18 20:16:42,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:16:42,490 INFO L462 AbstractCegarLoop]: Abstraction has 39560 states and 130996 transitions. [2019-12-18 20:16:42,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:16:42,490 INFO L276 IsEmpty]: Start isEmpty. Operand 39560 states and 130996 transitions. [2019-12-18 20:16:42,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 20:16:42,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:16:42,524 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-18 20:16:42,524 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-18 20:16:42,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:16:42,524 INFO L82 PathProgramCache]: Analyzing trace with hash -375253438, now seen corresponding path program 3 times [2019-12-18 20:16:42,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:16:42,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605861965] [2019-12-18 20:16:42,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:16:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:16:42,600 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-18 20:16:42,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605861965] [2019-12-18 20:16:42,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:16:42,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:16:42,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817945771] [2019-12-18 20:16:42,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:16:42,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:16:42,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:16:42,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:16:42,602 INFO L87 Difference]: Start difference. First operand 39560 states and 130996 transitions. Second operand 5 states. [2019-12-18 20:16:42,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:16:42,687 INFO L93 Difference]: Finished difference Result 8575 states and 22854 transitions. [2019-12-18 20:16:42,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:16:42,688 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-18 20:16:42,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:16:42,696 INFO L225 Difference]: With dead ends: 8575 [2019-12-18 20:16:42,696 INFO L226 Difference]: Without dead ends: 6171 [2019-12-18 20:16:42,697 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-18 20:16:42,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6171 states. [2019-12-18 20:16:42,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6171 to 6115. [2019-12-18 20:16:42,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6115 states. [2019-12-18 20:16:42,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6115 states to 6115 states and 14794 transitions. [2019-12-18 20:16:42,765 INFO L78 Accepts]: Start accepts. Automaton has 6115 states and 14794 transitions. Word has length 34 [2019-12-18 20:16:42,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:16:42,765 INFO L462 AbstractCegarLoop]: Abstraction has 6115 states and 14794 transitions. [2019-12-18 20:16:42,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:16:42,765 INFO L276 IsEmpty]: Start isEmpty. Operand 6115 states and 14794 transitions. [2019-12-18 20:16:44,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-18 20:16:44,150 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:16:44,150 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-18 20:16:44,151 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-18 20:16:44,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:16:44,151 INFO L82 PathProgramCache]: Analyzing trace with hash -976080001, now seen corresponding path program 1 times [2019-12-18 20:16:44,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:16:44,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443370348] [2019-12-18 20:16:44,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:16:44,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:16:44,270 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-18 20:16:44,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443370348] [2019-12-18 20:16:44,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:16:44,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:16:44,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265188946] [2019-12-18 20:16:44,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:16:44,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:16:44,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:16:44,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:16:44,272 INFO L87 Difference]: Start difference. First operand 6115 states and 14794 transitions. Second operand 5 states. [2019-12-18 20:16:44,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:16:44,691 INFO L93 Difference]: Finished difference Result 7041 states and 16770 transitions. [2019-12-18 20:16:44,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:16:44,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-12-18 20:16:44,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:16:44,701 INFO L225 Difference]: With dead ends: 7041 [2019-12-18 20:16:44,701 INFO L226 Difference]: Without dead ends: 7041 [2019-12-18 20:16:44,701 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-18 20:16:44,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7041 states. [2019-12-18 20:16:44,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7041 to 6681. [2019-12-18 20:16:44,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6681 states. [2019-12-18 20:16:44,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6681 states to 6681 states and 16061 transitions. [2019-12-18 20:16:44,776 INFO L78 Accepts]: Start accepts. Automaton has 6681 states and 16061 transitions. Word has length 46 [2019-12-18 20:16:44,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:16:44,776 INFO L462 AbstractCegarLoop]: Abstraction has 6681 states and 16061 transitions. [2019-12-18 20:16:44,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:16:44,776 INFO L276 IsEmpty]: Start isEmpty. Operand 6681 states and 16061 transitions. [2019-12-18 20:16:44,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 20:16:44,782 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:16:44,782 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-18 20:16:44,783 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-18 20:16:44,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:16:44,783 INFO L82 PathProgramCache]: Analyzing trace with hash -944953888, now seen corresponding path program 1 times [2019-12-18 20:16:44,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:16:44,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263158121] [2019-12-18 20:16:44,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:16:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:16:44,887 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-18 20:16:44,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263158121] [2019-12-18 20:16:44,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:16:44,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:16:44,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875097567] [2019-12-18 20:16:44,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:16:44,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:16:44,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:16:44,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:16:44,889 INFO L87 Difference]: Start difference. First operand 6681 states and 16061 transitions. Second operand 6 states. [2019-12-18 20:16:44,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:16:44,993 INFO L93 Difference]: Finished difference Result 5219 states and 12606 transitions. [2019-12-18 20:16:44,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:16:44,994 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-18 20:16:44,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:16:44,999 INFO L225 Difference]: With dead ends: 5219 [2019-12-18 20:16:44,999 INFO L226 Difference]: Without dead ends: 2643 [2019-12-18 20:16:45,000 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-18 20:16:45,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2643 states. [2019-12-18 20:16:45,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2643 to 2525. [2019-12-18 20:16:45,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2525 states. [2019-12-18 20:16:45,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2525 states to 2525 states and 6087 transitions. [2019-12-18 20:16:45,047 INFO L78 Accepts]: Start accepts. Automaton has 2525 states and 6087 transitions. Word has length 47 [2019-12-18 20:16:45,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:16:45,047 INFO L462 AbstractCegarLoop]: Abstraction has 2525 states and 6087 transitions. [2019-12-18 20:16:45,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:16:45,048 INFO L276 IsEmpty]: Start isEmpty. Operand 2525 states and 6087 transitions. [2019-12-18 20:16:45,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-18 20:16:45,052 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:16:45,053 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-18 20:16:45,053 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-18 20:16:45,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:16:45,053 INFO L82 PathProgramCache]: Analyzing trace with hash -505353297, now seen corresponding path program 1 times [2019-12-18 20:16:45,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:16:45,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700313021] [2019-12-18 20:16:45,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:16:45,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:16:45,201 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-18 20:16:45,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700313021] [2019-12-18 20:16:45,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:16:45,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 20:16:45,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551671224] [2019-12-18 20:16:45,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:16:45,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:16:45,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:16:45,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:16:45,203 INFO L87 Difference]: Start difference. First operand 2525 states and 6087 transitions. Second operand 8 states. [2019-12-18 20:16:45,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:16:45,523 INFO L93 Difference]: Finished difference Result 5332 states and 12612 transitions. [2019-12-18 20:16:45,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 20:16:45,524 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2019-12-18 20:16:45,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:16:45,531 INFO L225 Difference]: With dead ends: 5332 [2019-12-18 20:16:45,531 INFO L226 Difference]: Without dead ends: 4641 [2019-12-18 20:16:45,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-12-18 20:16:45,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4641 states. [2019-12-18 20:16:45,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4641 to 3635. [2019-12-18 20:16:45,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3635 states. [2019-12-18 20:16:45,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3635 states to 3635 states and 9012 transitions. [2019-12-18 20:16:45,602 INFO L78 Accepts]: Start accepts. Automaton has 3635 states and 9012 transitions. Word has length 62 [2019-12-18 20:16:45,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:16:45,604 INFO L462 AbstractCegarLoop]: Abstraction has 3635 states and 9012 transitions. [2019-12-18 20:16:45,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:16:45,604 INFO L276 IsEmpty]: Start isEmpty. Operand 3635 states and 9012 transitions. [2019-12-18 20:16:45,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-18 20:16:45,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:16:45,609 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-18 20:16:45,609 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-18 20:16:45,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:16:45,610 INFO L82 PathProgramCache]: Analyzing trace with hash -141445855, now seen corresponding path program 2 times [2019-12-18 20:16:45,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:16:45,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128888619] [2019-12-18 20:16:45,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:16:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:16:45,722 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-18 20:16:45,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128888619] [2019-12-18 20:16:45,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:16:45,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:16:45,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262574075] [2019-12-18 20:16:45,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:16:45,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:16:45,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:16:45,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:16:45,724 INFO L87 Difference]: Start difference. First operand 3635 states and 9012 transitions. Second operand 6 states. [2019-12-18 20:16:46,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:16:46,358 INFO L93 Difference]: Finished difference Result 3859 states and 9454 transitions. [2019-12-18 20:16:46,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 20:16:46,358 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-18 20:16:46,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:16:46,364 INFO L225 Difference]: With dead ends: 3859 [2019-12-18 20:16:46,364 INFO L226 Difference]: Without dead ends: 3859 [2019-12-18 20:16:46,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:16:46,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3859 states. [2019-12-18 20:16:46,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3859 to 3643. [2019-12-18 20:16:46,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3643 states. [2019-12-18 20:16:46,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 9028 transitions. [2019-12-18 20:16:46,410 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 9028 transitions. Word has length 62 [2019-12-18 20:16:46,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:16:46,410 INFO L462 AbstractCegarLoop]: Abstraction has 3643 states and 9028 transitions. [2019-12-18 20:16:46,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:16:46,410 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 9028 transitions. [2019-12-18 20:16:46,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-18 20:16:46,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:16:46,414 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:16:46,414 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-18 20:16:46,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:16:46,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1033517023, now seen corresponding path program 3 times [2019-12-18 20:16:46,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:16:46,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61949082] [2019-12-18 20:16:46,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:16:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:16:46,479 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-18 20:16:46,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61949082] [2019-12-18 20:16:46,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:16:46,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:16:46,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59764748] [2019-12-18 20:16:46,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:16:46,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:16:46,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:16:46,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:16:46,481 INFO L87 Difference]: Start difference. First operand 3643 states and 9028 transitions. Second operand 3 states. [2019-12-18 20:16:46,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:16:46,505 INFO L93 Difference]: Finished difference Result 3643 states and 9027 transitions. [2019-12-18 20:16:46,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:16:46,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-12-18 20:16:46,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:16:46,511 INFO L225 Difference]: With dead ends: 3643 [2019-12-18 20:16:46,512 INFO L226 Difference]: Without dead ends: 3643 [2019-12-18 20:16:46,512 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-18 20:16:46,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3643 states. [2019-12-18 20:16:46,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3643 to 3542. [2019-12-18 20:16:46,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3542 states. [2019-12-18 20:16:46,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3542 states to 3542 states and 8841 transitions. [2019-12-18 20:16:46,573 INFO L78 Accepts]: Start accepts. Automaton has 3542 states and 8841 transitions. Word has length 62 [2019-12-18 20:16:46,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:16:46,574 INFO L462 AbstractCegarLoop]: Abstraction has 3542 states and 8841 transitions. [2019-12-18 20:16:46,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:16:46,574 INFO L276 IsEmpty]: Start isEmpty. Operand 3542 states and 8841 transitions. [2019-12-18 20:16:46,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-18 20:16:46,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:16:46,580 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-18 20:16:46,580 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-18 20:16:46,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:16:46,580 INFO L82 PathProgramCache]: Analyzing trace with hash 34894533, now seen corresponding path program 1 times [2019-12-18 20:16:46,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:16:46,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676146515] [2019-12-18 20:16:46,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:16:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:16:46,650 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-18 20:16:46,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676146515] [2019-12-18 20:16:46,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:16:46,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:16:46,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608805013] [2019-12-18 20:16:46,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:16:46,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:16:46,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:16:46,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:16:46,652 INFO L87 Difference]: Start difference. First operand 3542 states and 8841 transitions. Second operand 4 states. [2019-12-18 20:16:46,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:16:46,687 INFO L93 Difference]: Finished difference Result 4142 states and 10175 transitions. [2019-12-18 20:16:46,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:16:46,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-18 20:16:46,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:16:46,689 INFO L225 Difference]: With dead ends: 4142 [2019-12-18 20:16:46,689 INFO L226 Difference]: Without dead ends: 687 [2019-12-18 20:16:46,690 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-18 20:16:46,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-12-18 20:16:46,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2019-12-18 20:16:46,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2019-12-18 20:16:46,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1459 transitions. [2019-12-18 20:16:46,701 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1459 transitions. Word has length 62 [2019-12-18 20:16:46,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:16:46,701 INFO L462 AbstractCegarLoop]: Abstraction has 687 states and 1459 transitions. [2019-12-18 20:16:46,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:16:46,701 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1459 transitions. [2019-12-18 20:16:46,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 20:16:46,703 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:16:46,703 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-18 20:16:46,703 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:16:46,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:16:46,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1420483866, now seen corresponding path program 1 times [2019-12-18 20:16:46,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:16:46,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222796093] [2019-12-18 20:16:46,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:16:46,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:16:46,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:16:46,843 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:16:46,844 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:16:46,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= v_~z$w_buff0_used~0_138 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~a~0_9) (= 0 v_~z$r_buff1_thd3~0_41) (= 0 v_~weak$$choice0~0_8) (= v_~main$tmp_guard1~0_16 0) (= v_~z$r_buff0_thd3~0_79 0) (= v_~z$r_buff0_thd1~0_10 0) (= 0 v_~z$r_buff1_thd2~0_32) (= 0 v_~__unbuffered_p1_EAX~0_15) (= v_~__unbuffered_p1_EBX~0_14 0) (= v_~z~0_28 0) (= v_~z$r_buff1_thd1~0_8 0) (= v_~z$read_delayed~0_8 0) (= 0 v_~__unbuffered_cnt~0_21) (= v_~z$read_delayed_var~0.base_8 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~z$r_buff0_thd0~0_21 0) (= v_~x~0_10 0) (= 0 v_~z$flush_delayed~0_17) (= v_~z$r_buff0_thd2~0_58 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t266~0.base_23|) (= 0 v_~__unbuffered_p2_EAX~0_15) (= 0 v_~weak$$choice2~0_33) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t266~0.base_23|)) (= v_~__unbuffered_p2_EBX~0_15 0) (= 0 v_~z$r_buff1_thd0~0_26) (= 0 v_~z$w_buff1_used~0_74) (= 0 v_~__unbuffered_p0_EAX~0_17) (= |v_#NULL.offset_5| 0) (= 0 v_~y~0_8) (= 0 v_~z$w_buff1~0_33) (= |v_#valid_54| (store .cse0 |v_ULTIMATE.start_main_~#t266~0.base_23| 1)) (= v_~z$mem_tmp~0_12 0) (= 0 v_~z$w_buff0~0_39) (= |v_ULTIMATE.start_main_~#t266~0.offset_18| 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t266~0.base_23| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t266~0.base_23|) |v_ULTIMATE.start_main_~#t266~0.offset_18| 0)) |v_#memory_int_19|) (= 0 |v_#NULL.base_5|) (= v_~z$read_delayed_var~0.offset_8 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t266~0.base_23| 4)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_32, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t268~0.offset=|v_ULTIMATE.start_main_~#t268~0.offset_15|, ULTIMATE.start_main_~#t267~0.base=|v_ULTIMATE.start_main_~#t267~0.base_19|, ~a~0=v_~a~0_9, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_21, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, ULTIMATE.start_main_~#t266~0.offset=|v_ULTIMATE.start_main_~#t266~0.offset_18|, ~z$mem_tmp~0=v_~z$mem_tmp~0_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_15, ULTIMATE.start_main_~#t266~0.base=|v_ULTIMATE.start_main_~#t266~0.base_23|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_12|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_74, ~z$flush_delayed~0=v_~z$flush_delayed~0_17, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_24|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_10|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_79, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_10, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t267~0.offset=|v_ULTIMATE.start_main_~#t267~0.offset_15|, ULTIMATE.start_main_~#t268~0.base=|v_ULTIMATE.start_main_~#t268~0.base_18|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_26, ~y~0=v_~y~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_58, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_138, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_41, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_13|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_10|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_28, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t268~0.offset, ULTIMATE.start_main_~#t267~0.base, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t266~0.offset, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t266~0.base, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t267~0.offset, ULTIMATE.start_main_~#t268~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 20:16:46,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L840-1-->L842: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t267~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t267~0.base_11| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t267~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t267~0.base_11|) |v_ULTIMATE.start_main_~#t267~0.offset_10| 1)) |v_#memory_int_13|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t267~0.base_11|)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t267~0.base_11| 1)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t267~0.base_11| 4) |v_#length_17|) (= |v_ULTIMATE.start_main_~#t267~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t267~0.offset=|v_ULTIMATE.start_main_~#t267~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t267~0.base=|v_ULTIMATE.start_main_~#t267~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t267~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t267~0.base] because there is no mapped edge [2019-12-18 20:16:46,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L842-1-->L844: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t268~0.base_9|)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t268~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t268~0.base_9|) |v_ULTIMATE.start_main_~#t268~0.offset_8| 2)) |v_#memory_int_9|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t268~0.base_9| 1) |v_#valid_27|) (not (= 0 |v_ULTIMATE.start_main_~#t268~0.base_9|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t268~0.base_9|) (= |v_ULTIMATE.start_main_~#t268~0.offset_8| 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t268~0.base_9| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t268~0.base=|v_ULTIMATE.start_main_~#t268~0.base_9|, #valid=|v_#valid_27|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t268~0.offset=|v_ULTIMATE.start_main_~#t268~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t268~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t268~0.offset] because there is no mapped edge [2019-12-18 20:16:46,853 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [929] [929] P2ENTRY-->L4-3: Formula: (and (= (mod v_~z$w_buff1_used~0_58 256) 0) (= 1 v_~z$w_buff0~0_25) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_~z$w_buff0_used~0_108 v_~z$w_buff1_used~0_58) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5| v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_7) (= v_~z$w_buff0_used~0_107 1) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= v_~z$w_buff0~0_26 v_~z$w_buff1~0_23)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_108, ~z$w_buff0~0=v_~z$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|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~z$w_buff0~0=v_~z$w_buff0~0_25, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_58, ~z$w_buff1~0=v_~z$w_buff1~0_23, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 20:16:46,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [969] [969] L802-2-->L802-4: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-909738326 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-909738326 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out-909738326| ~z$w_buff0~0_In-909738326)) (and (= |P2Thread1of1ForFork0_#t~ite28_Out-909738326| ~z$w_buff1~0_In-909738326) (or .cse1 .cse0)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-909738326, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-909738326, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-909738326, ~z$w_buff1~0=~z$w_buff1~0_In-909738326} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-909738326|, ~z$w_buff0~0=~z$w_buff0~0_In-909738326, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-909738326, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-909738326, ~z$w_buff1~0=~z$w_buff1~0_In-909738326} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 20:16:46,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [886] [886] L802-4-->L803: Formula: (= v_~z~0_19 |v_P2Thread1of1ForFork0_#t~ite28_8|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_8|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_7|, ~z~0=v_~z~0_19, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, ~z~0, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 20:16:46,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L807-->L808: Formula: (and (= v_~z$r_buff0_thd3~0_48 v_~z$r_buff0_thd3~0_47) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_48, ~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|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 20:16:46,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [956] [956] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-573670037 256)))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite48_Out-573670037| ~z~0_In-573670037)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite48_Out-573670037| ~z$mem_tmp~0_In-573670037)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-573670037, ~z$flush_delayed~0=~z$flush_delayed~0_In-573670037, ~z~0=~z~0_In-573670037} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-573670037|, ~z$mem_tmp~0=~z$mem_tmp~0_In-573670037, ~z$flush_delayed~0=~z$flush_delayed~0_In-573670037, ~z~0=~z~0_In-573670037} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-18 20:16:46,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 1 v_~a~0_5) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= v_~__unbuffered_p0_EAX~0_6 v_~x~0_5) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_5} OutVars{~a~0=v_~a~0_5, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_5, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 20:16:46,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [967] [967] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-555303863 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-555303863 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite51_Out-555303863| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite51_Out-555303863| ~z$w_buff0_used~0_In-555303863) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-555303863, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-555303863} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-555303863, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-555303863, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out-555303863|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-18 20:16:46,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L819-->L819-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In2117641606 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In2117641606 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In2117641606 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In2117641606 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite52_Out2117641606|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In2117641606 |P2Thread1of1ForFork0_#t~ite52_Out2117641606|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2117641606, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2117641606, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2117641606, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2117641606} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2117641606, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2117641606, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2117641606, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out2117641606|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2117641606} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-18 20:16:46,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L820-->L821: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In473015699 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In473015699 256) 0))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd3~0_Out473015699) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd3~0_In473015699 ~z$r_buff0_thd3~0_Out473015699)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In473015699, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In473015699} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In473015699, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out473015699, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out473015699|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-18 20:16:46,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L821-->L821-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In1681891652 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In1681891652 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In1681891652 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1681891652 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite54_Out1681891652| ~z$r_buff1_thd3~0_In1681891652)) (and (= |P2Thread1of1ForFork0_#t~ite54_Out1681891652| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1681891652, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1681891652, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1681891652, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1681891652} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1681891652, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out1681891652|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1681891652, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1681891652, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1681891652} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-18 20:16:46,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L821-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_35 |v_P2Thread1of1ForFork0_#t~ite54_8|)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_35, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 20:16:46,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In954248249 256) 0))) (or (and .cse0 (= ~z~0_In954248249 |P1Thread1of1ForFork2_#t~ite25_Out954248249|)) (and (= ~z$mem_tmp~0_In954248249 |P1Thread1of1ForFork2_#t~ite25_Out954248249|) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In954248249, ~z$flush_delayed~0=~z$flush_delayed~0_In954248249, ~z~0=~z~0_In954248249} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In954248249, ~z$flush_delayed~0=~z$flush_delayed~0_In954248249, ~z~0=~z~0_In954248249, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out954248249|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 20:16:46,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L773-2-->P1EXIT: Formula: (and (= 0 v_~z$flush_delayed~0_13) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= |v_P1Thread1of1ForFork2_#t~ite25_8| v_~z~0_24) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~z~0=v_~z~0_24, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 20:16:46,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [902] [902] L848-->L850-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_96 256)) (= 0 (mod v_~z$r_buff0_thd0~0_15 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_96, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_96, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 20:16:46,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L850-2-->L850-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite59_Out-50533182| |ULTIMATE.start_main_#t~ite58_Out-50533182|)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-50533182 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-50533182 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite58_Out-50533182| ~z~0_In-50533182) (or .cse1 .cse2)) (and .cse0 (not .cse1) (= |ULTIMATE.start_main_#t~ite58_Out-50533182| ~z$w_buff1~0_In-50533182) (not .cse2)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-50533182, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-50533182, ~z$w_buff1~0=~z$w_buff1~0_In-50533182, ~z~0=~z~0_In-50533182} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-50533182, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-50533182|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-50533182, ~z$w_buff1~0=~z$w_buff1~0_In-50533182, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-50533182|, ~z~0=~z~0_In-50533182} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-18 20:16:46,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L851-->L851-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1320502738 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1320502738 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite60_Out1320502738| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1320502738 |ULTIMATE.start_main_#t~ite60_Out1320502738|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1320502738, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1320502738} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1320502738|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1320502738, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1320502738} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-18 20:16:46,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L852-->L852-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In507855194 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In507855194 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In507855194 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In507855194 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite61_Out507855194|)) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In507855194 |ULTIMATE.start_main_#t~ite61_Out507855194|) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In507855194, ~z$w_buff0_used~0=~z$w_buff0_used~0_In507855194, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In507855194, ~z$w_buff1_used~0=~z$w_buff1_used~0_In507855194} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In507855194, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out507855194|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In507855194, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In507855194, ~z$w_buff1_used~0=~z$w_buff1_used~0_In507855194} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-18 20:16:46,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L853-->L853-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1030792589 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1030792589 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite62_Out-1030792589|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-1030792589 |ULTIMATE.start_main_#t~ite62_Out-1030792589|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1030792589, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1030792589} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1030792589|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1030792589, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1030792589} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-18 20:16:46,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L854-->L854-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In330077399 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In330077399 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In330077399 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In330077399 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In330077399 |ULTIMATE.start_main_#t~ite63_Out330077399|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite63_Out330077399|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In330077399, ~z$w_buff0_used~0=~z$w_buff0_used~0_In330077399, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In330077399, ~z$w_buff1_used~0=~z$w_buff1_used~0_In330077399} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out330077399|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In330077399, ~z$w_buff0_used~0=~z$w_buff0_used~0_In330077399, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In330077399, ~z$w_buff1_used~0=~z$w_buff1_used~0_In330077399} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-18 20:16:46,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1011] [1011] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_10 256)) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~main$tmp_guard1~0_10 0) (= v_~__unbuffered_p2_EBX~0_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start_main_#t~ite63_15| v_~z$r_buff1_thd0~0_18) (= 0 v_~__unbuffered_p0_EAX~0_11) (= 1 v_~__unbuffered_p1_EAX~0_9) (= v_~__unbuffered_p2_EAX~0_9 1)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_15|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_14|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 20:16:47,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:16:47 BasicIcfg [2019-12-18 20:16:47,009 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:16:47,017 INFO L168 Benchmark]: Toolchain (without parser) took 59412.70 ms. Allocated memory was 142.1 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 98.1 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 833.7 MB. Max. memory is 7.1 GB. [2019-12-18 20:16:47,018 INFO L168 Benchmark]: CDTParser took 1.52 ms. Allocated memory is still 142.1 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 20:16:47,018 INFO L168 Benchmark]: CACSL2BoogieTranslator took 841.95 ms. Allocated memory was 142.1 MB in the beginning and 199.2 MB in the end (delta: 57.1 MB). Free memory was 97.7 MB in the beginning and 151.8 MB in the end (delta: -54.2 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-12-18 20:16:47,020 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.11 ms. Allocated memory is still 199.2 MB. Free memory was 151.8 MB in the beginning and 149.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 20:16:47,021 INFO L168 Benchmark]: Boogie Preprocessor took 43.04 ms. Allocated memory is still 199.2 MB. Free memory was 149.0 MB in the beginning and 146.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 20:16:47,021 INFO L168 Benchmark]: RCFGBuilder took 916.28 ms. Allocated memory is still 199.2 MB. Free memory was 146.2 MB in the beginning and 90.9 MB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 7.1 GB. [2019-12-18 20:16:47,024 INFO L168 Benchmark]: TraceAbstraction took 57525.16 ms. Allocated memory was 199.2 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 90.2 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 768.8 MB. Max. memory is 7.1 GB. [2019-12-18 20:16:47,030 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.52 ms. Allocated memory is still 142.1 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 841.95 ms. Allocated memory was 142.1 MB in the beginning and 199.2 MB in the end (delta: 57.1 MB). Free memory was 97.7 MB in the beginning and 151.8 MB in the end (delta: -54.2 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.11 ms. Allocated memory is still 199.2 MB. Free memory was 151.8 MB in the beginning and 149.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.04 ms. Allocated memory is still 199.2 MB. Free memory was 149.0 MB in the beginning and 146.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 916.28 ms. Allocated memory is still 199.2 MB. Free memory was 146.2 MB in the beginning and 90.9 MB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 57525.16 ms. Allocated memory was 199.2 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 90.2 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 768.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.6s, 197 ProgramPointsBefore, 106 ProgramPointsAfterwards, 243 TransitionsBefore, 126 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 30 ChoiceCompositions, 8928 VarBasedMoverChecksPositive, 249 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 134090 CheckedPairsTotal, 127 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(&t266, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] FCALL, FORK 0 pthread_create(&t267, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L844] FCALL, FORK 0 pthread_create(&t268, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L792] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L793] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L794] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L795] 3 z$r_buff0_thd3 = (_Bool)1 [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 z$flush_delayed = weak$$choice2 [L801] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L804] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L804] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L805] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L805] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L806] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 3 z = z$flush_delayed ? z$mem_tmp : z [L811] 3 z$flush_delayed = (_Bool)0 [L814] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 2 x = 1 [L755] 2 y = 1 [L758] 2 __unbuffered_p1_EAX = y [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 z$flush_delayed = weak$$choice2 [L764] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L818] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L765] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L819] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L766] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L767] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L768] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L771] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L851] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L852] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L853] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 188 locations, 2 error locations. Result: UNSAFE, OverallTime: 57.1s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 14.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3385 SDtfs, 4117 SDslu, 5893 SDs, 0 SdLazy, 2239 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 23 SyntacticMatches, 6 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82542occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 30.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 27489 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 679 NumberOfCodeBlocks, 679 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 599 ConstructedInterpolants, 0 QuantifiedInterpolants, 69643 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...