/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe034_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 23:00:58,276 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 23:00:58,281 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 23:00:58,296 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 23:00:58,296 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 23:00:58,297 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 23:00:58,299 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 23:00:58,300 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 23:00:58,302 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 23:00:58,303 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 23:00:58,304 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 23:00:58,305 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 23:00:58,305 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 23:00:58,306 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 23:00:58,307 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 23:00:58,308 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 23:00:58,309 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 23:00:58,310 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 23:00:58,312 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 23:00:58,314 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 23:00:58,316 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 23:00:58,317 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 23:00:58,318 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 23:00:58,319 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 23:00:58,321 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 23:00:58,321 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 23:00:58,322 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 23:00:58,323 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 23:00:58,323 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 23:00:58,324 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 23:00:58,325 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 23:00:58,325 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 23:00:58,326 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 23:00:58,327 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 23:00:58,328 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 23:00:58,328 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 23:00:58,329 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 23:00:58,329 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 23:00:58,329 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 23:00:58,330 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 23:00:58,331 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 23:00:58,332 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-MCR.epf [2019-12-27 23:00:58,349 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 23:00:58,349 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 23:00:58,350 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 23:00:58,350 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 23:00:58,350 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 23:00:58,354 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 23:00:58,355 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 23:00:58,355 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 23:00:58,355 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 23:00:58,355 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 23:00:58,356 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 23:00:58,356 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 23:00:58,356 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 23:00:58,356 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 23:00:58,356 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 23:00:58,357 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 23:00:58,357 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 23:00:58,357 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 23:00:58,357 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 23:00:58,357 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 23:00:58,358 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 23:00:58,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 23:00:58,358 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 23:00:58,358 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 23:00:58,359 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 23:00:58,359 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 23:00:58,359 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 23:00:58,359 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 23:00:58,359 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 23:00:58,360 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 23:00:58,360 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 23:00:58,360 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 23:00:58,627 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 23:00:58,648 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 23:00:58,652 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 23:00:58,653 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 23:00:58,654 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 23:00:58,655 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe034_power.oepc.i [2019-12-27 23:00:58,732 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce9602339/e771be657d80449f945c311d1ba1f48c/FLAGfc15e62b3 [2019-12-27 23:00:59,237 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 23:00:59,238 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe034_power.oepc.i [2019-12-27 23:00:59,264 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce9602339/e771be657d80449f945c311d1ba1f48c/FLAGfc15e62b3 [2019-12-27 23:00:59,504 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce9602339/e771be657d80449f945c311d1ba1f48c [2019-12-27 23:00:59,513 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 23:00:59,514 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 23:00:59,515 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 23:00:59,516 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 23:00:59,519 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 23:00:59,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:00:59" (1/1) ... [2019-12-27 23:00:59,524 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62e11d7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:00:59, skipping insertion in model container [2019-12-27 23:00:59,524 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:00:59" (1/1) ... [2019-12-27 23:00:59,537 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 23:00:59,602 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 23:01:00,064 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:01:00,085 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 23:01:00,173 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:01:00,260 INFO L208 MainTranslator]: Completed translation [2019-12-27 23:01:00,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:01:00 WrapperNode [2019-12-27 23:01:00,261 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 23:01:00,261 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 23:01:00,262 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 23:01:00,262 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 23:01:00,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:01:00" (1/1) ... [2019-12-27 23:01:00,291 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:01:00" (1/1) ... [2019-12-27 23:01:00,324 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 23:01:00,324 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 23:01:00,324 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 23:01:00,325 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 23:01:00,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:01:00" (1/1) ... [2019-12-27 23:01:00,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:01:00" (1/1) ... [2019-12-27 23:01:00,340 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:01:00" (1/1) ... [2019-12-27 23:01:00,340 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:01:00" (1/1) ... [2019-12-27 23:01:00,349 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:01:00" (1/1) ... [2019-12-27 23:01:00,356 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:01:00" (1/1) ... [2019-12-27 23:01:00,362 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:01:00" (1/1) ... [2019-12-27 23:01:00,366 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 23:01:00,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 23:01:00,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 23:01:00,367 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 23:01:00,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:01:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 23:01:00,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 23:01:00,428 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 23:01:00,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 23:01:00,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 23:01:00,428 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 23:01:00,428 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 23:01:00,429 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 23:01:00,429 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 23:01:00,429 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 23:01:00,429 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 23:01:00,429 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 23:01:00,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 23:01:00,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 23:01:00,431 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 23:01:01,123 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 23:01:01,124 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 23:01:01,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:01:01 BoogieIcfgContainer [2019-12-27 23:01:01,125 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 23:01:01,127 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 23:01:01,127 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 23:01:01,130 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 23:01:01,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 11:00:59" (1/3) ... [2019-12-27 23:01:01,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c8346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:01:01, skipping insertion in model container [2019-12-27 23:01:01,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:01:00" (2/3) ... [2019-12-27 23:01:01,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c8346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:01:01, skipping insertion in model container [2019-12-27 23:01:01,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:01:01" (3/3) ... [2019-12-27 23:01:01,134 INFO L109 eAbstractionObserver]: Analyzing ICFG safe034_power.oepc.i [2019-12-27 23:01:01,145 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 23:01:01,146 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 23:01:01,154 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 23:01:01,155 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 23:01:01,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,198 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,199 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,202 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,203 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,244 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,244 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,252 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,252 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,252 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,267 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,268 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,273 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,292 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,300 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,300 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,301 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:01,318 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 23:01:01,339 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 23:01:01,339 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 23:01:01,339 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 23:01:01,339 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 23:01:01,339 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 23:01:01,339 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 23:01:01,339 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 23:01:01,340 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 23:01:01,356 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 176 transitions [2019-12-27 23:01:01,358 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-12-27 23:01:01,443 INFO L132 PetriNetUnfolder]: 35/173 cut-off events. [2019-12-27 23:01:01,444 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 23:01:01,459 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 342 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-27 23:01:01,481 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-12-27 23:01:01,527 INFO L132 PetriNetUnfolder]: 35/173 cut-off events. [2019-12-27 23:01:01,528 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 23:01:01,533 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 342 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-27 23:01:01,547 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-27 23:01:01,548 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 23:01:04,738 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-27 23:01:05,150 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 23:01:05,263 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 23:01:05,287 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48572 [2019-12-27 23:01:05,288 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-27 23:01:05,291 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 83 transitions [2019-12-27 23:01:06,152 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14526 states. [2019-12-27 23:01:06,154 INFO L276 IsEmpty]: Start isEmpty. Operand 14526 states. [2019-12-27 23:01:06,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 23:01:06,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:01:06,161 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:01:06,162 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:01:06,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:01:06,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1566852802, now seen corresponding path program 1 times [2019-12-27 23:01:06,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:01:06,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270117757] [2019-12-27 23:01:06,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:01:06,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:01:06,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:01:06,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270117757] [2019-12-27 23:01:06,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:01:06,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 23:01:06,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1676566028] [2019-12-27 23:01:06,442 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:01:06,446 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:01:06,457 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 23:01:06,458 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:01:06,461 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:01:06,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:01:06,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:01:06,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:01:06,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:01:06,477 INFO L87 Difference]: Start difference. First operand 14526 states. Second operand 3 states. [2019-12-27 23:01:06,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:01:06,903 INFO L93 Difference]: Finished difference Result 13996 states and 53893 transitions. [2019-12-27 23:01:06,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:01:06,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 23:01:06,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:01:07,090 INFO L225 Difference]: With dead ends: 13996 [2019-12-27 23:01:07,090 INFO L226 Difference]: Without dead ends: 13156 [2019-12-27 23:01:07,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:01:07,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13156 states. [2019-12-27 23:01:07,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13156 to 13156. [2019-12-27 23:01:07,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13156 states. [2019-12-27 23:01:07,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13156 states to 13156 states and 50585 transitions. [2019-12-27 23:01:07,890 INFO L78 Accepts]: Start accepts. Automaton has 13156 states and 50585 transitions. Word has length 7 [2019-12-27 23:01:07,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:01:07,891 INFO L462 AbstractCegarLoop]: Abstraction has 13156 states and 50585 transitions. [2019-12-27 23:01:07,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:01:07,891 INFO L276 IsEmpty]: Start isEmpty. Operand 13156 states and 50585 transitions. [2019-12-27 23:01:07,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 23:01:07,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:01:07,903 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:01:07,903 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:01:07,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:01:07,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1632341996, now seen corresponding path program 1 times [2019-12-27 23:01:07,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:01:07,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564757209] [2019-12-27 23:01:07,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:01:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:01:08,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:01:08,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564757209] [2019-12-27 23:01:08,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:01:08,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 23:01:08,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [956915799] [2019-12-27 23:01:08,024 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:01:08,025 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:01:08,029 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 23:01:08,030 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:01:08,030 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:01:08,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 23:01:08,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:01:08,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 23:01:08,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 23:01:08,032 INFO L87 Difference]: Start difference. First operand 13156 states and 50585 transitions. Second operand 4 states. [2019-12-27 23:01:09,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:01:09,130 INFO L93 Difference]: Finished difference Result 19646 states and 72584 transitions. [2019-12-27 23:01:09,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 23:01:09,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 23:01:09,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:01:09,220 INFO L225 Difference]: With dead ends: 19646 [2019-12-27 23:01:09,220 INFO L226 Difference]: Without dead ends: 19616 [2019-12-27 23:01:09,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:01:09,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19616 states. [2019-12-27 23:01:09,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19616 to 17838. [2019-12-27 23:01:09,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17838 states. [2019-12-27 23:01:09,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17838 states to 17838 states and 66884 transitions. [2019-12-27 23:01:09,951 INFO L78 Accepts]: Start accepts. Automaton has 17838 states and 66884 transitions. Word has length 13 [2019-12-27 23:01:09,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:01:09,951 INFO L462 AbstractCegarLoop]: Abstraction has 17838 states and 66884 transitions. [2019-12-27 23:01:09,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 23:01:09,952 INFO L276 IsEmpty]: Start isEmpty. Operand 17838 states and 66884 transitions. [2019-12-27 23:01:09,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 23:01:09,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:01:09,956 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:01:09,956 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:01:09,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:01:09,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1674715579, now seen corresponding path program 1 times [2019-12-27 23:01:09,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:01:09,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544582444] [2019-12-27 23:01:09,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:01:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:01:10,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:01:10,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544582444] [2019-12-27 23:01:10,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:01:10,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:01:10,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [709782339] [2019-12-27 23:01:10,088 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:01:10,091 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:01:10,097 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 23:01:10,097 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:01:10,180 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 23:01:10,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:01:10,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:01:10,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:01:10,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:01:10,181 INFO L87 Difference]: Start difference. First operand 17838 states and 66884 transitions. Second operand 7 states. [2019-12-27 23:01:10,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:01:10,945 INFO L93 Difference]: Finished difference Result 24700 states and 90839 transitions. [2019-12-27 23:01:10,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 23:01:10,945 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-12-27 23:01:10,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:01:11,043 INFO L225 Difference]: With dead ends: 24700 [2019-12-27 23:01:11,043 INFO L226 Difference]: Without dead ends: 24662 [2019-12-27 23:01:11,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:01:11,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24662 states. [2019-12-27 23:01:11,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24662 to 21030. [2019-12-27 23:01:11,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21030 states. [2019-12-27 23:01:11,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21030 states to 21030 states and 78424 transitions. [2019-12-27 23:01:11,949 INFO L78 Accepts]: Start accepts. Automaton has 21030 states and 78424 transitions. Word has length 16 [2019-12-27 23:01:11,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:01:11,950 INFO L462 AbstractCegarLoop]: Abstraction has 21030 states and 78424 transitions. [2019-12-27 23:01:11,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:01:11,950 INFO L276 IsEmpty]: Start isEmpty. Operand 21030 states and 78424 transitions. [2019-12-27 23:01:11,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 23:01:11,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:01:11,959 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:01:11,959 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:01:11,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:01:11,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1310988069, now seen corresponding path program 1 times [2019-12-27 23:01:11,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:01:11,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71866432] [2019-12-27 23:01:11,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:01:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:01:12,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:01:12,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71866432] [2019-12-27 23:01:12,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:01:12,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 23:01:12,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2079746413] [2019-12-27 23:01:12,029 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:01:12,032 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:01:12,034 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 20 transitions. [2019-12-27 23:01:12,035 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:01:12,035 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:01:12,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:01:12,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:01:12,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:01:12,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:01:12,038 INFO L87 Difference]: Start difference. First operand 21030 states and 78424 transitions. Second operand 3 states. [2019-12-27 23:01:12,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:01:12,150 INFO L93 Difference]: Finished difference Result 20886 states and 77807 transitions. [2019-12-27 23:01:12,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:01:12,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 23:01:12,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:01:12,266 INFO L225 Difference]: With dead ends: 20886 [2019-12-27 23:01:12,267 INFO L226 Difference]: Without dead ends: 20886 [2019-12-27 23:01:12,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:01:12,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20886 states. [2019-12-27 23:01:13,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20886 to 20886. [2019-12-27 23:01:13,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20886 states. [2019-12-27 23:01:14,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20886 states to 20886 states and 77807 transitions. [2019-12-27 23:01:14,052 INFO L78 Accepts]: Start accepts. Automaton has 20886 states and 77807 transitions. Word has length 18 [2019-12-27 23:01:14,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:01:14,052 INFO L462 AbstractCegarLoop]: Abstraction has 20886 states and 77807 transitions. [2019-12-27 23:01:14,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:01:14,053 INFO L276 IsEmpty]: Start isEmpty. Operand 20886 states and 77807 transitions. [2019-12-27 23:01:14,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 23:01:14,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:01:14,067 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:01:14,068 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:01:14,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:01:14,068 INFO L82 PathProgramCache]: Analyzing trace with hash 718938577, now seen corresponding path program 1 times [2019-12-27 23:01:14,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:01:14,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734692529] [2019-12-27 23:01:14,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:01:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:01:14,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:01:14,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734692529] [2019-12-27 23:01:14,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:01:14,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 23:01:14,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [757900719] [2019-12-27 23:01:14,214 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:01:14,217 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:01:14,222 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 31 transitions. [2019-12-27 23:01:14,223 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:01:14,223 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:01:14,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:01:14,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:01:14,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:01:14,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:01:14,225 INFO L87 Difference]: Start difference. First operand 20886 states and 77807 transitions. Second operand 3 states. [2019-12-27 23:01:14,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:01:14,383 INFO L93 Difference]: Finished difference Result 19848 states and 73020 transitions. [2019-12-27 23:01:14,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:01:14,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-27 23:01:14,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:01:14,443 INFO L225 Difference]: With dead ends: 19848 [2019-12-27 23:01:14,443 INFO L226 Difference]: Without dead ends: 19848 [2019-12-27 23:01:14,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:01:14,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19848 states. [2019-12-27 23:01:15,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19848 to 19584. [2019-12-27 23:01:15,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19584 states. [2019-12-27 23:01:15,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19584 states to 19584 states and 72120 transitions. [2019-12-27 23:01:15,164 INFO L78 Accepts]: Start accepts. Automaton has 19584 states and 72120 transitions. Word has length 19 [2019-12-27 23:01:15,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:01:15,164 INFO L462 AbstractCegarLoop]: Abstraction has 19584 states and 72120 transitions. [2019-12-27 23:01:15,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:01:15,164 INFO L276 IsEmpty]: Start isEmpty. Operand 19584 states and 72120 transitions. [2019-12-27 23:01:15,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 23:01:15,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:01:15,173 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:01:15,173 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:01:15,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:01:15,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1055276181, now seen corresponding path program 1 times [2019-12-27 23:01:15,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:01:15,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747177324] [2019-12-27 23:01:15,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:01:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:01:15,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:01:15,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747177324] [2019-12-27 23:01:15,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:01:15,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 23:01:15,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [406391504] [2019-12-27 23:01:15,252 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:01:15,254 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:01:15,256 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 27 transitions. [2019-12-27 23:01:15,257 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:01:15,257 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:01:15,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:01:15,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:01:15,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:01:15,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:01:15,258 INFO L87 Difference]: Start difference. First operand 19584 states and 72120 transitions. Second operand 5 states. [2019-12-27 23:01:15,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:01:15,322 INFO L93 Difference]: Finished difference Result 3154 states and 9583 transitions. [2019-12-27 23:01:15,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 23:01:15,323 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 23:01:15,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:01:15,328 INFO L225 Difference]: With dead ends: 3154 [2019-12-27 23:01:15,328 INFO L226 Difference]: Without dead ends: 2062 [2019-12-27 23:01:15,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:01:15,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2062 states. [2019-12-27 23:01:15,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2062 to 2062. [2019-12-27 23:01:15,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2062 states. [2019-12-27 23:01:15,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2062 states to 2062 states and 5476 transitions. [2019-12-27 23:01:15,364 INFO L78 Accepts]: Start accepts. Automaton has 2062 states and 5476 transitions. Word has length 19 [2019-12-27 23:01:15,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:01:15,364 INFO L462 AbstractCegarLoop]: Abstraction has 2062 states and 5476 transitions. [2019-12-27 23:01:15,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:01:15,364 INFO L276 IsEmpty]: Start isEmpty. Operand 2062 states and 5476 transitions. [2019-12-27 23:01:15,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 23:01:15,368 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:01:15,368 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] [2019-12-27 23:01:15,368 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:01:15,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:01:15,369 INFO L82 PathProgramCache]: Analyzing trace with hash -322199084, now seen corresponding path program 1 times [2019-12-27 23:01:15,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:01:15,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818170203] [2019-12-27 23:01:15,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:01:15,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:01:15,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:01:15,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818170203] [2019-12-27 23:01:15,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:01:15,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:01:15,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1198457913] [2019-12-27 23:01:15,420 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:01:15,424 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:01:15,442 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 97 transitions. [2019-12-27 23:01:15,442 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:01:15,467 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 23:01:15,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:01:15,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:01:15,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:01:15,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:01:15,468 INFO L87 Difference]: Start difference. First operand 2062 states and 5476 transitions. Second operand 5 states. [2019-12-27 23:01:15,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:01:15,546 INFO L93 Difference]: Finished difference Result 2908 states and 7451 transitions. [2019-12-27 23:01:15,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:01:15,547 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-27 23:01:15,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:01:15,551 INFO L225 Difference]: With dead ends: 2908 [2019-12-27 23:01:15,551 INFO L226 Difference]: Without dead ends: 2908 [2019-12-27 23:01:15,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:01:15,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2019-12-27 23:01:15,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 2158. [2019-12-27 23:01:15,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2158 states. [2019-12-27 23:01:15,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2158 states to 2158 states and 5618 transitions. [2019-12-27 23:01:15,591 INFO L78 Accepts]: Start accepts. Automaton has 2158 states and 5618 transitions. Word has length 29 [2019-12-27 23:01:15,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:01:15,592 INFO L462 AbstractCegarLoop]: Abstraction has 2158 states and 5618 transitions. [2019-12-27 23:01:15,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:01:15,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2158 states and 5618 transitions. [2019-12-27 23:01:15,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 23:01:15,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:01:15,596 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] [2019-12-27 23:01:15,596 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:01:15,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:01:15,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1477101190, now seen corresponding path program 1 times [2019-12-27 23:01:15,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:01:15,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568316478] [2019-12-27 23:01:15,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:01:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:01:15,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:01:15,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568316478] [2019-12-27 23:01:15,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:01:15,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 23:01:15,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1303952768] [2019-12-27 23:01:15,827 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:01:15,832 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:01:15,851 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 97 transitions. [2019-12-27 23:01:15,851 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:01:15,908 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 23:01:15,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 23:01:15,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:01:15,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 23:01:15,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 23:01:15,909 INFO L87 Difference]: Start difference. First operand 2158 states and 5618 transitions. Second operand 8 states. [2019-12-27 23:01:16,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:01:16,520 INFO L93 Difference]: Finished difference Result 3388 states and 8561 transitions. [2019-12-27 23:01:16,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 23:01:16,521 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-12-27 23:01:16,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:01:16,525 INFO L225 Difference]: With dead ends: 3388 [2019-12-27 23:01:16,525 INFO L226 Difference]: Without dead ends: 3384 [2019-12-27 23:01:16,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:01:16,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3384 states. [2019-12-27 23:01:16,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3384 to 2198. [2019-12-27 23:01:16,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2198 states. [2019-12-27 23:01:16,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2198 states to 2198 states and 5719 transitions. [2019-12-27 23:01:16,554 INFO L78 Accepts]: Start accepts. Automaton has 2198 states and 5719 transitions. Word has length 29 [2019-12-27 23:01:16,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:01:16,554 INFO L462 AbstractCegarLoop]: Abstraction has 2198 states and 5719 transitions. [2019-12-27 23:01:16,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 23:01:16,554 INFO L276 IsEmpty]: Start isEmpty. Operand 2198 states and 5719 transitions. [2019-12-27 23:01:16,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 23:01:16,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:01:16,558 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] [2019-12-27 23:01:16,558 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:01:16,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:01:16,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1866363017, now seen corresponding path program 1 times [2019-12-27 23:01:16,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:01:16,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32654012] [2019-12-27 23:01:16,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:01:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:01:16,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:01:16,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32654012] [2019-12-27 23:01:16,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:01:16,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 23:01:16,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1459207349] [2019-12-27 23:01:16,615 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:01:16,620 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:01:16,630 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 45 states and 49 transitions. [2019-12-27 23:01:16,631 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:01:16,631 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:01:16,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:01:16,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:01:16,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:01:16,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:01:16,632 INFO L87 Difference]: Start difference. First operand 2198 states and 5719 transitions. Second operand 3 states. [2019-12-27 23:01:16,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:01:16,651 INFO L93 Difference]: Finished difference Result 3475 states and 8699 transitions. [2019-12-27 23:01:16,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:01:16,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-27 23:01:16,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:01:16,655 INFO L225 Difference]: With dead ends: 3475 [2019-12-27 23:01:16,655 INFO L226 Difference]: Without dead ends: 2220 [2019-12-27 23:01:16,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:01:16,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2220 states. [2019-12-27 23:01:16,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2220 to 2192. [2019-12-27 23:01:16,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2192 states. [2019-12-27 23:01:16,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 5606 transitions. [2019-12-27 23:01:16,689 INFO L78 Accepts]: Start accepts. Automaton has 2192 states and 5606 transitions. Word has length 30 [2019-12-27 23:01:16,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:01:16,689 INFO L462 AbstractCegarLoop]: Abstraction has 2192 states and 5606 transitions. [2019-12-27 23:01:16,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:01:16,689 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 5606 transitions. [2019-12-27 23:01:16,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 23:01:16,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:01:16,693 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] [2019-12-27 23:01:16,693 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:01:16,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:01:16,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1983062445, now seen corresponding path program 2 times [2019-12-27 23:01:16,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:01:16,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265118730] [2019-12-27 23:01:16,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:01:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:01:16,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:01:16,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265118730] [2019-12-27 23:01:16,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:01:16,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:01:16,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [512787372] [2019-12-27 23:01:16,771 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:01:16,777 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:01:16,789 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 45 states and 57 transitions. [2019-12-27 23:01:16,789 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:01:16,790 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:01:16,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 23:01:16,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:01:16,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 23:01:16,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 23:01:16,791 INFO L87 Difference]: Start difference. First operand 2192 states and 5606 transitions. Second operand 6 states. [2019-12-27 23:01:16,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:01:16,866 INFO L93 Difference]: Finished difference Result 1375 states and 3652 transitions. [2019-12-27 23:01:16,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:01:16,867 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-12-27 23:01:16,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:01:16,869 INFO L225 Difference]: With dead ends: 1375 [2019-12-27 23:01:16,869 INFO L226 Difference]: Without dead ends: 1167 [2019-12-27 23:01:16,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:01:16,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2019-12-27 23:01:16,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1167. [2019-12-27 23:01:16,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1167 states. [2019-12-27 23:01:16,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 3116 transitions. [2019-12-27 23:01:16,893 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 3116 transitions. Word has length 30 [2019-12-27 23:01:16,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:01:16,893 INFO L462 AbstractCegarLoop]: Abstraction has 1167 states and 3116 transitions. [2019-12-27 23:01:16,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 23:01:16,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 3116 transitions. [2019-12-27 23:01:16,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 23:01:16,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:01:16,897 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] [2019-12-27 23:01:16,897 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:01:16,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:01:16,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1530514123, now seen corresponding path program 1 times [2019-12-27 23:01:16,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:01:16,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895823563] [2019-12-27 23:01:16,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:01:16,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:01:16,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:01:16,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895823563] [2019-12-27 23:01:16,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:01:16,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:01:16,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1897523507] [2019-12-27 23:01:16,940 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:01:16,952 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:01:17,002 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 85 states and 121 transitions. [2019-12-27 23:01:17,002 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:01:17,009 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 23:01:17,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:01:17,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:01:17,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:01:17,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:01:17,010 INFO L87 Difference]: Start difference. First operand 1167 states and 3116 transitions. Second operand 3 states. [2019-12-27 23:01:17,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:01:17,054 INFO L93 Difference]: Finished difference Result 1365 states and 3501 transitions. [2019-12-27 23:01:17,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:01:17,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-12-27 23:01:17,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:01:17,058 INFO L225 Difference]: With dead ends: 1365 [2019-12-27 23:01:17,058 INFO L226 Difference]: Without dead ends: 1365 [2019-12-27 23:01:17,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:01:17,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2019-12-27 23:01:17,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1217. [2019-12-27 23:01:17,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-12-27 23:01:17,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 3165 transitions. [2019-12-27 23:01:17,076 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 3165 transitions. Word has length 45 [2019-12-27 23:01:17,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:01:17,077 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 3165 transitions. [2019-12-27 23:01:17,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:01:17,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 3165 transitions. [2019-12-27 23:01:17,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 23:01:17,079 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:01:17,079 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] [2019-12-27 23:01:17,080 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:01:17,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:01:17,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1335944749, now seen corresponding path program 1 times [2019-12-27 23:01:17,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:01:17,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216106765] [2019-12-27 23:01:17,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:01:17,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:01:17,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:01:17,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216106765] [2019-12-27 23:01:17,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:01:17,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 23:01:17,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [788549110] [2019-12-27 23:01:17,168 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:01:17,179 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:01:17,224 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 123 transitions. [2019-12-27 23:01:17,224 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:01:17,243 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 23:01:17,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:01:17,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:01:17,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:01:17,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:01:17,244 INFO L87 Difference]: Start difference. First operand 1217 states and 3165 transitions. Second operand 7 states. [2019-12-27 23:01:17,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:01:17,614 INFO L93 Difference]: Finished difference Result 3292 states and 8509 transitions. [2019-12-27 23:01:17,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 23:01:17,614 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-12-27 23:01:17,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:01:17,618 INFO L225 Difference]: With dead ends: 3292 [2019-12-27 23:01:17,619 INFO L226 Difference]: Without dead ends: 2192 [2019-12-27 23:01:17,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 23:01:17,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2019-12-27 23:01:17,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 1366. [2019-12-27 23:01:17,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1366 states. [2019-12-27 23:01:17,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 3532 transitions. [2019-12-27 23:01:17,647 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 3532 transitions. Word has length 45 [2019-12-27 23:01:17,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:01:17,647 INFO L462 AbstractCegarLoop]: Abstraction has 1366 states and 3532 transitions. [2019-12-27 23:01:17,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:01:17,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 3532 transitions. [2019-12-27 23:01:17,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 23:01:17,651 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:01:17,651 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] [2019-12-27 23:01:17,651 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:01:17,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:01:17,652 INFO L82 PathProgramCache]: Analyzing trace with hash 2093039597, now seen corresponding path program 2 times [2019-12-27 23:01:17,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:01:17,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898157367] [2019-12-27 23:01:17,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:01:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 23:01:17,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 23:01:17,752 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 23:01:17,752 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 23:01:17,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~x~0_11 0) (= 0 v_~__unbuffered_p0_EAX~0_13) (= 0 v_~__unbuffered_p1_EAX~0_13) (= v_~y~0_23 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$read_delayed_var~0.offset_7) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2577~0.base_27|) (= v_~y$r_buff0_thd1~0_10 0) (= v_~z~0_18 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t2577~0.base_27| 4) |v_#length_25|) (= 0 v_~y$w_buff1~0_22) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2577~0.base_27|)) (= v_~main$tmp_guard0~0_12 0) (= 0 v_~y$flush_delayed~0_14) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$r_buff0_thd2~0_67 0) (= 0 v_~y$r_buff1_thd2~0_39) (= 0 v_~y$r_buff1_thd0~0_24) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2577~0.base_27| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2577~0.base_27|) |v_ULTIMATE.start_main_~#t2577~0.offset_21| 0)) |v_#memory_int_23|) (= v_~y$r_buff0_thd0~0_22 0) (= v_~y$mem_tmp~0_11 0) (= v_~y$r_buff1_thd1~0_8 0) (= 0 v_~weak$$choice2~0_33) (= v_~y$read_delayed~0_5 0) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$w_buff0_used~0_94) (= |v_#NULL.offset_5| 0) (= 0 v_~y$w_buff0~0_27) (= v_~y$w_buff1_used~0_55 0) (= 0 |v_ULTIMATE.start_main_~#t2577~0.offset_21|) (= v_~y$r_buff0_thd3~0_27 0) (= 0 v_~__unbuffered_cnt~0_18) (= |v_#valid_60| (store .cse0 |v_ULTIMATE.start_main_~#t2577~0.base_27| 1)) (= 0 |v_#NULL.base_5|) (= 0 v_~y$r_buff1_thd3~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_8|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t2578~0.offset=|v_ULTIMATE.start_main_~#t2578~0.offset_19|, ~y$read_delayed~0=v_~y$read_delayed~0_5, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, ULTIMATE.start_main_~#t2577~0.base=|v_ULTIMATE.start_main_~#t2577~0.base_27|, #length=|v_#length_25|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_11|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|, ~y$w_buff1~0=v_~y$w_buff1~0_22, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_67, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ULTIMATE.start_main_~#t2578~0.base=|v_ULTIMATE.start_main_~#t2578~0.base_25|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_24, ~x~0=v_~x~0_11, ULTIMATE.start_main_~#t2579~0.offset=|v_ULTIMATE.start_main_~#t2579~0.offset_16|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_94, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_8, ULTIMATE.start_main_~#t2579~0.base=|v_ULTIMATE.start_main_~#t2579~0.base_21|, ~y$w_buff0~0=v_~y$w_buff0~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y~0=v_~y~0_23, ULTIMATE.start_main_~#t2577~0.offset=|v_ULTIMATE.start_main_~#t2577~0.offset_21|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_14|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_11|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_39, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_22, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_18, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_55} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t2579~0.offset, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_#t~nondet34, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t2578~0.offset, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ULTIMATE.start_main_~#t2579~0.base, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t2577~0.base, #length, ~y~0, ULTIMATE.start_main_~#t2577~0.offset, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ~y$r_buff0_thd2~0, #valid, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2578~0.base, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 23:01:17,757 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L814-1-->L816: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2578~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2578~0.base_10|) |v_ULTIMATE.start_main_~#t2578~0.offset_9| 1)) |v_#memory_int_11|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2578~0.base_10| 4) |v_#length_13|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2578~0.base_10| 1)) (= 0 |v_ULTIMATE.start_main_~#t2578~0.offset_9|) (not (= 0 |v_ULTIMATE.start_main_~#t2578~0.base_10|)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2578~0.base_10|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2578~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2578~0.offset=|v_ULTIMATE.start_main_~#t2578~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2578~0.base=|v_ULTIMATE.start_main_~#t2578~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2578~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2578~0.base] because there is no mapped edge [2019-12-27 23:01:17,758 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L816-1-->L818: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2579~0.base_11| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2579~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2579~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2579~0.base_11|) |v_ULTIMATE.start_main_~#t2579~0.offset_10| 2)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t2579~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t2579~0.base_11| 0)) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2579~0.base_11|) 0) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2579~0.base_11| 1) |v_#valid_36|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2579~0.base=|v_ULTIMATE.start_main_~#t2579~0.base_11|, ULTIMATE.start_main_~#t2579~0.offset=|v_ULTIMATE.start_main_~#t2579~0.offset_10|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_4|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2579~0.base, ULTIMATE.start_main_~#t2579~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 23:01:17,759 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [620] [620] P2ENTRY-->L4-3: Formula: (and (= 1 v_~y$w_buff0~0_14) (= v_~y$w_buff1_used~0_40 v_~y$w_buff0_used~0_67) (= v_~y$w_buff0~0_15 v_~y$w_buff1~0_13) (= 1 v_~y$w_buff0_used~0_66) (= 1 |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_4|) (= 0 (mod v_~y$w_buff1_used~0_40 256)) (= v_P2Thread1of1ForFork2_~arg.base_4 |v_P2Thread1of1ForFork2_#in~arg.base_4|) (= |v_P2Thread1of1ForFork2_#in~arg.offset_4| v_P2Thread1of1ForFork2_~arg.offset_4) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_4| v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_6)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_67, ~y$w_buff0~0=v_~y$w_buff0~0_15, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_4|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_66, ~y$w_buff1~0=v_~y$w_buff1~0_13, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_4, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_4, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_4|, ~y$w_buff0~0=v_~y$w_buff0~0_14, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_6, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_4|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_40} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression, ~y$w_buff0~0, P2Thread1of1ForFork2___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 23:01:17,760 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] P0ENTRY-->P0EXIT: Formula: (and (= 2 v_~z~0_9) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_p0_EAX~0_6 v_~x~0_6) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~x~0=v_~x~0_6} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~z~0=v_~z~0_9, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, ~x~0=v_~x~0_6, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 23:01:17,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L756-->L756-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In2126823705 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In2126823705 256)))) (or (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In2126823705 256))) (and (= (mod ~y$w_buff1_used~0_In2126823705 256) 0) .cse0) (= (mod ~y$w_buff0_used~0_In2126823705 256) 0))) (= |P1Thread1of1ForFork1_#t~ite8_Out2126823705| ~y$w_buff0~0_In2126823705) .cse1 (= |P1Thread1of1ForFork1_#t~ite8_Out2126823705| |P1Thread1of1ForFork1_#t~ite9_Out2126823705|)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite8_In2126823705| |P1Thread1of1ForFork1_#t~ite8_Out2126823705|) (= |P1Thread1of1ForFork1_#t~ite9_Out2126823705| ~y$w_buff0~0_In2126823705)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2126823705, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2126823705, ~y$w_buff0~0=~y$w_buff0~0_In2126823705, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2126823705, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In2126823705|, ~weak$$choice2~0=~weak$$choice2~0_In2126823705, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2126823705} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2126823705, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2126823705, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out2126823705|, ~y$w_buff0~0=~y$w_buff0~0_In2126823705, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2126823705, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out2126823705|, ~weak$$choice2~0=~weak$$choice2~0_In2126823705, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2126823705} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 23:01:17,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] L758-->L758-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In974339300 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite15_Out974339300| ~y$w_buff0_used~0_In974339300) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite14_In974339300| |P1Thread1of1ForFork1_#t~ite14_Out974339300|)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In974339300 256) 0))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In974339300 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In974339300 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In974339300 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite15_Out974339300| |P1Thread1of1ForFork1_#t~ite14_Out974339300|) (= ~y$w_buff0_used~0_In974339300 |P1Thread1of1ForFork1_#t~ite14_Out974339300|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In974339300, ~y$w_buff0_used~0=~y$w_buff0_used~0_In974339300, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In974339300, ~weak$$choice2~0=~weak$$choice2~0_In974339300, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In974339300|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In974339300} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In974339300, ~y$w_buff0_used~0=~y$w_buff0_used~0_In974339300, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In974339300, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out974339300|, ~weak$$choice2~0=~weak$$choice2~0_In974339300, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out974339300|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In974339300} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 23:01:17,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [625] [625] L760-->L761: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~y$r_buff0_thd2~0_43 v_~y$r_buff0_thd2~0_42)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_43, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_10|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_11|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_42, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_9|, ~weak$$choice2~0=v_~weak$$choice2~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 23:01:17,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L792-->L792-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1325692008 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1325692008 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite28_Out-1325692008| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite28_Out-1325692008| ~y$w_buff0_used~0_In-1325692008)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1325692008, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1325692008} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1325692008, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1325692008, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out-1325692008|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-27 23:01:17,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L763-->L771: Formula: (and (= v_~y~0_16 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= 0 v_~y$flush_delayed~0_7) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~y~0=v_~y~0_16, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-27 23:01:17,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L793-->L793-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In730809153 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In730809153 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In730809153 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In730809153 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite29_Out730809153| ~y$w_buff1_used~0_In730809153)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork2_#t~ite29_Out730809153| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In730809153, ~y$w_buff0_used~0=~y$w_buff0_used~0_In730809153, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In730809153, ~y$w_buff1_used~0=~y$w_buff1_used~0_In730809153} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In730809153, ~y$w_buff0_used~0=~y$w_buff0_used~0_In730809153, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In730809153, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out730809153|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In730809153} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 23:01:17,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L794-->L795: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1234230774 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1234230774 256)))) (or (and (= ~y$r_buff0_thd3~0_Out1234230774 ~y$r_buff0_thd3~0_In1234230774) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out1234230774)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1234230774, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1234230774} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1234230774, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out1234230774|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1234230774} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 23:01:17,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L795-->L795-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-920101366 256))) (.cse3 (= (mod ~y$r_buff0_thd3~0_In-920101366 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-920101366 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-920101366 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite31_Out-920101366|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite31_Out-920101366| ~y$r_buff1_thd3~0_In-920101366)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-920101366, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-920101366, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-920101366, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-920101366} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-920101366, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-920101366, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out-920101366|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-920101366, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-920101366} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 23:01:17,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L795-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite31_8| v_~y$r_buff1_thd3~0_13) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_13, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_7|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 23:01:17,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L822-->L824-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= (mod v_~y$w_buff0_used~0_72 256) 0) (= (mod v_~y$r_buff0_thd0~0_15 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_72, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_72, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 23:01:17,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L824-2-->L824-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-993017127 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-993017127 256) 0))) (or (and (= ~y~0_In-993017127 |ULTIMATE.start_main_#t~ite35_Out-993017127|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite35_Out-993017127| ~y$w_buff1~0_In-993017127)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-993017127, ~y~0=~y~0_In-993017127, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-993017127, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-993017127} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-993017127, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-993017127|, ~y~0=~y~0_In-993017127, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-993017127, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-993017127} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-27 23:01:17,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [617] [617] L824-4-->L825: Formula: (= v_~y~0_13 |v_ULTIMATE.start_main_#t~ite35_8|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_8|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_7|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_7|, ~y~0=v_~y~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-27 23:01:17,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L825-->L825-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-2118544688 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-2118544688 256) 0))) (or (and (= ~y$w_buff0_used~0_In-2118544688 |ULTIMATE.start_main_#t~ite37_Out-2118544688|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite37_Out-2118544688|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2118544688, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2118544688} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2118544688, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2118544688, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-2118544688|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 23:01:17,776 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L826-->L826-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd0~0_In-158026372 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-158026372 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-158026372 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-158026372 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-158026372 |ULTIMATE.start_main_#t~ite38_Out-158026372|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite38_Out-158026372| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-158026372, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-158026372, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-158026372, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-158026372} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-158026372, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-158026372, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-158026372|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-158026372, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-158026372} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 23:01:17,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L827-->L827-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1006918166 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1006918166 256) 0))) (or (and (= ~y$r_buff0_thd0~0_In1006918166 |ULTIMATE.start_main_#t~ite39_Out1006918166|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite39_Out1006918166|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1006918166, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1006918166} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1006918166, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1006918166|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1006918166} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 23:01:17,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L828-->L828-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In22783731 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In22783731 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In22783731 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In22783731 256)))) (or (and (= ~y$r_buff1_thd0~0_In22783731 |ULTIMATE.start_main_#t~ite40_Out22783731|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite40_Out22783731|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In22783731, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In22783731, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In22783731, ~y$w_buff1_used~0=~y$w_buff1_used~0_In22783731} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out22783731|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In22783731, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In22783731, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In22783731, ~y$w_buff1_used~0=~y$w_buff1_used~0_In22783731} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 23:01:17,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L828-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p0_EAX~0_8 0) (= v_~z~0_11 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= 0 v_~__unbuffered_p1_EAX~0_8) (= |v_ULTIMATE.start_main_#t~ite40_13| v_~y$r_buff1_thd0~0_16) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z~0=v_~z~0_11} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z~0=v_~z~0_11, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 23:01:17,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 11:01:17 BasicIcfg [2019-12-27 23:01:17,844 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 23:01:17,845 INFO L168 Benchmark]: Toolchain (without parser) took 18330.92 ms. Allocated memory was 145.8 MB in the beginning and 929.0 MB in the end (delta: 783.3 MB). Free memory was 102.2 MB in the beginning and 595.7 MB in the end (delta: -493.4 MB). Peak memory consumption was 289.8 MB. Max. memory is 7.1 GB. [2019-12-27 23:01:17,848 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 23:01:17,851 INFO L168 Benchmark]: CACSL2BoogieTranslator took 745.46 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.8 MB in the beginning and 156.9 MB in the end (delta: -55.2 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-27 23:01:17,852 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.56 ms. Allocated memory is still 202.9 MB. Free memory was 156.9 MB in the beginning and 154.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 23:01:17,852 INFO L168 Benchmark]: Boogie Preprocessor took 42.45 ms. Allocated memory is still 202.9 MB. Free memory was 154.3 MB in the beginning and 152.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 23:01:17,855 INFO L168 Benchmark]: RCFGBuilder took 758.54 ms. Allocated memory is still 202.9 MB. Free memory was 152.3 MB in the beginning and 109.5 MB in the end (delta: 42.8 MB). Peak memory consumption was 42.8 MB. Max. memory is 7.1 GB. [2019-12-27 23:01:17,856 INFO L168 Benchmark]: TraceAbstraction took 16716.91 ms. Allocated memory was 202.9 MB in the beginning and 929.0 MB in the end (delta: 726.1 MB). Free memory was 108.9 MB in the beginning and 595.7 MB in the end (delta: -486.8 MB). Peak memory consumption was 239.3 MB. Max. memory is 7.1 GB. [2019-12-27 23:01:17,865 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.52 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 745.46 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.8 MB in the beginning and 156.9 MB in the end (delta: -55.2 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.56 ms. Allocated memory is still 202.9 MB. Free memory was 156.9 MB in the beginning and 154.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.45 ms. Allocated memory is still 202.9 MB. Free memory was 154.3 MB in the beginning and 152.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 758.54 ms. Allocated memory is still 202.9 MB. Free memory was 152.3 MB in the beginning and 109.5 MB in the end (delta: 42.8 MB). Peak memory consumption was 42.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16716.91 ms. Allocated memory was 202.9 MB in the beginning and 929.0 MB in the end (delta: 726.1 MB). Free memory was 108.9 MB in the beginning and 595.7 MB in the end (delta: -486.8 MB). Peak memory consumption was 239.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 151 ProgramPointsBefore, 74 ProgramPointsAfterwards, 176 TransitionsBefore, 83 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 20 ChoiceCompositions, 4568 VarBasedMoverChecksPositive, 135 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 48572 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L814] FCALL, FORK 0 pthread_create(&t2577, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t2578, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t2579, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 [L788] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L746] 2 x = 1 [L751] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 2 y$flush_delayed = weak$$choice2 [L754] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L756] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L757] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L758] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L759] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L761] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L761] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.4s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1362 SDtfs, 1458 SDslu, 2845 SDs, 0 SdLazy, 1168 SolverSat, 107 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21030occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 8612 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 345 NumberOfCodeBlocks, 345 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 288 ConstructedInterpolants, 0 QuantifiedInterpolants, 21772 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...