./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix019_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix019_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1a197bd9b18e7b2017ef5dcfa1f785f07ddae6b8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 18:06:33,182 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:06:33,185 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:06:33,197 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:06:33,198 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:06:33,199 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:06:33,201 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:06:33,203 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:06:33,205 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:06:33,206 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:06:33,207 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:06:33,208 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:06:33,209 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:06:33,210 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:06:33,211 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:06:33,212 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:06:33,213 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:06:33,214 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:06:33,216 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:06:33,220 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:06:33,225 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:06:33,226 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:06:33,230 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:06:33,231 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:06:33,233 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:06:33,234 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:06:33,234 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:06:33,235 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:06:33,235 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:06:33,237 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:06:33,237 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:06:33,238 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:06:33,239 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:06:33,240 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:06:33,241 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:06:33,241 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:06:33,242 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:06:33,242 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:06:33,243 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:06:33,244 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:06:33,245 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:06:33,245 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 18:06:33,265 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:06:33,265 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:06:33,267 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:06:33,267 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:06:33,267 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:06:33,268 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:06:33,268 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:06:33,268 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:06:33,268 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:06:33,269 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:06:33,269 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:06:33,269 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:06:33,269 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:06:33,270 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:06:33,270 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:06:33,270 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:06:33,270 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:06:33,271 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:06:33,271 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:06:33,271 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:06:33,272 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:06:33,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:06:33,272 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:06:33,272 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:06:33,273 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:06:33,273 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:06:33,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:06:33,274 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:06:33,274 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:06:33,274 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1a197bd9b18e7b2017ef5dcfa1f785f07ddae6b8 [2019-11-28 18:06:33,576 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:06:33,599 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:06:33,602 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:06:33,604 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:06:33,604 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:06:33,605 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix019_rmo.opt.i [2019-11-28 18:06:33,682 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a4584e16/3f4c42dc4af04cbb884f24fa38310210/FLAG1694d1016 [2019-11-28 18:06:34,237 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:06:34,237 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix019_rmo.opt.i [2019-11-28 18:06:34,261 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a4584e16/3f4c42dc4af04cbb884f24fa38310210/FLAG1694d1016 [2019-11-28 18:06:34,560 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a4584e16/3f4c42dc4af04cbb884f24fa38310210 [2019-11-28 18:06:34,564 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:06:34,566 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:06:34,567 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:06:34,568 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:06:34,571 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:06:34,572 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:06:34" (1/1) ... [2019-11-28 18:06:34,575 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6822e6d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:06:34, skipping insertion in model container [2019-11-28 18:06:34,576 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:06:34" (1/1) ... [2019-11-28 18:06:34,584 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:06:34,642 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:06:35,128 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:06:35,151 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:06:35,226 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:06:35,316 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:06:35,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:06:35 WrapperNode [2019-11-28 18:06:35,317 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:06:35,318 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:06:35,318 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:06:35,318 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:06:35,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:06:35" (1/1) ... [2019-11-28 18:06:35,364 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:06:35" (1/1) ... [2019-11-28 18:06:35,406 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:06:35,407 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:06:35,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:06:35,410 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:06:35,419 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:06:35" (1/1) ... [2019-11-28 18:06:35,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:06:35" (1/1) ... [2019-11-28 18:06:35,424 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:06:35" (1/1) ... [2019-11-28 18:06:35,425 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:06:35" (1/1) ... [2019-11-28 18:06:35,436 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:06:35" (1/1) ... [2019-11-28 18:06:35,441 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:06:35" (1/1) ... [2019-11-28 18:06:35,445 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:06:35" (1/1) ... [2019-11-28 18:06:35,451 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:06:35,452 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:06:35,452 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:06:35,452 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:06:35,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:06:35" (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-11-28 18:06:35,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:06:35,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:06:35,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:06:35,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:06:35,530 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:06:35,530 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:06:35,531 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:06:35,531 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:06:35,531 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-11-28 18:06:35,531 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-11-28 18:06:35,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:06:35,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:06:35,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:06:35,534 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-28 18:06:36,364 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:06:36,365 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:06:36,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:06:36 BoogieIcfgContainer [2019-11-28 18:06:36,367 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:06:36,368 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:06:36,368 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:06:36,372 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:06:36,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:06:34" (1/3) ... [2019-11-28 18:06:36,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53c4eec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:06:36, skipping insertion in model container [2019-11-28 18:06:36,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:06:35" (2/3) ... [2019-11-28 18:06:36,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53c4eec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:06:36, skipping insertion in model container [2019-11-28 18:06:36,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:06:36" (3/3) ... [2019-11-28 18:06:36,376 INFO L109 eAbstractionObserver]: Analyzing ICFG mix019_rmo.opt.i [2019-11-28 18:06:36,387 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:06:36,387 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:06:36,394 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:06:36,395 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:06:36,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,440 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,441 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,444 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,444 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,468 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,468 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,469 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,469 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,469 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:06:36,520 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-28 18:06:36,541 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:06:36,541 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:06:36,542 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:06:36,542 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:06:36,542 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:06:36,542 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:06:36,542 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:06:36,542 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:06:36,561 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 194 places, 240 transitions [2019-11-28 18:06:36,564 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 194 places, 240 transitions [2019-11-28 18:06:36,680 INFO L134 PetriNetUnfolder]: 56/237 cut-off events. [2019-11-28 18:06:36,681 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:06:36,705 INFO L76 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 237 events. 56/237 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 915 event pairs. 9/188 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-11-28 18:06:36,743 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 194 places, 240 transitions [2019-11-28 18:06:36,812 INFO L134 PetriNetUnfolder]: 56/237 cut-off events. [2019-11-28 18:06:36,812 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:06:36,826 INFO L76 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 237 events. 56/237 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 915 event pairs. 9/188 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-11-28 18:06:36,865 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-11-28 18:06:36,866 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:06:42,268 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-11-28 18:06:42,404 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-28 18:06:42,552 INFO L206 etLargeBlockEncoding]: Checked pairs total: 128329 [2019-11-28 18:06:42,552 INFO L214 etLargeBlockEncoding]: Total number of compositions: 122 [2019-11-28 18:06:42,556 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 109 places, 131 transitions [2019-11-28 18:06:47,171 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 48994 states. [2019-11-28 18:06:47,173 INFO L276 IsEmpty]: Start isEmpty. Operand 48994 states. [2019-11-28 18:06:47,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 18:06:47,180 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:06:47,181 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:06:47,182 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-11-28 18:06:47,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:06:47,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1376992094, now seen corresponding path program 1 times [2019-11-28 18:06:47,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:06:47,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343215437] [2019-11-28 18:06:47,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:06:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:06:47,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:06:47,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343215437] [2019-11-28 18:06:47,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:06:47,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:06:47,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963548644] [2019-11-28 18:06:47,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:06:47,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:06:47,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:06:47,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:06:47,539 INFO L87 Difference]: Start difference. First operand 48994 states. Second operand 3 states. [2019-11-28 18:06:48,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:06:48,342 INFO L93 Difference]: Finished difference Result 48562 states and 198786 transitions. [2019-11-28 18:06:48,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:06:48,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-28 18:06:48,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:06:49,116 INFO L225 Difference]: With dead ends: 48562 [2019-11-28 18:06:49,116 INFO L226 Difference]: Without dead ends: 45454 [2019-11-28 18:06:49,124 INFO L630 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-11-28 18:06:50,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45454 states. [2019-11-28 18:06:51,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45454 to 45454. [2019-11-28 18:06:51,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45454 states. [2019-11-28 18:06:51,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45454 states to 45454 states and 185938 transitions. [2019-11-28 18:06:51,749 INFO L78 Accepts]: Start accepts. Automaton has 45454 states and 185938 transitions. Word has length 7 [2019-11-28 18:06:51,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:06:51,751 INFO L462 AbstractCegarLoop]: Abstraction has 45454 states and 185938 transitions. [2019-11-28 18:06:51,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:06:51,751 INFO L276 IsEmpty]: Start isEmpty. Operand 45454 states and 185938 transitions. [2019-11-28 18:06:51,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 18:06:51,757 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:06:51,757 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:06:51,757 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-11-28 18:06:51,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:06:51,758 INFO L82 PathProgramCache]: Analyzing trace with hash -694250741, now seen corresponding path program 1 times [2019-11-28 18:06:51,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:06:51,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876669065] [2019-11-28 18:06:51,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:06:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:06:51,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:06:51,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876669065] [2019-11-28 18:06:51,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:06:51,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:06:51,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158852970] [2019-11-28 18:06:51,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:06:51,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:06:51,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:06:51,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:06:51,874 INFO L87 Difference]: Start difference. First operand 45454 states and 185938 transitions. Second operand 3 states. [2019-11-28 18:06:52,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:06:52,065 INFO L93 Difference]: Finished difference Result 25433 states and 91101 transitions. [2019-11-28 18:06:52,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:06:52,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-28 18:06:52,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:06:52,278 INFO L225 Difference]: With dead ends: 25433 [2019-11-28 18:06:52,279 INFO L226 Difference]: Without dead ends: 25433 [2019-11-28 18:06:52,280 INFO L630 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-11-28 18:06:52,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25433 states. [2019-11-28 18:06:53,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25433 to 25433. [2019-11-28 18:06:53,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25433 states. [2019-11-28 18:06:53,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25433 states to 25433 states and 91101 transitions. [2019-11-28 18:06:53,247 INFO L78 Accepts]: Start accepts. Automaton has 25433 states and 91101 transitions. Word has length 13 [2019-11-28 18:06:53,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:06:53,248 INFO L462 AbstractCegarLoop]: Abstraction has 25433 states and 91101 transitions. [2019-11-28 18:06:53,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:06:53,248 INFO L276 IsEmpty]: Start isEmpty. Operand 25433 states and 91101 transitions. [2019-11-28 18:06:53,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:06:53,251 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:06:53,251 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:06:53,252 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-11-28 18:06:53,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:06:53,252 INFO L82 PathProgramCache]: Analyzing trace with hash 374920656, now seen corresponding path program 1 times [2019-11-28 18:06:53,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:06:53,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133269417] [2019-11-28 18:06:53,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:06:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:06:53,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:06:53,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133269417] [2019-11-28 18:06:53,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:06:53,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:06:53,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319250465] [2019-11-28 18:06:53,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:06:53,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:06:53,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:06:53,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:06:53,322 INFO L87 Difference]: Start difference. First operand 25433 states and 91101 transitions. Second operand 4 states. [2019-11-28 18:06:53,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:06:53,377 INFO L93 Difference]: Finished difference Result 4383 states and 12782 transitions. [2019-11-28 18:06:53,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:06:53,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:06:53,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:06:53,385 INFO L225 Difference]: With dead ends: 4383 [2019-11-28 18:06:53,385 INFO L226 Difference]: Without dead ends: 4383 [2019-11-28 18:06:53,386 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:06:53,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4383 states. [2019-11-28 18:06:53,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4383 to 4383. [2019-11-28 18:06:53,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4383 states. [2019-11-28 18:06:53,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4383 states to 4383 states and 12782 transitions. [2019-11-28 18:06:53,504 INFO L78 Accepts]: Start accepts. Automaton has 4383 states and 12782 transitions. Word has length 14 [2019-11-28 18:06:53,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:06:53,505 INFO L462 AbstractCegarLoop]: Abstraction has 4383 states and 12782 transitions. [2019-11-28 18:06:53,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:06:53,505 INFO L276 IsEmpty]: Start isEmpty. Operand 4383 states and 12782 transitions. [2019-11-28 18:06:53,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:06:53,507 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:06:53,508 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:06:53,508 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-11-28 18:06:53,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:06:53,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1574256306, now seen corresponding path program 1 times [2019-11-28 18:06:53,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:06:53,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271793501] [2019-11-28 18:06:53,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:06:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:06:53,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:06:53,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271793501] [2019-11-28 18:06:53,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:06:53,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:06:53,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726044400] [2019-11-28 18:06:53,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:06:53,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:06:53,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:06:53,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:06:53,600 INFO L87 Difference]: Start difference. First operand 4383 states and 12782 transitions. Second operand 4 states. [2019-11-28 18:06:53,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:06:53,959 INFO L93 Difference]: Finished difference Result 5886 states and 16737 transitions. [2019-11-28 18:06:53,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:06:53,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-28 18:06:53,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:06:53,970 INFO L225 Difference]: With dead ends: 5886 [2019-11-28 18:06:53,970 INFO L226 Difference]: Without dead ends: 5886 [2019-11-28 18:06:53,971 INFO L630 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-11-28 18:06:53,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5886 states. [2019-11-28 18:06:54,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5886 to 5774. [2019-11-28 18:06:54,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5774 states. [2019-11-28 18:06:54,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5774 states to 5774 states and 16530 transitions. [2019-11-28 18:06:54,320 INFO L78 Accepts]: Start accepts. Automaton has 5774 states and 16530 transitions. Word has length 16 [2019-11-28 18:06:54,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:06:54,320 INFO L462 AbstractCegarLoop]: Abstraction has 5774 states and 16530 transitions. [2019-11-28 18:06:54,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:06:54,321 INFO L276 IsEmpty]: Start isEmpty. Operand 5774 states and 16530 transitions. [2019-11-28 18:06:54,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 18:06:54,331 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:06:54,331 INFO L410 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] [2019-11-28 18:06:54,331 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-11-28 18:06:54,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:06:54,332 INFO L82 PathProgramCache]: Analyzing trace with hash 664454488, now seen corresponding path program 1 times [2019-11-28 18:06:54,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:06:54,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021853308] [2019-11-28 18:06:54,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:06:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:06:54,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:06:54,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021853308] [2019-11-28 18:06:54,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:06:54,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:06:54,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687718984] [2019-11-28 18:06:54,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:06:54,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:06:54,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:06:54,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:06:54,462 INFO L87 Difference]: Start difference. First operand 5774 states and 16530 transitions. Second operand 5 states. [2019-11-28 18:06:54,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:06:54,514 INFO L93 Difference]: Finished difference Result 4460 states and 13372 transitions. [2019-11-28 18:06:54,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:06:54,515 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 18:06:54,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:06:54,525 INFO L225 Difference]: With dead ends: 4460 [2019-11-28 18:06:54,525 INFO L226 Difference]: Without dead ends: 4460 [2019-11-28 18:06:54,525 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:06:54,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4460 states. [2019-11-28 18:06:54,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4460 to 4390. [2019-11-28 18:06:54,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4390 states. [2019-11-28 18:06:54,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4390 states to 4390 states and 13211 transitions. [2019-11-28 18:06:54,626 INFO L78 Accepts]: Start accepts. Automaton has 4390 states and 13211 transitions. Word has length 31 [2019-11-28 18:06:54,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:06:54,627 INFO L462 AbstractCegarLoop]: Abstraction has 4390 states and 13211 transitions. [2019-11-28 18:06:54,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:06:54,627 INFO L276 IsEmpty]: Start isEmpty. Operand 4390 states and 13211 transitions. [2019-11-28 18:06:54,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-28 18:06:54,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:06:54,643 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:06:54,644 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-11-28 18:06:54,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:06:54,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1447079527, now seen corresponding path program 1 times [2019-11-28 18:06:54,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:06:54,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724712539] [2019-11-28 18:06:54,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:06:54,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:06:54,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:06:54,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724712539] [2019-11-28 18:06:54,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:06:54,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:06:54,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109438799] [2019-11-28 18:06:54,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:06:54,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:06:54,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:06:54,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:06:54,940 INFO L87 Difference]: Start difference. First operand 4390 states and 13211 transitions. Second operand 7 states. [2019-11-28 18:06:55,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:06:55,286 INFO L93 Difference]: Finished difference Result 11585 states and 33915 transitions. [2019-11-28 18:06:55,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 18:06:55,286 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2019-11-28 18:06:55,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:06:55,305 INFO L225 Difference]: With dead ends: 11585 [2019-11-28 18:06:55,306 INFO L226 Difference]: Without dead ends: 9053 [2019-11-28 18:06:55,308 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-11-28 18:06:55,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9053 states. [2019-11-28 18:06:55,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9053 to 6939. [2019-11-28 18:06:55,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6939 states. [2019-11-28 18:06:55,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6939 states to 6939 states and 21309 transitions. [2019-11-28 18:06:55,462 INFO L78 Accepts]: Start accepts. Automaton has 6939 states and 21309 transitions. Word has length 61 [2019-11-28 18:06:55,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:06:55,463 INFO L462 AbstractCegarLoop]: Abstraction has 6939 states and 21309 transitions. [2019-11-28 18:06:55,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:06:55,463 INFO L276 IsEmpty]: Start isEmpty. Operand 6939 states and 21309 transitions. [2019-11-28 18:06:55,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-28 18:06:55,484 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:06:55,485 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:06:55,485 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-11-28 18:06:55,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:06:55,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1607619225, now seen corresponding path program 2 times [2019-11-28 18:06:55,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:06:55,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878763005] [2019-11-28 18:06:55,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:06:55,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:06:55,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:06:55,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878763005] [2019-11-28 18:06:55,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:06:55,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:06:55,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501323084] [2019-11-28 18:06:55,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:06:55,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:06:55,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:06:55,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:06:55,601 INFO L87 Difference]: Start difference. First operand 6939 states and 21309 transitions. Second operand 5 states. [2019-11-28 18:06:56,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:06:56,019 INFO L93 Difference]: Finished difference Result 7606 states and 22996 transitions. [2019-11-28 18:06:56,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:06:56,019 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-11-28 18:06:56,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:06:56,031 INFO L225 Difference]: With dead ends: 7606 [2019-11-28 18:06:56,031 INFO L226 Difference]: Without dead ends: 7606 [2019-11-28 18:06:56,032 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:06:56,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2019-11-28 18:06:56,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7384. [2019-11-28 18:06:56,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7384 states. [2019-11-28 18:06:56,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7384 states to 7384 states and 22463 transitions. [2019-11-28 18:06:56,142 INFO L78 Accepts]: Start accepts. Automaton has 7384 states and 22463 transitions. Word has length 61 [2019-11-28 18:06:56,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:06:56,142 INFO L462 AbstractCegarLoop]: Abstraction has 7384 states and 22463 transitions. [2019-11-28 18:06:56,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:06:56,143 INFO L276 IsEmpty]: Start isEmpty. Operand 7384 states and 22463 transitions. [2019-11-28 18:06:56,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-28 18:06:56,159 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:06:56,159 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:06:56,159 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-11-28 18:06:56,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:06:56,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1470343061, now seen corresponding path program 1 times [2019-11-28 18:06:56,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:06:56,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921700345] [2019-11-28 18:06:56,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:06:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:06:56,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:06:56,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921700345] [2019-11-28 18:06:56,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:06:56,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:06:56,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193294432] [2019-11-28 18:06:56,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:06:56,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:06:56,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:06:56,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:06:56,350 INFO L87 Difference]: Start difference. First operand 7384 states and 22463 transitions. Second operand 4 states. [2019-11-28 18:06:56,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:06:56,403 INFO L93 Difference]: Finished difference Result 11034 states and 31785 transitions. [2019-11-28 18:06:56,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:06:56,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-28 18:06:56,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:06:56,409 INFO L225 Difference]: With dead ends: 11034 [2019-11-28 18:06:56,409 INFO L226 Difference]: Without dead ends: 3813 [2019-11-28 18:06:56,410 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:06:56,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3813 states. [2019-11-28 18:06:56,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3813 to 3813. [2019-11-28 18:06:56,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3813 states. [2019-11-28 18:06:56,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3813 states to 3813 states and 9685 transitions. [2019-11-28 18:06:56,462 INFO L78 Accepts]: Start accepts. Automaton has 3813 states and 9685 transitions. Word has length 62 [2019-11-28 18:06:56,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:06:56,463 INFO L462 AbstractCegarLoop]: Abstraction has 3813 states and 9685 transitions. [2019-11-28 18:06:56,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:06:56,463 INFO L276 IsEmpty]: Start isEmpty. Operand 3813 states and 9685 transitions. [2019-11-28 18:06:56,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-28 18:06:56,471 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:06:56,471 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:06:56,471 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-11-28 18:06:56,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:06:56,472 INFO L82 PathProgramCache]: Analyzing trace with hash 489233363, now seen corresponding path program 2 times [2019-11-28 18:06:56,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:06:56,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441251654] [2019-11-28 18:06:56,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:06:56,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:06:56,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:06:56,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441251654] [2019-11-28 18:06:56,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:06:56,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 18:06:56,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295128379] [2019-11-28 18:06:56,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 18:06:56,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:06:56,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 18:06:56,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:06:56,811 INFO L87 Difference]: Start difference. First operand 3813 states and 9685 transitions. Second operand 9 states. [2019-11-28 18:06:58,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:06:58,086 INFO L93 Difference]: Finished difference Result 8862 states and 22133 transitions. [2019-11-28 18:06:58,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 18:06:58,087 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2019-11-28 18:06:58,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:06:58,101 INFO L225 Difference]: With dead ends: 8862 [2019-11-28 18:06:58,102 INFO L226 Difference]: Without dead ends: 8668 [2019-11-28 18:06:58,102 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-11-28 18:06:58,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8668 states. [2019-11-28 18:06:58,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8668 to 6047. [2019-11-28 18:06:58,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6047 states. [2019-11-28 18:06:58,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6047 states to 6047 states and 15694 transitions. [2019-11-28 18:06:58,209 INFO L78 Accepts]: Start accepts. Automaton has 6047 states and 15694 transitions. Word has length 62 [2019-11-28 18:06:58,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:06:58,210 INFO L462 AbstractCegarLoop]: Abstraction has 6047 states and 15694 transitions. [2019-11-28 18:06:58,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 18:06:58,210 INFO L276 IsEmpty]: Start isEmpty. Operand 6047 states and 15694 transitions. [2019-11-28 18:06:58,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-28 18:06:58,221 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:06:58,221 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:06:58,221 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-11-28 18:06:58,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:06:58,221 INFO L82 PathProgramCache]: Analyzing trace with hash 212897224, now seen corresponding path program 1 times [2019-11-28 18:06:58,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:06:58,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241530738] [2019-11-28 18:06:58,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:06:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:06:58,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:06:58,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241530738] [2019-11-28 18:06:58,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:06:58,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:06:58,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598901844] [2019-11-28 18:06:58,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:06:58,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:06:58,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:06:58,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:06:58,296 INFO L87 Difference]: Start difference. First operand 6047 states and 15694 transitions. Second operand 3 states. [2019-11-28 18:06:58,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:06:58,330 INFO L93 Difference]: Finished difference Result 6046 states and 15692 transitions. [2019-11-28 18:06:58,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:06:58,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-11-28 18:06:58,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:06:58,340 INFO L225 Difference]: With dead ends: 6046 [2019-11-28 18:06:58,340 INFO L226 Difference]: Without dead ends: 6046 [2019-11-28 18:06:58,341 INFO L630 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-11-28 18:06:58,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6046 states. [2019-11-28 18:06:58,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6046 to 5864. [2019-11-28 18:06:58,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5864 states. [2019-11-28 18:06:58,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5864 states to 5864 states and 15310 transitions. [2019-11-28 18:06:58,595 INFO L78 Accepts]: Start accepts. Automaton has 5864 states and 15310 transitions. Word has length 62 [2019-11-28 18:06:58,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:06:58,595 INFO L462 AbstractCegarLoop]: Abstraction has 5864 states and 15310 transitions. [2019-11-28 18:06:58,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:06:58,596 INFO L276 IsEmpty]: Start isEmpty. Operand 5864 states and 15310 transitions. [2019-11-28 18:06:58,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-28 18:06:58,603 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:06:58,603 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:06:58,604 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-11-28 18:06:58,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:06:58,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1102174859, now seen corresponding path program 3 times [2019-11-28 18:06:58,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:06:58,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365680351] [2019-11-28 18:06:58,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:06:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:06:58,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:06:58,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365680351] [2019-11-28 18:06:58,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:06:58,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:06:58,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635795488] [2019-11-28 18:06:58,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:06:58,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:06:58,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:06:58,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:06:58,709 INFO L87 Difference]: Start difference. First operand 5864 states and 15310 transitions. Second operand 4 states. [2019-11-28 18:06:58,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:06:58,774 INFO L93 Difference]: Finished difference Result 6547 states and 16849 transitions. [2019-11-28 18:06:58,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:06:58,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-28 18:06:58,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:06:58,782 INFO L225 Difference]: With dead ends: 6547 [2019-11-28 18:06:58,783 INFO L226 Difference]: Without dead ends: 4430 [2019-11-28 18:06:58,783 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:06:58,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4430 states. [2019-11-28 18:06:58,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4430 to 3710. [2019-11-28 18:06:58,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2019-11-28 18:06:58,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 9395 transitions. [2019-11-28 18:06:58,856 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 9395 transitions. Word has length 62 [2019-11-28 18:06:58,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:06:58,857 INFO L462 AbstractCegarLoop]: Abstraction has 3710 states and 9395 transitions. [2019-11-28 18:06:58,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:06:58,857 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 9395 transitions. [2019-11-28 18:06:58,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-28 18:06:58,864 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:06:58,865 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:06:58,865 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-11-28 18:06:58,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:06:58,866 INFO L82 PathProgramCache]: Analyzing trace with hash -868907990, now seen corresponding path program 1 times [2019-11-28 18:06:58,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:06:58,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152746587] [2019-11-28 18:06:58,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:06:58,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:06:59,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:06:59,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152746587] [2019-11-28 18:06:59,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:06:59,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 18:06:59,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956797299] [2019-11-28 18:06:59,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 18:06:59,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:06:59,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 18:06:59,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-28 18:06:59,164 INFO L87 Difference]: Start difference. First operand 3710 states and 9395 transitions. Second operand 10 states. [2019-11-28 18:06:59,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:06:59,763 INFO L93 Difference]: Finished difference Result 7026 states and 17880 transitions. [2019-11-28 18:06:59,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 18:06:59,764 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2019-11-28 18:06:59,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:06:59,770 INFO L225 Difference]: With dead ends: 7026 [2019-11-28 18:06:59,771 INFO L226 Difference]: Without dead ends: 4790 [2019-11-28 18:06:59,771 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-11-28 18:06:59,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4790 states. [2019-11-28 18:06:59,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4790 to 3715. [2019-11-28 18:06:59,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3715 states. [2019-11-28 18:06:59,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3715 states to 3715 states and 9342 transitions. [2019-11-28 18:06:59,820 INFO L78 Accepts]: Start accepts. Automaton has 3715 states and 9342 transitions. Word has length 63 [2019-11-28 18:06:59,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:06:59,820 INFO L462 AbstractCegarLoop]: Abstraction has 3715 states and 9342 transitions. [2019-11-28 18:06:59,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 18:06:59,820 INFO L276 IsEmpty]: Start isEmpty. Operand 3715 states and 9342 transitions. [2019-11-28 18:06:59,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-28 18:06:59,825 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:06:59,825 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:06:59,826 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-11-28 18:06:59,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:06:59,826 INFO L82 PathProgramCache]: Analyzing trace with hash 299542938, now seen corresponding path program 2 times [2019-11-28 18:06:59,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:06:59,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165103465] [2019-11-28 18:06:59,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:06:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:06:59,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:06:59,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165103465] [2019-11-28 18:06:59,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:06:59,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:06:59,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126973294] [2019-11-28 18:06:59,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:06:59,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:06:59,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:06:59,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:06:59,978 INFO L87 Difference]: Start difference. First operand 3715 states and 9342 transitions. Second operand 4 states. [2019-11-28 18:07:00,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:07:00,208 INFO L93 Difference]: Finished difference Result 3294 states and 8139 transitions. [2019-11-28 18:07:00,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:07:00,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-11-28 18:07:00,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:07:00,212 INFO L225 Difference]: With dead ends: 3294 [2019-11-28 18:07:00,212 INFO L226 Difference]: Without dead ends: 3294 [2019-11-28 18:07:00,213 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:07:00,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3294 states. [2019-11-28 18:07:00,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3294 to 3272. [2019-11-28 18:07:00,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3272 states. [2019-11-28 18:07:00,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3272 states to 3272 states and 8087 transitions. [2019-11-28 18:07:00,254 INFO L78 Accepts]: Start accepts. Automaton has 3272 states and 8087 transitions. Word has length 63 [2019-11-28 18:07:00,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:07:00,254 INFO L462 AbstractCegarLoop]: Abstraction has 3272 states and 8087 transitions. [2019-11-28 18:07:00,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:07:00,255 INFO L276 IsEmpty]: Start isEmpty. Operand 3272 states and 8087 transitions. [2019-11-28 18:07:00,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-28 18:07:00,261 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:07:00,262 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:07:00,262 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:07:00,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:07:00,262 INFO L82 PathProgramCache]: Analyzing trace with hash 607852454, now seen corresponding path program 3 times [2019-11-28 18:07:00,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:07:00,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812639192] [2019-11-28 18:07:00,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:07:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:07:00,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:07:00,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812639192] [2019-11-28 18:07:00,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:07:00,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:07:00,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430935994] [2019-11-28 18:07:00,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:07:00,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:07:00,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:07:00,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:07:00,345 INFO L87 Difference]: Start difference. First operand 3272 states and 8087 transitions. Second operand 4 states. [2019-11-28 18:07:00,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:07:00,565 INFO L93 Difference]: Finished difference Result 3298 states and 8066 transitions. [2019-11-28 18:07:00,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:07:00,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-11-28 18:07:00,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:07:00,571 INFO L225 Difference]: With dead ends: 3298 [2019-11-28 18:07:00,571 INFO L226 Difference]: Without dead ends: 3298 [2019-11-28 18:07:00,571 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:07:00,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3298 states. [2019-11-28 18:07:00,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3298 to 3276. [2019-11-28 18:07:00,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3276 states. [2019-11-28 18:07:00,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3276 states to 3276 states and 8020 transitions. [2019-11-28 18:07:00,606 INFO L78 Accepts]: Start accepts. Automaton has 3276 states and 8020 transitions. Word has length 63 [2019-11-28 18:07:00,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:07:00,606 INFO L462 AbstractCegarLoop]: Abstraction has 3276 states and 8020 transitions. [2019-11-28 18:07:00,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:07:00,606 INFO L276 IsEmpty]: Start isEmpty. Operand 3276 states and 8020 transitions. [2019-11-28 18:07:00,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-28 18:07:00,611 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:07:00,611 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:07:00,611 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:07:00,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:07:00,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1971015750, now seen corresponding path program 1 times [2019-11-28 18:07:00,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:07:00,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560438477] [2019-11-28 18:07:00,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:07:00,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:07:00,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:07:00,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560438477] [2019-11-28 18:07:00,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:07:00,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:07:00,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969643369] [2019-11-28 18:07:00,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:07:00,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:07:00,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:07:00,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:07:00,701 INFO L87 Difference]: Start difference. First operand 3276 states and 8020 transitions. Second operand 5 states. [2019-11-28 18:07:00,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:07:00,753 INFO L93 Difference]: Finished difference Result 3976 states and 9593 transitions. [2019-11-28 18:07:00,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:07:00,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-11-28 18:07:00,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:07:00,755 INFO L225 Difference]: With dead ends: 3976 [2019-11-28 18:07:00,755 INFO L226 Difference]: Without dead ends: 761 [2019-11-28 18:07:00,756 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:07:00,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2019-11-28 18:07:00,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 756. [2019-11-28 18:07:00,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 756 states. [2019-11-28 18:07:00,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1653 transitions. [2019-11-28 18:07:00,764 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1653 transitions. Word has length 63 [2019-11-28 18:07:00,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:07:00,764 INFO L462 AbstractCegarLoop]: Abstraction has 756 states and 1653 transitions. [2019-11-28 18:07:00,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:07:00,764 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1653 transitions. [2019-11-28 18:07:00,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-28 18:07:00,766 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:07:00,766 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:07:00,766 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:07:00,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:07:00,766 INFO L82 PathProgramCache]: Analyzing trace with hash 78017404, now seen corresponding path program 2 times [2019-11-28 18:07:00,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:07:00,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573796425] [2019-11-28 18:07:00,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:07:00,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:07:00,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:07:00,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573796425] [2019-11-28 18:07:00,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:07:00,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 18:07:00,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184767439] [2019-11-28 18:07:00,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 18:07:00,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:07:00,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 18:07:00,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 18:07:00,855 INFO L87 Difference]: Start difference. First operand 756 states and 1653 transitions. Second operand 8 states. [2019-11-28 18:07:01,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:07:01,093 INFO L93 Difference]: Finished difference Result 1405 states and 3008 transitions. [2019-11-28 18:07:01,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:07:01,093 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-11-28 18:07:01,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:07:01,095 INFO L225 Difference]: With dead ends: 1405 [2019-11-28 18:07:01,095 INFO L226 Difference]: Without dead ends: 1035 [2019-11-28 18:07:01,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-11-28 18:07:01,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2019-11-28 18:07:01,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 831. [2019-11-28 18:07:01,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-11-28 18:07:01,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1783 transitions. [2019-11-28 18:07:01,110 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1783 transitions. Word has length 63 [2019-11-28 18:07:01,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:07:01,111 INFO L462 AbstractCegarLoop]: Abstraction has 831 states and 1783 transitions. [2019-11-28 18:07:01,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 18:07:01,111 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1783 transitions. [2019-11-28 18:07:01,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-28 18:07:01,113 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:07:01,113 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:07:01,113 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:07:01,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:07:01,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1479252612, now seen corresponding path program 3 times [2019-11-28 18:07:01,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:07:01,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21920077] [2019-11-28 18:07:01,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:07:01,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:07:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:07:01,263 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:07:01,264 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:07:01,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1016] [1016] ULTIMATE.startENTRY-->L828: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t512~0.base_24| 4)) (= 0 v_~y$r_buff1_thd2~0_356) (= v_~y$r_buff0_thd0~0_194 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t512~0.base_24| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t512~0.base_24|) |v_ULTIMATE.start_main_~#t512~0.offset_17| 0)) |v_#memory_int_15|) (= v_~y$r_buff1_thd1~0_192 0) (= v_~y$w_buff1_used~0_559 0) (= v_~y$r_buff0_thd1~0_121 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd3~0_350) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t512~0.base_24|)) (= v_~y~0_367 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t512~0.base_24|) (= v_~main$tmp_guard1~0_26 0) (= 0 v_~y$read_delayed_var~0.base_5) (= v_~y$w_buff1~0_262 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$r_buff1_thd0~0_244 0) (= |v_#valid_58| (store .cse0 |v_ULTIMATE.start_main_~#t512~0.base_24| 1)) (= 0 v_~__unbuffered_p1_EAX~0_43) (= v_~y$mem_tmp~0_237 0) (= 0 v_~y$read_delayed_var~0.offset_5) (= 0 v_~__unbuffered_p2_EAX~0_29) (= 0 v_~y$r_buff0_thd2~0_368) (= v_~y$w_buff0_used~0_898 0) (= v_~__unbuffered_p2_EBX~0_33 0) (= 0 v_~weak$$choice0~0_225) (= v_~y$flush_delayed~0_303 0) (= v_~z~0_25 0) (= 0 v_~y$w_buff0~0_387) (= |v_#NULL.offset_5| 0) (= |v_ULTIMATE.start_main_~#t512~0.offset_17| 0) (= v_~main$tmp_guard0~0_22 0) (= v_~x~0_65 0) (= v_~weak$$choice2~0_304 0) (= v_~__unbuffered_cnt~0_157 0) (= 0 |v_#NULL.base_5|) (= 0 v_~y$r_buff0_thd3~0_578))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t512~0.base=|v_ULTIMATE.start_main_~#t512~0.base_24|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_19|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, #NULL.offset=|v_#NULL.offset_5|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_237, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_350, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_43, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_121, ~y$flush_delayed~0=v_~y$flush_delayed~0_303, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_91|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_53|, ~weak$$choice0~0=v_~weak$$choice0~0_225, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_203|, ~y$w_buff1~0=v_~y$w_buff1~0_262, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_368, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_157, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_244, ~x~0=v_~x~0_65, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_898, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ULTIMATE.start_main_~#t512~0.offset=|v_ULTIMATE.start_main_~#t512~0.offset_17|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_192, ULTIMATE.start_main_~#t514~0.base=|v_ULTIMATE.start_main_~#t514~0.base_23|, ~y$w_buff0~0=v_~y$w_buff0~0_387, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_578, ~y~0=v_~y~0_367, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_151|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_27|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_356, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_209|, ULTIMATE.start_main_~#t514~0.offset=|v_ULTIMATE.start_main_~#t514~0.offset_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_194, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t513~0.offset=|v_ULTIMATE.start_main_~#t513~0.offset_17|, ULTIMATE.start_main_~#t513~0.base=|v_ULTIMATE.start_main_~#t513~0.base_23|, ~z~0=v_~z~0_25, ~weak$$choice2~0=v_~weak$$choice2~0_304, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_559} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t512~0.base, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, #NULL.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ULTIMATE.start_main_~#t512~0.offset, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t514~0.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t514~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_~#t513~0.offset, ULTIMATE.start_main_~#t513~0.base, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:07:01,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L828-1-->L830: Formula: (and (= |v_ULTIMATE.start_main_~#t513~0.offset_10| 0) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t513~0.base_12| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t513~0.base_12|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t513~0.base_12|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t513~0.base_12|)) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t513~0.base_12| 4) |v_#length_13|) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t513~0.base_12| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t513~0.base_12|) |v_ULTIMATE.start_main_~#t513~0.offset_10| 1)) |v_#memory_int_7|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t513~0.offset=|v_ULTIMATE.start_main_~#t513~0.offset_10|, #length=|v_#length_13|, ULTIMATE.start_main_~#t513~0.base=|v_ULTIMATE.start_main_~#t513~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t513~0.offset, #length, ULTIMATE.start_main_~#t513~0.base] because there is no mapped edge [2019-11-28 18:07:01,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L830-1-->L832: Formula: (and (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t514~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t514~0.offset_11| 0) (not (= |v_ULTIMATE.start_main_~#t514~0.base_13| 0)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t514~0.base_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t514~0.base_13| 4)) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t514~0.base_13|) 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t514~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t514~0.base_13|) |v_ULTIMATE.start_main_~#t514~0.offset_11| 2)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t514~0.base=|v_ULTIMATE.start_main_~#t514~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t514~0.offset=|v_ULTIMATE.start_main_~#t514~0.offset_11|, #valid=|v_#valid_38|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t514~0.base, ULTIMATE.start_main_~#t514~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-11-28 18:07:01,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] P2ENTRY-->L4-3: Formula: (and (= |v_P2Thread1of1ForFork2_#in~arg.base_15| v_P2Thread1of1ForFork2_~arg.base_13) (= 1 v_~y$w_buff0~0_40) (= v_~y$w_buff0~0_41 v_~y$w_buff1~0_29) (= v_~y$w_buff0_used~0_110 1) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_13| v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_15) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_13| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_63 256) 0)) (not (= (mod v_~y$w_buff0_used~0_110 256) 0)))) 1 0)) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_15)) (= v_P2Thread1of1ForFork2_~arg.offset_13 |v_P2Thread1of1ForFork2_#in~arg.offset_15|) (= v_~y$w_buff1_used~0_63 v_~y$w_buff0_used~0_111)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_15|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_111, ~y$w_buff0~0=v_~y$w_buff0~0_41, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_15|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_15|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_110, ~y$w_buff1~0=v_~y$w_buff1~0_29, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_13, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_13, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_13|, ~y$w_buff0~0=v_~y$w_buff0~0_40, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_15, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_15|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_63} 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-11-28 18:07:01,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [954] [954] L790-2-->L790-5: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1747071552 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In1747071552 256) 0)) (.cse2 (= |P2Thread1of1ForFork2_#t~ite28_Out1747071552| |P2Thread1of1ForFork2_#t~ite29_Out1747071552|))) (or (and (not .cse0) (not .cse1) .cse2 (= |P2Thread1of1ForFork2_#t~ite28_Out1747071552| ~y$w_buff0~0_In1747071552)) (and (= |P2Thread1of1ForFork2_#t~ite28_Out1747071552| ~y$w_buff1~0_In1747071552) (or .cse1 .cse0) .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1747071552, ~y$w_buff1~0=~y$w_buff1~0_In1747071552, ~y$w_buff0~0=~y$w_buff0~0_In1747071552, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1747071552} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1747071552, ~y$w_buff1~0=~y$w_buff1~0_In1747071552, ~y$w_buff0~0=~y$w_buff0~0_In1747071552, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1747071552, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out1747071552|, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out1747071552|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-11-28 18:07:01,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [935] [935] L795-->L796: Formula: (and (= v_~y$r_buff0_thd3~0_209 v_~y$r_buff0_thd3~0_210) (not (= 0 (mod v_~weak$$choice2~0_108 256)))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_210, ~weak$$choice2~0=v_~weak$$choice2~0_108} OutVars{P2Thread1of1ForFork2_#t~ite42=|v_P2Thread1of1ForFork2_#t~ite42_6|, P2Thread1of1ForFork2_#t~ite44=|v_P2Thread1of1ForFork2_#t~ite44_9|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_209, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_108} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42, P2Thread1of1ForFork2_#t~ite44, ~y$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-11-28 18:07:01,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-408589243 256) 0))) (or (and .cse0 (= ~y~0_In-408589243 |P2Thread1of1ForFork2_#t~ite48_Out-408589243|)) (and (= ~y$mem_tmp~0_In-408589243 |P2Thread1of1ForFork2_#t~ite48_Out-408589243|) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-408589243, ~y$flush_delayed~0=~y$flush_delayed~0_In-408589243, ~y~0=~y~0_In-408589243} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-408589243, P2Thread1of1ForFork2_#t~ite48=|P2Thread1of1ForFork2_#t~ite48_Out-408589243|, ~y$flush_delayed~0=~y$flush_delayed~0_In-408589243, ~y~0=~y~0_In-408589243} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-11-28 18:07:01,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_7|) (= v_P0Thread1of1ForFork0_~arg.offset_9 |v_P0Thread1of1ForFork0_#in~arg.offset_11|) (= v_~z~0_17 1) (= |v_P0Thread1of1ForFork0_#res.offset_7| 0) (= v_~__unbuffered_cnt~0_138 (+ v_~__unbuffered_cnt~0_139 1)) (= v_P0Thread1of1ForFork0_~arg.base_9 |v_P0Thread1of1ForFork0_#in~arg.base_11|) (= v_~x~0_49 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_11|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_11|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_7|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_11|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_138, ~z~0=v_~z~0_17, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_9, ~x~0=v_~x~0_49, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_9} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-11-28 18:07:01,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In748395992 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In748395992 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite51_Out748395992| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite51_Out748395992| ~y$w_buff0_used~0_In748395992) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In748395992, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In748395992} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In748395992, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In748395992, P2Thread1of1ForFork2_#t~ite51=|P2Thread1of1ForFork2_#t~ite51_Out748395992|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-11-28 18:07:01,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [940] [940] L807-->L807-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1777320342 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1777320342 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1777320342 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In1777320342 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite52_Out1777320342|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In1777320342 |P2Thread1of1ForFork2_#t~ite52_Out1777320342|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1777320342, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1777320342, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1777320342, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1777320342} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1777320342, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1777320342, P2Thread1of1ForFork2_#t~ite52=|P2Thread1of1ForFork2_#t~ite52_Out1777320342|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1777320342, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1777320342} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-11-28 18:07:01,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L808-->L809: Formula: (let ((.cse1 (= ~y$r_buff0_thd3~0_In226576778 ~y$r_buff0_thd3~0_Out226576778)) (.cse2 (= (mod ~y$r_buff0_thd3~0_In226576778 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In226576778 256) 0))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and (not .cse2) (not .cse0) (= ~y$r_buff0_thd3~0_Out226576778 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In226576778, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In226576778} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In226576778, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out226576778, P2Thread1of1ForFork2_#t~ite53=|P2Thread1of1ForFork2_#t~ite53_Out226576778|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~ite53] because there is no mapped edge [2019-11-28 18:07:01,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd3~0_In1990786530 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1990786530 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In1990786530 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In1990786530 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite54_Out1990786530| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P2Thread1of1ForFork2_#t~ite54_Out1990786530| ~y$r_buff1_thd3~0_In1990786530)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1990786530, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1990786530, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1990786530, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1990786530} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1990786530, P2Thread1of1ForFork2_#t~ite54=|P2Thread1of1ForFork2_#t~ite54_Out1990786530|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1990786530, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1990786530, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1990786530} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-11-28 18:07:01,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L809-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_124 (+ v_~__unbuffered_cnt~0_125 1)) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite54_32| v_~y$r_buff1_thd3~0_249)) InVars {P2Thread1of1ForFork2_#t~ite54=|v_P2Thread1of1ForFork2_#t~ite54_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_249, P2Thread1of1ForFork2_#t~ite54=|v_P2Thread1of1ForFork2_#t~ite54_31|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_124, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite54, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-11-28 18:07:01,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [956] [956] L761-->L761-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In428191153 256) 0))) (or (and (= ~y$mem_tmp~0_In428191153 |P1Thread1of1ForFork1_#t~ite25_Out428191153|) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite25_Out428191153| ~y~0_In428191153) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In428191153, ~y$flush_delayed~0=~y$flush_delayed~0_In428191153, ~y~0=~y~0_In428191153} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In428191153, ~y$flush_delayed~0=~y$flush_delayed~0_In428191153, ~y~0=~y~0_In428191153, P1Thread1of1ForFork1_#t~ite25=|P1Thread1of1ForFork1_#t~ite25_Out428191153|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-11-28 18:07:01,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L761-2-->P1EXIT: Formula: (and (= v_~y~0_274 |v_P1Thread1of1ForFork1_#t~ite25_116|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~y$flush_delayed~0_269 0) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~__unbuffered_cnt~0_148 (+ v_~__unbuffered_cnt~0_149 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_149, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_116|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_269, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_148, ~y~0=v_~y~0_274, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_115|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-11-28 18:07:01,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L832-1-->L838: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_11 256))) (= v_~main$tmp_guard0~0_11 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_70) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:07:01,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L838-2-->L838-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In2044333932 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In2044333932 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite58_Out2044333932| ~y~0_In2044333932) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite58_Out2044333932| ~y$w_buff1~0_In2044333932) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In2044333932, ~y~0=~y~0_In2044333932, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2044333932, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2044333932} OutVars{~y$w_buff1~0=~y$w_buff1~0_In2044333932, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out2044333932|, ~y~0=~y~0_In2044333932, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2044333932, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2044333932} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58] because there is no mapped edge [2019-11-28 18:07:01,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L838-4-->L839: Formula: (= v_~y~0_42 |v_ULTIMATE.start_main_#t~ite58_10|) InVars {ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_10|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_9|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_15|, ~y~0=v_~y~0_42} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59, ~y~0] because there is no mapped edge [2019-11-28 18:07:01,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [944] [944] L839-->L839-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In967225597 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In967225597 256)))) (or (and (= ~y$w_buff0_used~0_In967225597 |ULTIMATE.start_main_#t~ite60_Out967225597|) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite60_Out967225597| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In967225597, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In967225597} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out967225597|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In967225597, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In967225597} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-11-28 18:07:01,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] L840-->L840-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1198140736 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1198140736 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1198140736 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1198140736 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite61_Out-1198140736|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1198140736 |ULTIMATE.start_main_#t~ite61_Out-1198140736|) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1198140736, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1198140736, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1198140736, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1198140736} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1198140736|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1198140736, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1198140736, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1198140736, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1198140736} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-11-28 18:07:01,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L841-->L841-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1897779497 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1897779497 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-1897779497 |ULTIMATE.start_main_#t~ite62_Out-1897779497|)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite62_Out-1897779497| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1897779497, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1897779497} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1897779497|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1897779497, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1897779497} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-11-28 18:07:01,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L842-->L842-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In268380311 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In268380311 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In268380311 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In268380311 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In268380311 |ULTIMATE.start_main_#t~ite63_Out268380311|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite63_Out268380311| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In268380311, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In268380311, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In268380311, ~y$w_buff1_used~0=~y$w_buff1_used~0_In268380311} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out268380311|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In268380311, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In268380311, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In268380311, ~y$w_buff1_used~0=~y$w_buff1_used~0_In268380311} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-11-28 18:07:01,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L842-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_20 256)) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_33) (= v_~x~0_59 2) (= v_~__unbuffered_p2_EBX~0_27 0) (= 1 v_~__unbuffered_p2_EAX~0_23))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_20) (= v_~y$r_buff1_thd0~0_234 |v_ULTIMATE.start_main_#t~ite63_45|)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_45|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_33, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_59} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_44|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_59, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_234, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:07:01,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:07:01 BasicIcfg [2019-11-28 18:07:01,439 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:07:01,439 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:07:01,439 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:07:01,440 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:07:01,440 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:06:36" (3/4) ... [2019-11-28 18:07:01,443 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:07:01,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1016] [1016] ULTIMATE.startENTRY-->L828: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t512~0.base_24| 4)) (= 0 v_~y$r_buff1_thd2~0_356) (= v_~y$r_buff0_thd0~0_194 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t512~0.base_24| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t512~0.base_24|) |v_ULTIMATE.start_main_~#t512~0.offset_17| 0)) |v_#memory_int_15|) (= v_~y$r_buff1_thd1~0_192 0) (= v_~y$w_buff1_used~0_559 0) (= v_~y$r_buff0_thd1~0_121 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd3~0_350) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t512~0.base_24|)) (= v_~y~0_367 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t512~0.base_24|) (= v_~main$tmp_guard1~0_26 0) (= 0 v_~y$read_delayed_var~0.base_5) (= v_~y$w_buff1~0_262 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$r_buff1_thd0~0_244 0) (= |v_#valid_58| (store .cse0 |v_ULTIMATE.start_main_~#t512~0.base_24| 1)) (= 0 v_~__unbuffered_p1_EAX~0_43) (= v_~y$mem_tmp~0_237 0) (= 0 v_~y$read_delayed_var~0.offset_5) (= 0 v_~__unbuffered_p2_EAX~0_29) (= 0 v_~y$r_buff0_thd2~0_368) (= v_~y$w_buff0_used~0_898 0) (= v_~__unbuffered_p2_EBX~0_33 0) (= 0 v_~weak$$choice0~0_225) (= v_~y$flush_delayed~0_303 0) (= v_~z~0_25 0) (= 0 v_~y$w_buff0~0_387) (= |v_#NULL.offset_5| 0) (= |v_ULTIMATE.start_main_~#t512~0.offset_17| 0) (= v_~main$tmp_guard0~0_22 0) (= v_~x~0_65 0) (= v_~weak$$choice2~0_304 0) (= v_~__unbuffered_cnt~0_157 0) (= 0 |v_#NULL.base_5|) (= 0 v_~y$r_buff0_thd3~0_578))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t512~0.base=|v_ULTIMATE.start_main_~#t512~0.base_24|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_19|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, #NULL.offset=|v_#NULL.offset_5|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_237, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_350, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_43, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_121, ~y$flush_delayed~0=v_~y$flush_delayed~0_303, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_91|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_53|, ~weak$$choice0~0=v_~weak$$choice0~0_225, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_203|, ~y$w_buff1~0=v_~y$w_buff1~0_262, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_368, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_157, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_244, ~x~0=v_~x~0_65, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_898, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ULTIMATE.start_main_~#t512~0.offset=|v_ULTIMATE.start_main_~#t512~0.offset_17|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_192, ULTIMATE.start_main_~#t514~0.base=|v_ULTIMATE.start_main_~#t514~0.base_23|, ~y$w_buff0~0=v_~y$w_buff0~0_387, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_578, ~y~0=v_~y~0_367, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_151|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_27|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_356, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_209|, ULTIMATE.start_main_~#t514~0.offset=|v_ULTIMATE.start_main_~#t514~0.offset_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_194, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t513~0.offset=|v_ULTIMATE.start_main_~#t513~0.offset_17|, ULTIMATE.start_main_~#t513~0.base=|v_ULTIMATE.start_main_~#t513~0.base_23|, ~z~0=v_~z~0_25, ~weak$$choice2~0=v_~weak$$choice2~0_304, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_559} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t512~0.base, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, #NULL.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ULTIMATE.start_main_~#t512~0.offset, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t514~0.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t514~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_~#t513~0.offset, ULTIMATE.start_main_~#t513~0.base, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:07:01,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L828-1-->L830: Formula: (and (= |v_ULTIMATE.start_main_~#t513~0.offset_10| 0) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t513~0.base_12| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t513~0.base_12|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t513~0.base_12|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t513~0.base_12|)) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t513~0.base_12| 4) |v_#length_13|) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t513~0.base_12| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t513~0.base_12|) |v_ULTIMATE.start_main_~#t513~0.offset_10| 1)) |v_#memory_int_7|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t513~0.offset=|v_ULTIMATE.start_main_~#t513~0.offset_10|, #length=|v_#length_13|, ULTIMATE.start_main_~#t513~0.base=|v_ULTIMATE.start_main_~#t513~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t513~0.offset, #length, ULTIMATE.start_main_~#t513~0.base] because there is no mapped edge [2019-11-28 18:07:01,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L830-1-->L832: Formula: (and (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t514~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t514~0.offset_11| 0) (not (= |v_ULTIMATE.start_main_~#t514~0.base_13| 0)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t514~0.base_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t514~0.base_13| 4)) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t514~0.base_13|) 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t514~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t514~0.base_13|) |v_ULTIMATE.start_main_~#t514~0.offset_11| 2)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t514~0.base=|v_ULTIMATE.start_main_~#t514~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t514~0.offset=|v_ULTIMATE.start_main_~#t514~0.offset_11|, #valid=|v_#valid_38|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t514~0.base, ULTIMATE.start_main_~#t514~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-11-28 18:07:01,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] P2ENTRY-->L4-3: Formula: (and (= |v_P2Thread1of1ForFork2_#in~arg.base_15| v_P2Thread1of1ForFork2_~arg.base_13) (= 1 v_~y$w_buff0~0_40) (= v_~y$w_buff0~0_41 v_~y$w_buff1~0_29) (= v_~y$w_buff0_used~0_110 1) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_13| v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_15) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_13| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_63 256) 0)) (not (= (mod v_~y$w_buff0_used~0_110 256) 0)))) 1 0)) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_15)) (= v_P2Thread1of1ForFork2_~arg.offset_13 |v_P2Thread1of1ForFork2_#in~arg.offset_15|) (= v_~y$w_buff1_used~0_63 v_~y$w_buff0_used~0_111)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_15|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_111, ~y$w_buff0~0=v_~y$w_buff0~0_41, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_15|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_15|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_110, ~y$w_buff1~0=v_~y$w_buff1~0_29, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_13, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_13, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_13|, ~y$w_buff0~0=v_~y$w_buff0~0_40, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_15, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_15|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_63} 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-11-28 18:07:01,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [954] [954] L790-2-->L790-5: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1747071552 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In1747071552 256) 0)) (.cse2 (= |P2Thread1of1ForFork2_#t~ite28_Out1747071552| |P2Thread1of1ForFork2_#t~ite29_Out1747071552|))) (or (and (not .cse0) (not .cse1) .cse2 (= |P2Thread1of1ForFork2_#t~ite28_Out1747071552| ~y$w_buff0~0_In1747071552)) (and (= |P2Thread1of1ForFork2_#t~ite28_Out1747071552| ~y$w_buff1~0_In1747071552) (or .cse1 .cse0) .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1747071552, ~y$w_buff1~0=~y$w_buff1~0_In1747071552, ~y$w_buff0~0=~y$w_buff0~0_In1747071552, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1747071552} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1747071552, ~y$w_buff1~0=~y$w_buff1~0_In1747071552, ~y$w_buff0~0=~y$w_buff0~0_In1747071552, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1747071552, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out1747071552|, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out1747071552|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-11-28 18:07:01,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [935] [935] L795-->L796: Formula: (and (= v_~y$r_buff0_thd3~0_209 v_~y$r_buff0_thd3~0_210) (not (= 0 (mod v_~weak$$choice2~0_108 256)))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_210, ~weak$$choice2~0=v_~weak$$choice2~0_108} OutVars{P2Thread1of1ForFork2_#t~ite42=|v_P2Thread1of1ForFork2_#t~ite42_6|, P2Thread1of1ForFork2_#t~ite44=|v_P2Thread1of1ForFork2_#t~ite44_9|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_209, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_108} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42, P2Thread1of1ForFork2_#t~ite44, ~y$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-11-28 18:07:01,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-408589243 256) 0))) (or (and .cse0 (= ~y~0_In-408589243 |P2Thread1of1ForFork2_#t~ite48_Out-408589243|)) (and (= ~y$mem_tmp~0_In-408589243 |P2Thread1of1ForFork2_#t~ite48_Out-408589243|) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-408589243, ~y$flush_delayed~0=~y$flush_delayed~0_In-408589243, ~y~0=~y~0_In-408589243} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-408589243, P2Thread1of1ForFork2_#t~ite48=|P2Thread1of1ForFork2_#t~ite48_Out-408589243|, ~y$flush_delayed~0=~y$flush_delayed~0_In-408589243, ~y~0=~y~0_In-408589243} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-11-28 18:07:01,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_7|) (= v_P0Thread1of1ForFork0_~arg.offset_9 |v_P0Thread1of1ForFork0_#in~arg.offset_11|) (= v_~z~0_17 1) (= |v_P0Thread1of1ForFork0_#res.offset_7| 0) (= v_~__unbuffered_cnt~0_138 (+ v_~__unbuffered_cnt~0_139 1)) (= v_P0Thread1of1ForFork0_~arg.base_9 |v_P0Thread1of1ForFork0_#in~arg.base_11|) (= v_~x~0_49 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_11|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_11|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_7|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_11|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_138, ~z~0=v_~z~0_17, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_9, ~x~0=v_~x~0_49, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_9} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-11-28 18:07:01,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In748395992 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In748395992 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite51_Out748395992| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite51_Out748395992| ~y$w_buff0_used~0_In748395992) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In748395992, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In748395992} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In748395992, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In748395992, P2Thread1of1ForFork2_#t~ite51=|P2Thread1of1ForFork2_#t~ite51_Out748395992|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-11-28 18:07:01,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [940] [940] L807-->L807-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1777320342 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1777320342 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1777320342 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In1777320342 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite52_Out1777320342|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In1777320342 |P2Thread1of1ForFork2_#t~ite52_Out1777320342|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1777320342, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1777320342, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1777320342, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1777320342} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1777320342, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1777320342, P2Thread1of1ForFork2_#t~ite52=|P2Thread1of1ForFork2_#t~ite52_Out1777320342|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1777320342, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1777320342} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-11-28 18:07:01,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L808-->L809: Formula: (let ((.cse1 (= ~y$r_buff0_thd3~0_In226576778 ~y$r_buff0_thd3~0_Out226576778)) (.cse2 (= (mod ~y$r_buff0_thd3~0_In226576778 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In226576778 256) 0))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and (not .cse2) (not .cse0) (= ~y$r_buff0_thd3~0_Out226576778 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In226576778, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In226576778} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In226576778, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out226576778, P2Thread1of1ForFork2_#t~ite53=|P2Thread1of1ForFork2_#t~ite53_Out226576778|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~ite53] because there is no mapped edge [2019-11-28 18:07:01,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd3~0_In1990786530 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1990786530 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In1990786530 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In1990786530 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite54_Out1990786530| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P2Thread1of1ForFork2_#t~ite54_Out1990786530| ~y$r_buff1_thd3~0_In1990786530)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1990786530, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1990786530, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1990786530, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1990786530} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1990786530, P2Thread1of1ForFork2_#t~ite54=|P2Thread1of1ForFork2_#t~ite54_Out1990786530|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1990786530, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1990786530, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1990786530} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-11-28 18:07:01,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L809-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_124 (+ v_~__unbuffered_cnt~0_125 1)) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite54_32| v_~y$r_buff1_thd3~0_249)) InVars {P2Thread1of1ForFork2_#t~ite54=|v_P2Thread1of1ForFork2_#t~ite54_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_249, P2Thread1of1ForFork2_#t~ite54=|v_P2Thread1of1ForFork2_#t~ite54_31|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_124, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite54, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-11-28 18:07:01,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [956] [956] L761-->L761-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In428191153 256) 0))) (or (and (= ~y$mem_tmp~0_In428191153 |P1Thread1of1ForFork1_#t~ite25_Out428191153|) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite25_Out428191153| ~y~0_In428191153) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In428191153, ~y$flush_delayed~0=~y$flush_delayed~0_In428191153, ~y~0=~y~0_In428191153} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In428191153, ~y$flush_delayed~0=~y$flush_delayed~0_In428191153, ~y~0=~y~0_In428191153, P1Thread1of1ForFork1_#t~ite25=|P1Thread1of1ForFork1_#t~ite25_Out428191153|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-11-28 18:07:01,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L761-2-->P1EXIT: Formula: (and (= v_~y~0_274 |v_P1Thread1of1ForFork1_#t~ite25_116|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~y$flush_delayed~0_269 0) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~__unbuffered_cnt~0_148 (+ v_~__unbuffered_cnt~0_149 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_149, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_116|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_269, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_148, ~y~0=v_~y~0_274, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_115|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-11-28 18:07:01,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L832-1-->L838: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_11 256))) (= v_~main$tmp_guard0~0_11 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_70) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:07:01,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L838-2-->L838-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In2044333932 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In2044333932 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite58_Out2044333932| ~y~0_In2044333932) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite58_Out2044333932| ~y$w_buff1~0_In2044333932) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In2044333932, ~y~0=~y~0_In2044333932, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2044333932, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2044333932} OutVars{~y$w_buff1~0=~y$w_buff1~0_In2044333932, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out2044333932|, ~y~0=~y~0_In2044333932, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2044333932, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2044333932} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58] because there is no mapped edge [2019-11-28 18:07:01,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L838-4-->L839: Formula: (= v_~y~0_42 |v_ULTIMATE.start_main_#t~ite58_10|) InVars {ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_10|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_9|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_15|, ~y~0=v_~y~0_42} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59, ~y~0] because there is no mapped edge [2019-11-28 18:07:01,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [944] [944] L839-->L839-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In967225597 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In967225597 256)))) (or (and (= ~y$w_buff0_used~0_In967225597 |ULTIMATE.start_main_#t~ite60_Out967225597|) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite60_Out967225597| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In967225597, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In967225597} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out967225597|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In967225597, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In967225597} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-11-28 18:07:01,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] L840-->L840-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1198140736 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1198140736 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1198140736 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1198140736 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite61_Out-1198140736|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1198140736 |ULTIMATE.start_main_#t~ite61_Out-1198140736|) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1198140736, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1198140736, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1198140736, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1198140736} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1198140736|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1198140736, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1198140736, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1198140736, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1198140736} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-11-28 18:07:01,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L841-->L841-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1897779497 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1897779497 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-1897779497 |ULTIMATE.start_main_#t~ite62_Out-1897779497|)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite62_Out-1897779497| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1897779497, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1897779497} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1897779497|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1897779497, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1897779497} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-11-28 18:07:01,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L842-->L842-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In268380311 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In268380311 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In268380311 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In268380311 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In268380311 |ULTIMATE.start_main_#t~ite63_Out268380311|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite63_Out268380311| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In268380311, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In268380311, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In268380311, ~y$w_buff1_used~0=~y$w_buff1_used~0_In268380311} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out268380311|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In268380311, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In268380311, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In268380311, ~y$w_buff1_used~0=~y$w_buff1_used~0_In268380311} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-11-28 18:07:01,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L842-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_20 256)) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_33) (= v_~x~0_59 2) (= v_~__unbuffered_p2_EBX~0_27 0) (= 1 v_~__unbuffered_p2_EAX~0_23))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_20) (= v_~y$r_buff1_thd0~0_234 |v_ULTIMATE.start_main_#t~ite63_45|)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_45|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_33, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_59} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_44|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_59, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_234, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:07:01,589 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:07:01,589 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:07:01,593 INFO L168 Benchmark]: Toolchain (without parser) took 27025.08 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 946.9 MB in the beginning and 1.3 GB in the end (delta: -380.4 MB). Peak memory consumption was 900.4 MB. Max. memory is 11.5 GB. [2019-11-28 18:07:01,593 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:07:01,594 INFO L168 Benchmark]: CACSL2BoogieTranslator took 750.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -164.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:07:01,595 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:07:01,595 INFO L168 Benchmark]: Boogie Preprocessor took 44.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:07:01,596 INFO L168 Benchmark]: RCFGBuilder took 915.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.1 MB). Peak memory consumption was 57.1 MB. Max. memory is 11.5 GB. [2019-11-28 18:07:01,596 INFO L168 Benchmark]: TraceAbstraction took 25071.05 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -306.3 MB). Peak memory consumption was 826.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:07:01,597 INFO L168 Benchmark]: Witness Printer took 149.95 ms. Allocated memory is still 2.3 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:07:01,600 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 750.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -164.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 88.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 915.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.1 MB). Peak memory consumption was 57.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25071.05 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -306.3 MB). Peak memory consumption was 826.6 MB. Max. memory is 11.5 GB. * Witness Printer took 149.95 ms. Allocated memory is still 2.3 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 194 ProgramPointsBefore, 109 ProgramPointsAfterwards, 240 TransitionsBefore, 131 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 49 ConcurrentYvCompositions, 28 ChoiceCompositions, 9412 VarBasedMoverChecksPositive, 304 VarBasedMoverChecksNegative, 80 SemBasedMoverChecksPositive, 312 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 128329 CheckedPairsTotal, 122 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L828] FCALL, FORK 0 pthread_create(&t512, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L830] FCALL, FORK 0 pthread_create(&t513, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L832] FCALL, FORK 0 pthread_create(&t514, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 [L786] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 3 y$flush_delayed = weak$$choice2 [L789] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=0, y=0, y$flush_delayed=7, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=0, y=0, y$flush_delayed=7, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L791] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=0, y=1, y$flush_delayed=7, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L792] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=0, y=1, y$flush_delayed=7, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L793] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=0, y=1, y$flush_delayed=7, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L793] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L794] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=0, y=1, y$flush_delayed=7, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L794] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=0, y=1, y$flush_delayed=7, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=0, y=1, y$flush_delayed=7, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 y = y$flush_delayed ? y$mem_tmp : y [L799] 3 y$flush_delayed = (_Bool)0 [L802] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L746] 2 x = 2 [L749] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 2 y$flush_delayed = weak$$choice2 [L752] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=8, x=2, y=0, y$flush_delayed=8, 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] [L753] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=8, x=2, y=0, y$flush_delayed=8, 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] [L753] 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) [L754] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=8, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=8, 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] [L754] 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)) [L755] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=8, 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=2, y=0, y$flush_delayed=8, 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] [L755] 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)) [L756] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=8, 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))=1, x=2, y=0, y$flush_delayed=8, 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] [L756] 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)) [L757] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=8, 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=2, y=0, y$flush_delayed=8, 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] [L757] 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)) [L758] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=8, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=8, 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] [L758] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L759] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=8, 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=2, y=0, y$flush_delayed=8, 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] [L759] 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)) [L760] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=8, x=2, y=0, y$flush_delayed=8, 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] [L805] 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) [L806] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L807] 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 [L838] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=8, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L839] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L840] 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 [L841] 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, 185 locations, 2 error locations. Result: UNSAFE, OverallTime: 24.7s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3024 SDtfs, 4583 SDslu, 6030 SDs, 0 SdLazy, 2273 SolverSat, 156 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 25 SyntacticMatches, 10 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48994occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 7369 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 829 NumberOfCodeBlocks, 829 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 750 ConstructedInterpolants, 0 QuantifiedInterpolants, 237444 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...