./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix035_pso.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/mix035_pso.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 8407640384d9c62c9303a97bf3c167a9bd85dcbe ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:12:39,318 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:12:39,320 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:12:39,333 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:12:39,334 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:12:39,335 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:12:39,336 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:12:39,339 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:12:39,341 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:12:39,342 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:12:39,343 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:12:39,346 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:12:39,347 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:12:39,348 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:12:39,350 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:12:39,352 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:12:39,353 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:12:39,353 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:12:39,357 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:12:39,360 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:12:39,364 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:12:39,367 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:12:39,370 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:12:39,371 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:12:39,375 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:12:39,376 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:12:39,376 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:12:39,379 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:12:39,379 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:12:39,381 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:12:39,382 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:12:39,383 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:12:39,383 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:12:39,385 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:12:39,386 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:12:39,387 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:12:39,388 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:12:39,388 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:12:39,388 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:12:39,390 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:12:39,392 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:12:39,393 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:12:39,415 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:12:39,415 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:12:39,417 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:12:39,417 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:12:39,418 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:12:39,418 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:12:39,418 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:12:39,419 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:12:39,419 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:12:39,419 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:12:39,420 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:12:39,420 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:12:39,421 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:12:39,421 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:12:39,421 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:12:39,422 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:12:39,422 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:12:39,422 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:12:39,423 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:12:39,423 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:12:39,423 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:12:39,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:12:39,424 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:12:39,424 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:12:39,424 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:12:39,425 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:12:39,425 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:12:39,425 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:12:39,425 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:12:39,426 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 -> 8407640384d9c62c9303a97bf3c167a9bd85dcbe [2019-11-28 18:12:39,745 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:12:39,757 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:12:39,761 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:12:39,762 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:12:39,763 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:12:39,764 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix035_pso.opt.i [2019-11-28 18:12:39,824 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6cdd0420/b3166c8f30cb4f5fa15e360e7f7f1ff0/FLAG408b87617 [2019-11-28 18:12:40,313 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:12:40,314 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix035_pso.opt.i [2019-11-28 18:12:40,331 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6cdd0420/b3166c8f30cb4f5fa15e360e7f7f1ff0/FLAG408b87617 [2019-11-28 18:12:40,657 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6cdd0420/b3166c8f30cb4f5fa15e360e7f7f1ff0 [2019-11-28 18:12:40,660 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:12:40,662 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:12:40,663 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:12:40,664 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:12:40,670 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:12:40,671 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:12:40" (1/1) ... [2019-11-28 18:12:40,674 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29271dbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:40, skipping insertion in model container [2019-11-28 18:12:40,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:12:40" (1/1) ... [2019-11-28 18:12:40,684 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:12:40,750 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:12:41,260 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:12:41,279 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:12:41,357 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:12:41,436 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:12:41,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:41 WrapperNode [2019-11-28 18:12:41,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:12:41,438 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:12:41,438 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:12:41,438 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:12:41,447 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:12:41" (1/1) ... [2019-11-28 18:12:41,466 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:12:41" (1/1) ... [2019-11-28 18:12:41,497 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:12:41,498 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:12:41,498 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:12:41,498 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:12:41,507 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:41" (1/1) ... [2019-11-28 18:12:41,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:41" (1/1) ... [2019-11-28 18:12:41,513 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:41" (1/1) ... [2019-11-28 18:12:41,513 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:41" (1/1) ... [2019-11-28 18:12:41,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:41" (1/1) ... [2019-11-28 18:12:41,533 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:41" (1/1) ... [2019-11-28 18:12:41,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:41" (1/1) ... [2019-11-28 18:12:41,542 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:12:41,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:12:41,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:12:41,543 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:12:41,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:41" (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:12:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:12:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:12:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:12:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:12:41,608 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:12:41,608 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:12:41,608 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:12:41,608 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:12:41,609 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-11-28 18:12:41,609 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-11-28 18:12:41,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:12:41,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:12:41,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:12:41,611 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:12:42,254 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:12:42,255 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:12:42,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:12:42 BoogieIcfgContainer [2019-11-28 18:12:42,257 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:12:42,260 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:12:42,260 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:12:42,263 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:12:42,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:12:40" (1/3) ... [2019-11-28 18:12:42,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba31347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:12:42, skipping insertion in model container [2019-11-28 18:12:42,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:41" (2/3) ... [2019-11-28 18:12:42,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba31347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:12:42, skipping insertion in model container [2019-11-28 18:12:42,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:12:42" (3/3) ... [2019-11-28 18:12:42,267 INFO L109 eAbstractionObserver]: Analyzing ICFG mix035_pso.opt.i [2019-11-28 18:12:42,277 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:12:42,277 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:12:42,288 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:12:42,289 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:12:42,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,332 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,333 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,335 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,336 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,359 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,359 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,360 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,360 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,360 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:42,385 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-28 18:12:42,405 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:12:42,405 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:12:42,405 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:12:42,406 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:12:42,406 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:12:42,406 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:12:42,406 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:12:42,406 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:12:42,423 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 179 transitions [2019-11-28 18:12:42,425 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 154 places, 179 transitions [2019-11-28 18:12:42,515 INFO L134 PetriNetUnfolder]: 35/176 cut-off events. [2019-11-28 18:12:42,516 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:12:42,535 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 176 events. 35/176 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 576 event pairs. 9/148 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-11-28 18:12:42,567 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 154 places, 179 transitions [2019-11-28 18:12:42,618 INFO L134 PetriNetUnfolder]: 35/176 cut-off events. [2019-11-28 18:12:42,619 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:12:42,631 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 176 events. 35/176 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 576 event pairs. 9/148 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-11-28 18:12:42,663 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-11-28 18:12:42,665 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:12:47,509 WARN L192 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-11-28 18:12:47,634 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-28 18:12:47,661 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44280 [2019-11-28 18:12:47,661 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-11-28 18:12:47,664 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 71 places, 79 transitions [2019-11-28 18:12:48,735 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 12302 states. [2019-11-28 18:12:48,738 INFO L276 IsEmpty]: Start isEmpty. Operand 12302 states. [2019-11-28 18:12:48,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 18:12:48,745 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:48,746 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:48,747 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:12:48,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:48,753 INFO L82 PathProgramCache]: Analyzing trace with hash -941376449, now seen corresponding path program 1 times [2019-11-28 18:12:48,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:48,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089437662] [2019-11-28 18:12:48,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:48,998 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:12:48,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089437662] [2019-11-28 18:12:49,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:49,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:12:49,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360135994] [2019-11-28 18:12:49,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:49,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:49,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:49,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:49,024 INFO L87 Difference]: Start difference. First operand 12302 states. Second operand 3 states. [2019-11-28 18:12:49,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:49,292 INFO L93 Difference]: Finished difference Result 11966 states and 45788 transitions. [2019-11-28 18:12:49,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:49,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-28 18:12:49,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:49,418 INFO L225 Difference]: With dead ends: 11966 [2019-11-28 18:12:49,419 INFO L226 Difference]: Without dead ends: 11270 [2019-11-28 18:12:49,420 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:12:49,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11270 states. [2019-11-28 18:12:50,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11270 to 11270. [2019-11-28 18:12:50,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11270 states. [2019-11-28 18:12:50,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11270 states to 11270 states and 43054 transitions. [2019-11-28 18:12:50,188 INFO L78 Accepts]: Start accepts. Automaton has 11270 states and 43054 transitions. Word has length 7 [2019-11-28 18:12:50,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:50,189 INFO L462 AbstractCegarLoop]: Abstraction has 11270 states and 43054 transitions. [2019-11-28 18:12:50,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:50,190 INFO L276 IsEmpty]: Start isEmpty. Operand 11270 states and 43054 transitions. [2019-11-28 18:12:50,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 18:12:50,200 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:50,201 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:50,201 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:12:50,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:50,202 INFO L82 PathProgramCache]: Analyzing trace with hash -941453907, now seen corresponding path program 1 times [2019-11-28 18:12:50,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:50,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498006203] [2019-11-28 18:12:50,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:50,360 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:12:50,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498006203] [2019-11-28 18:12:50,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:50,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:50,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403540375] [2019-11-28 18:12:50,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:50,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:50,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:50,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:50,364 INFO L87 Difference]: Start difference. First operand 11270 states and 43054 transitions. Second operand 4 states. [2019-11-28 18:12:50,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:50,728 INFO L93 Difference]: Finished difference Result 16970 states and 62500 transitions. [2019-11-28 18:12:50,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:12:50,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-28 18:12:50,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:50,815 INFO L225 Difference]: With dead ends: 16970 [2019-11-28 18:12:50,815 INFO L226 Difference]: Without dead ends: 16944 [2019-11-28 18:12:50,816 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:12:50,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16944 states. [2019-11-28 18:12:51,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16944 to 15456. [2019-11-28 18:12:51,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15456 states. [2019-11-28 18:12:51,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15456 states to 15456 states and 57661 transitions. [2019-11-28 18:12:51,401 INFO L78 Accepts]: Start accepts. Automaton has 15456 states and 57661 transitions. Word has length 13 [2019-11-28 18:12:51,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:51,402 INFO L462 AbstractCegarLoop]: Abstraction has 15456 states and 57661 transitions. [2019-11-28 18:12:51,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:51,402 INFO L276 IsEmpty]: Start isEmpty. Operand 15456 states and 57661 transitions. [2019-11-28 18:12:51,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:12:51,406 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:51,406 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:12:51,407 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:12:51,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:51,407 INFO L82 PathProgramCache]: Analyzing trace with hash 166730424, now seen corresponding path program 1 times [2019-11-28 18:12:51,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:51,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436817325] [2019-11-28 18:12:51,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:51,454 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:12:51,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436817325] [2019-11-28 18:12:51,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:51,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:51,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740784325] [2019-11-28 18:12:51,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:51,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:51,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:51,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:51,457 INFO L87 Difference]: Start difference. First operand 15456 states and 57661 transitions. Second operand 3 states. [2019-11-28 18:12:51,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:51,611 INFO L93 Difference]: Finished difference Result 20134 states and 73756 transitions. [2019-11-28 18:12:51,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:51,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:12:51,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:51,708 INFO L225 Difference]: With dead ends: 20134 [2019-11-28 18:12:51,708 INFO L226 Difference]: Without dead ends: 20134 [2019-11-28 18:12:51,709 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:52,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20134 states. [2019-11-28 18:12:52,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20134 to 16742. [2019-11-28 18:12:52,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16742 states. [2019-11-28 18:12:52,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16742 states to 16742 states and 62266 transitions. [2019-11-28 18:12:52,500 INFO L78 Accepts]: Start accepts. Automaton has 16742 states and 62266 transitions. Word has length 16 [2019-11-28 18:12:52,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:52,501 INFO L462 AbstractCegarLoop]: Abstraction has 16742 states and 62266 transitions. [2019-11-28 18:12:52,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:52,501 INFO L276 IsEmpty]: Start isEmpty. Operand 16742 states and 62266 transitions. [2019-11-28 18:12:52,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:12:52,505 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:52,505 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:12:52,505 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:12:52,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:52,507 INFO L82 PathProgramCache]: Analyzing trace with hash 166596039, now seen corresponding path program 1 times [2019-11-28 18:12:52,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:52,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485284357] [2019-11-28 18:12:52,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:52,605 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:12:52,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485284357] [2019-11-28 18:12:52,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:52,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:52,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690515445] [2019-11-28 18:12:52,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:52,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:52,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:52,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:52,607 INFO L87 Difference]: Start difference. First operand 16742 states and 62266 transitions. Second operand 4 states. [2019-11-28 18:12:52,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:52,837 INFO L93 Difference]: Finished difference Result 20458 states and 74724 transitions. [2019-11-28 18:12:52,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:12:52,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-28 18:12:52,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:52,900 INFO L225 Difference]: With dead ends: 20458 [2019-11-28 18:12:52,901 INFO L226 Difference]: Without dead ends: 20438 [2019-11-28 18:12:52,901 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:12:53,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20438 states. [2019-11-28 18:12:53,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20438 to 17660. [2019-11-28 18:12:53,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17660 states. [2019-11-28 18:12:53,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17660 states to 17660 states and 65445 transitions. [2019-11-28 18:12:53,525 INFO L78 Accepts]: Start accepts. Automaton has 17660 states and 65445 transitions. Word has length 16 [2019-11-28 18:12:53,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:53,526 INFO L462 AbstractCegarLoop]: Abstraction has 17660 states and 65445 transitions. [2019-11-28 18:12:53,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:53,526 INFO L276 IsEmpty]: Start isEmpty. Operand 17660 states and 65445 transitions. [2019-11-28 18:12:53,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:12:53,532 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:53,532 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:12:53,532 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:12:53,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:53,533 INFO L82 PathProgramCache]: Analyzing trace with hash 289916209, now seen corresponding path program 1 times [2019-11-28 18:12:53,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:53,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361870103] [2019-11-28 18:12:53,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:53,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:53,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:53,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361870103] [2019-11-28 18:12:53,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:53,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:53,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431792726] [2019-11-28 18:12:53,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:53,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:53,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:53,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:53,595 INFO L87 Difference]: Start difference. First operand 17660 states and 65445 transitions. Second operand 4 states. [2019-11-28 18:12:54,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:54,128 INFO L93 Difference]: Finished difference Result 22396 states and 81911 transitions. [2019-11-28 18:12:54,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:12:54,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-28 18:12:54,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:54,194 INFO L225 Difference]: With dead ends: 22396 [2019-11-28 18:12:54,194 INFO L226 Difference]: Without dead ends: 22368 [2019-11-28 18:12:54,194 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:12:54,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22368 states. [2019-11-28 18:12:54,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22368 to 18470. [2019-11-28 18:12:54,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18470 states. [2019-11-28 18:12:54,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18470 states to 18470 states and 68496 transitions. [2019-11-28 18:12:54,787 INFO L78 Accepts]: Start accepts. Automaton has 18470 states and 68496 transitions. Word has length 16 [2019-11-28 18:12:54,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:54,788 INFO L462 AbstractCegarLoop]: Abstraction has 18470 states and 68496 transitions. [2019-11-28 18:12:54,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:54,788 INFO L276 IsEmpty]: Start isEmpty. Operand 18470 states and 68496 transitions. [2019-11-28 18:12:54,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 18:12:54,801 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:54,801 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:54,801 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:12:54,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:54,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1946092179, now seen corresponding path program 1 times [2019-11-28 18:12:54,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:54,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912596396] [2019-11-28 18:12:54,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:54,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:54,897 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:12:54,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912596396] [2019-11-28 18:12:54,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:54,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:12:54,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071229248] [2019-11-28 18:12:54,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:54,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:54,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:54,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:54,900 INFO L87 Difference]: Start difference. First operand 18470 states and 68496 transitions. Second operand 3 states. [2019-11-28 18:12:55,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:55,049 INFO L93 Difference]: Finished difference Result 18412 states and 68120 transitions. [2019-11-28 18:12:55,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:55,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 18:12:55,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:55,120 INFO L225 Difference]: With dead ends: 18412 [2019-11-28 18:12:55,120 INFO L226 Difference]: Without dead ends: 18412 [2019-11-28 18:12:55,121 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:12:55,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18412 states. [2019-11-28 18:12:55,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18412 to 18360. [2019-11-28 18:12:55,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18360 states. [2019-11-28 18:12:56,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18360 states to 18360 states and 68030 transitions. [2019-11-28 18:12:56,041 INFO L78 Accepts]: Start accepts. Automaton has 18360 states and 68030 transitions. Word has length 18 [2019-11-28 18:12:56,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:56,042 INFO L462 AbstractCegarLoop]: Abstraction has 18360 states and 68030 transitions. [2019-11-28 18:12:56,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:56,042 INFO L276 IsEmpty]: Start isEmpty. Operand 18360 states and 68030 transitions. [2019-11-28 18:12:56,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 18:12:56,053 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:56,053 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:56,053 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:12:56,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:56,054 INFO L82 PathProgramCache]: Analyzing trace with hash 631217210, now seen corresponding path program 1 times [2019-11-28 18:12:56,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:56,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322212094] [2019-11-28 18:12:56,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:56,128 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:12:56,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322212094] [2019-11-28 18:12:56,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:56,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:56,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124110727] [2019-11-28 18:12:56,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:56,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:56,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:56,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:56,130 INFO L87 Difference]: Start difference. First operand 18360 states and 68030 transitions. Second operand 4 states. [2019-11-28 18:12:56,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:56,162 INFO L93 Difference]: Finished difference Result 2242 states and 5899 transitions. [2019-11-28 18:12:56,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:12:56,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-28 18:12:56,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:56,167 INFO L225 Difference]: With dead ends: 2242 [2019-11-28 18:12:56,168 INFO L226 Difference]: Without dead ends: 2242 [2019-11-28 18:12:56,169 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:12:56,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states. [2019-11-28 18:12:56,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 2242. [2019-11-28 18:12:56,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2242 states. [2019-11-28 18:12:56,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 5899 transitions. [2019-11-28 18:12:56,208 INFO L78 Accepts]: Start accepts. Automaton has 2242 states and 5899 transitions. Word has length 19 [2019-11-28 18:12:56,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:56,209 INFO L462 AbstractCegarLoop]: Abstraction has 2242 states and 5899 transitions. [2019-11-28 18:12:56,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:56,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2242 states and 5899 transitions. [2019-11-28 18:12:56,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 18:12:56,214 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:56,214 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] [2019-11-28 18:12:56,214 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:12:56,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:56,214 INFO L82 PathProgramCache]: Analyzing trace with hash -45017831, now seen corresponding path program 1 times [2019-11-28 18:12:56,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:56,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071816442] [2019-11-28 18:12:56,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:56,310 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:12:56,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071816442] [2019-11-28 18:12:56,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:56,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:12:56,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753447494] [2019-11-28 18:12:56,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:12:56,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:56,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:12:56,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:56,313 INFO L87 Difference]: Start difference. First operand 2242 states and 5899 transitions. Second operand 5 states. [2019-11-28 18:12:56,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:56,344 INFO L93 Difference]: Finished difference Result 1366 states and 3668 transitions. [2019-11-28 18:12:56,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:12:56,344 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-28 18:12:56,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:56,348 INFO L225 Difference]: With dead ends: 1366 [2019-11-28 18:12:56,348 INFO L226 Difference]: Without dead ends: 1366 [2019-11-28 18:12:56,349 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:12:56,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2019-11-28 18:12:56,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1282. [2019-11-28 18:12:56,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1282 states. [2019-11-28 18:12:56,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 3460 transitions. [2019-11-28 18:12:56,368 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 3460 transitions. Word has length 29 [2019-11-28 18:12:56,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:56,368 INFO L462 AbstractCegarLoop]: Abstraction has 1282 states and 3460 transitions. [2019-11-28 18:12:56,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:12:56,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 3460 transitions. [2019-11-28 18:12:56,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-28 18:12:56,375 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:56,375 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] [2019-11-28 18:12:56,375 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:12:56,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:56,376 INFO L82 PathProgramCache]: Analyzing trace with hash -651252201, now seen corresponding path program 1 times [2019-11-28 18:12:56,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:56,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299080117] [2019-11-28 18:12:56,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:56,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:56,529 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:12:56,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299080117] [2019-11-28 18:12:56,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:56,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:56,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072627088] [2019-11-28 18:12:56,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:56,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:56,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:56,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:56,537 INFO L87 Difference]: Start difference. First operand 1282 states and 3460 transitions. Second operand 3 states. [2019-11-28 18:12:56,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:56,552 INFO L93 Difference]: Finished difference Result 1280 states and 3455 transitions. [2019-11-28 18:12:56,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:56,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-28 18:12:56,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:56,556 INFO L225 Difference]: With dead ends: 1280 [2019-11-28 18:12:56,556 INFO L226 Difference]: Without dead ends: 1280 [2019-11-28 18:12:56,556 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:12:56,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2019-11-28 18:12:56,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 1150. [2019-11-28 18:12:56,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1150 states. [2019-11-28 18:12:56,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 3150 transitions. [2019-11-28 18:12:56,575 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 3150 transitions. Word has length 44 [2019-11-28 18:12:56,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:56,575 INFO L462 AbstractCegarLoop]: Abstraction has 1150 states and 3150 transitions. [2019-11-28 18:12:56,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:56,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 3150 transitions. [2019-11-28 18:12:56,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:12:56,580 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:56,580 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] [2019-11-28 18:12:56,580 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:12:56,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:56,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1405116581, now seen corresponding path program 1 times [2019-11-28 18:12:56,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:56,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224107660] [2019-11-28 18:12:56,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:56,695 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:12:56,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224107660] [2019-11-28 18:12:56,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:56,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:12:56,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887623642] [2019-11-28 18:12:56,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:12:56,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:56,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:12:56,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:56,698 INFO L87 Difference]: Start difference. First operand 1150 states and 3150 transitions. Second operand 5 states. [2019-11-28 18:12:56,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:56,745 INFO L93 Difference]: Finished difference Result 1717 states and 4426 transitions. [2019-11-28 18:12:56,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:12:56,746 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-28 18:12:56,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:56,747 INFO L225 Difference]: With dead ends: 1717 [2019-11-28 18:12:56,747 INFO L226 Difference]: Without dead ends: 605 [2019-11-28 18:12:56,747 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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:12:56,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-11-28 18:12:56,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2019-11-28 18:12:56,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-11-28 18:12:56,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1347 transitions. [2019-11-28 18:12:56,757 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1347 transitions. Word has length 45 [2019-11-28 18:12:56,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:56,757 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1347 transitions. [2019-11-28 18:12:56,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:12:56,757 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1347 transitions. [2019-11-28 18:12:56,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:12:56,760 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:56,760 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] [2019-11-28 18:12:56,760 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:12:56,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:56,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1055766469, now seen corresponding path program 2 times [2019-11-28 18:12:56,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:56,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565039085] [2019-11-28 18:12:56,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:56,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:56,901 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:12:56,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565039085] [2019-11-28 18:12:56,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:56,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:56,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280800676] [2019-11-28 18:12:56,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:56,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:56,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:56,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:56,904 INFO L87 Difference]: Start difference. First operand 605 states and 1347 transitions. Second operand 4 states. [2019-11-28 18:12:56,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:56,922 INFO L93 Difference]: Finished difference Result 990 states and 2216 transitions. [2019-11-28 18:12:56,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:12:56,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-28 18:12:56,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:56,924 INFO L225 Difference]: With dead ends: 990 [2019-11-28 18:12:56,924 INFO L226 Difference]: Without dead ends: 406 [2019-11-28 18:12:56,924 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:12:56,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-11-28 18:12:56,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2019-11-28 18:12:56,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-11-28 18:12:56,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 902 transitions. [2019-11-28 18:12:56,930 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 902 transitions. Word has length 45 [2019-11-28 18:12:56,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:56,931 INFO L462 AbstractCegarLoop]: Abstraction has 406 states and 902 transitions. [2019-11-28 18:12:56,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:56,931 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 902 transitions. [2019-11-28 18:12:56,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:12:56,932 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:56,933 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] [2019-11-28 18:12:56,933 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:12:56,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:56,933 INFO L82 PathProgramCache]: Analyzing trace with hash -252375621, now seen corresponding path program 3 times [2019-11-28 18:12:56,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:56,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170874239] [2019-11-28 18:12:56,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:12:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:12:57,070 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:12:57,070 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:12:57,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_76| 0 0))) (and (= 0 v_~weak$$choice0~0_10) (= v_~y$w_buff1~0_255 0) (= 0 v_~y$w_buff0~0_383) (= v_~a~0_43 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t922~0.base_38| 4)) (= v_~y$r_buff0_thd1~0_30 0) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~y$w_buff0_used~0_658 0) (= 0 v_~__unbuffered_p0_EAX~0_49) (= v_~z~0_82 0) (= v_~y$read_delayed~0_8 0) (= v_~x~0_24 0) (= v_~weak$$choice2~0_156 0) (= v_~__unbuffered_cnt~0_101 0) (= 0 v_~y$r_buff1_thd2~0_256) (= 0 |v_ULTIMATE.start_main_~#t922~0.offset_26|) (= v_~y$w_buff1_used~0_429 0) (= 0 v_~y$r_buff0_thd3~0_155) (< 0 |v_#StackHeapBarrier_18|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t922~0.base_38|) (= 0 v_~y$flush_delayed~0_35) (= 0 |v_#NULL.base_4|) (= v_~main$tmp_guard0~0_20 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t922~0.base_38| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t922~0.base_38|) |v_ULTIMATE.start_main_~#t922~0.offset_26| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_p1_EAX~0_63) (= 0 v_~__unbuffered_p2_EAX~0_107) (= v_~y$mem_tmp~0_12 0) (= v_~y~0_134 0) (= |v_#NULL.offset_4| 0) (= 0 v_~y$read_delayed_var~0.base_8) (= |v_#valid_74| (store .cse0 |v_ULTIMATE.start_main_~#t922~0.base_38| 1)) (= 0 v_~y$r_buff0_thd2~0_301) (= v_~y$r_buff1_thd0~0_160 0) (= v_~__unbuffered_p2_EBX~0_107 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t922~0.base_38|)) (= 0 v_~y$r_buff1_thd1~0_80) (= 0 v_~y$r_buff1_thd3~0_129) (= v_~y$r_buff0_thd0~0_90 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_18|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_20|, #NULL.offset=|v_#NULL.offset_4|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~a~0=v_~a~0_43, ~y$mem_tmp~0=v_~y$mem_tmp~0_12, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_49, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_129, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_63, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_30, ~y$flush_delayed~0=v_~y$flush_delayed~0_35, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_107, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_107, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_32|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_68|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_34|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_79|, ~y$w_buff1~0=v_~y$w_buff1~0_255, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_301, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_160, ~x~0=v_~x~0_24, ULTIMATE.start_main_~#t924~0.base=|v_ULTIMATE.start_main_~#t924~0.base_32|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_658, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_80, ~y$w_buff0~0=v_~y$w_buff0~0_383, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_155, ULTIMATE.start_main_~#t922~0.offset=|v_ULTIMATE.start_main_~#t922~0.offset_26|, ~y~0=v_~y~0_134, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_66|, ULTIMATE.start_main_~#t923~0.offset=|v_ULTIMATE.start_main_~#t923~0.offset_27|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_66|, ULTIMATE.start_main_~#t923~0.base=|v_ULTIMATE.start_main_~#t923~0.base_40|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_256, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_90, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t924~0.offset=|v_ULTIMATE.start_main_~#t924~0.offset_19|, ULTIMATE.start_main_~#t922~0.base=|v_ULTIMATE.start_main_~#t922~0.base_38|, ~z~0=v_~z~0_82, ~weak$$choice2~0=v_~weak$$choice2~0_156, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_429} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, #NULL.offset, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~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~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~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, ULTIMATE.start_main_~#t924~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t922~0.offset, ~y~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_~#t923~0.offset, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t923~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_~#t924~0.offset, ULTIMATE.start_main_~#t922~0.base, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:12:57,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L822-1-->L824: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t923~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t923~0.base_13|) |v_ULTIMATE.start_main_~#t923~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t923~0.base_13| 4)) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t923~0.base_13|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t923~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t923~0.base_13| 0)) (= 0 |v_ULTIMATE.start_main_~#t923~0.offset_11|) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t923~0.base_13| 1) |v_#valid_38|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t923~0.offset=|v_ULTIMATE.start_main_~#t923~0.offset_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t923~0.base=|v_ULTIMATE.start_main_~#t923~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t923~0.offset, #length, ULTIMATE.start_main_~#t923~0.base] because there is no mapped edge [2019-11-28 18:12:57,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L824-1-->L826: Formula: (and (not (= |v_ULTIMATE.start_main_~#t924~0.base_12| 0)) (= 0 |v_ULTIMATE.start_main_~#t924~0.offset_10|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t924~0.base_12| 4) |v_#length_15|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t924~0.base_12| 1) |v_#valid_34|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t924~0.base_12|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t924~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t924~0.base_12|) |v_ULTIMATE.start_main_~#t924~0.offset_10| 2))) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t924~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t924~0.base=|v_ULTIMATE.start_main_~#t924~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t924~0.offset=|v_ULTIMATE.start_main_~#t924~0.offset_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t924~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t924~0.offset, #length] because there is no mapped edge [2019-11-28 18:12:57,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [606] [606] L4-->L799: Formula: (and (= v_~y$r_buff0_thd3~0_16 v_~y$r_buff1_thd3~0_10) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_4)) (= v_~__unbuffered_p2_EBX~0_4 v_~a~0_4) (= 1 v_~z~0_3) (= v_~y$r_buff0_thd0~0_18 v_~y$r_buff1_thd0~0_10) (= v_~y$r_buff1_thd1~0_3 v_~y$r_buff0_thd1~0_3) (= v_~__unbuffered_p2_EAX~0_4 v_~z~0_3) (= v_~y$r_buff0_thd3~0_15 1) (= v_~y$r_buff0_thd2~0_37 v_~y$r_buff1_thd2~0_23)) InVars {~a~0=v_~a~0_4, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_16, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_18, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_3, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_4} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_4, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_4, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_23, ~a~0=v_~a~0_4, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_3, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_10, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_15, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_18, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_4, ~z~0=v_~z~0_3, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:12:57,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_18 v_~__unbuffered_p0_EAX~0_19) (= 0 |v_P0Thread1of1ForFork0_#res.base_9|) (= v_P0Thread1of1ForFork0_~arg.base_13 |v_P0Thread1of1ForFork0_#in~arg.base_15|) (= |v_P0Thread1of1ForFork0_#res.offset_9| 0) (= v_~a~0_27 1) (= v_P0Thread1of1ForFork0_~arg.offset_13 |v_P0Thread1of1ForFork0_#in~arg.offset_15|) (= v_~__unbuffered_cnt~0_76 (+ v_~__unbuffered_cnt~0_77 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, ~x~0=v_~x~0_18} OutVars{~a~0=v_~a~0_27, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_19, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_9|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_13, ~x~0=v_~x~0_18, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_13} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-11-28 18:12:57,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L758-->L758-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-2071145013 256)))) (or (and (= ~y$w_buff0~0_In-2071145013 |P1Thread1of1ForFork1_#t~ite8_Out-2071145013|) (= |P1Thread1of1ForFork1_#t~ite9_Out-2071145013| |P1Thread1of1ForFork1_#t~ite8_Out-2071145013|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-2071145013 256)))) (or (and (= (mod ~y$r_buff1_thd2~0_In-2071145013 256) 0) .cse0) (and .cse0 (= (mod ~y$w_buff1_used~0_In-2071145013 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-2071145013 256)))) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite8_In-2071145013| |P1Thread1of1ForFork1_#t~ite8_Out-2071145013|) (not .cse1) (= ~y$w_buff0~0_In-2071145013 |P1Thread1of1ForFork1_#t~ite9_Out-2071145013|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2071145013, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2071145013, ~y$w_buff0~0=~y$w_buff0~0_In-2071145013, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2071145013, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In-2071145013|, ~weak$$choice2~0=~weak$$choice2~0_In-2071145013, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2071145013} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2071145013, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2071145013, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-2071145013|, ~y$w_buff0~0=~y$w_buff0~0_In-2071145013, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2071145013, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out-2071145013|, ~weak$$choice2~0=~weak$$choice2~0_In-2071145013, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2071145013} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-11-28 18:12:57,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L762-->L763: Formula: (and (not (= (mod v_~weak$$choice2~0_22 256) 0)) (= v_~y$r_buff0_thd2~0_85 v_~y$r_buff0_thd2~0_84)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_14|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_10|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_84, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_22} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:12:57,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1219430838 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite23_Out-1219430838| ~y$r_buff1_thd2~0_In-1219430838) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1219430838 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-1219430838 256)) .cse1) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-1219430838 256) 0)) (= (mod ~y$w_buff0_used~0_In-1219430838 256) 0))) (= |P1Thread1of1ForFork1_#t~ite24_Out-1219430838| |P1Thread1of1ForFork1_#t~ite23_Out-1219430838|)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite23_In-1219430838| |P1Thread1of1ForFork1_#t~ite23_Out-1219430838|) (= |P1Thread1of1ForFork1_#t~ite24_Out-1219430838| ~y$r_buff1_thd2~0_In-1219430838)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1219430838, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1219430838, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1219430838, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1219430838|, ~weak$$choice2~0=~weak$$choice2~0_In-1219430838, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1219430838} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1219430838, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1219430838, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1219430838, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1219430838|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1219430838|, ~weak$$choice2~0=~weak$$choice2~0_In-1219430838, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1219430838} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-11-28 18:12:57,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [615] [615] L765-->L773: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 v_~y$flush_delayed~0_8) (not (= 0 (mod v_~y$flush_delayed~0_9 256))) (= v_~y~0_14 v_~y$mem_tmp~0_4)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~y~0=v_~y~0_14, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_9|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-11-28 18:12:57,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-663050372 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-663050372 256)))) (or (and (= ~y$w_buff0_used~0_In-663050372 |P2Thread1of1ForFork2_#t~ite28_Out-663050372|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite28_Out-663050372|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-663050372, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-663050372} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-663050372, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-663050372, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out-663050372|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-11-28 18:12:57,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In508590166 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In508590166 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In508590166 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In508590166 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite29_Out508590166| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P2Thread1of1ForFork2_#t~ite29_Out508590166| ~y$w_buff1_used~0_In508590166)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In508590166, ~y$w_buff0_used~0=~y$w_buff0_used~0_In508590166, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In508590166, ~y$w_buff1_used~0=~y$w_buff1_used~0_In508590166} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In508590166, ~y$w_buff0_used~0=~y$w_buff0_used~0_In508590166, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In508590166, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out508590166|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In508590166} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-11-28 18:12:57,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L802-->L803: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1908376772 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-1908376772 256))) (.cse1 (= ~y$r_buff0_thd3~0_In-1908376772 ~y$r_buff0_thd3~0_Out-1908376772))) (or (and .cse0 .cse1) (and (not .cse0) (not .cse2) (= ~y$r_buff0_thd3~0_Out-1908376772 0)) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1908376772, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1908376772} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1908376772, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-1908376772|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1908376772} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-11-28 18:12:57,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L803-->L803-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-1088995816 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1088995816 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-1088995816 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1088995816 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite31_Out-1088995816|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd3~0_In-1088995816 |P2Thread1of1ForFork2_#t~ite31_Out-1088995816|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1088995816, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1088995816, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1088995816, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1088995816} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1088995816, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1088995816, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out-1088995816|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1088995816, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1088995816} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-11-28 18:12:57,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L803-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite31_26| v_~y$r_buff1_thd3~0_47)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_47, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_25|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-11-28 18:12:57,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [610] [610] L826-1-->L832: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_13) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:12:57,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L832-2-->L832-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In597800782 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In597800782 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite35_Out597800782| ~y$w_buff1~0_In597800782) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite35_Out597800782| ~y~0_In597800782) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In597800782, ~y~0=~y~0_In597800782, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In597800782, ~y$w_buff1_used~0=~y$w_buff1_used~0_In597800782} OutVars{~y$w_buff1~0=~y$w_buff1~0_In597800782, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out597800782|, ~y~0=~y~0_In597800782, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In597800782, ~y$w_buff1_used~0=~y$w_buff1_used~0_In597800782} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-11-28 18:12:57,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L832-4-->L833: Formula: (= v_~y~0_55 |v_ULTIMATE.start_main_#t~ite35_32|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_32|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_33|, ~y~0=v_~y~0_55} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-11-28 18:12:57,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-2120013689 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-2120013689 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite37_Out-2120013689|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-2120013689 |ULTIMATE.start_main_#t~ite37_Out-2120013689|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2120013689, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2120013689} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2120013689, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2120013689, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-2120013689|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:12:57,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L834-->L834-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1139098528 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1139098528 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1139098528 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In1139098528 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1139098528 |ULTIMATE.start_main_#t~ite38_Out1139098528|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite38_Out1139098528|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1139098528, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1139098528, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1139098528, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1139098528} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1139098528, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1139098528, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1139098528|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1139098528, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1139098528} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:12:57,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L835-->L835-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1238851628 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1238851628 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out1238851628| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In1238851628 |ULTIMATE.start_main_#t~ite39_Out1238851628|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1238851628, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1238851628} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1238851628, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1238851628|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1238851628} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:12:57,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L836-->L836-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-185546599 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-185546599 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-185546599 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-185546599 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-185546599| ~y$r_buff1_thd0~0_In-185546599) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite40_Out-185546599| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-185546599, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-185546599, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-185546599, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-185546599} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-185546599|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-185546599, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-185546599, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-185546599, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-185546599} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:12:57,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|) (= v_~y$r_buff1_thd0~0_131 |v_ULTIMATE.start_main_#t~ite40_46|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~main$tmp_guard1~0_20 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_84 0) (= 1 v_~__unbuffered_p2_EAX~0_84) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~__unbuffered_p0_EAX~0_34))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_84, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_84} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_84, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_84, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_131, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:12:57,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:12:57 BasicIcfg [2019-11-28 18:12:57,212 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:12:57,212 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:12:57,212 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:12:57,213 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:12:57,213 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:12:42" (3/4) ... [2019-11-28 18:12:57,216 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:12:57,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_76| 0 0))) (and (= 0 v_~weak$$choice0~0_10) (= v_~y$w_buff1~0_255 0) (= 0 v_~y$w_buff0~0_383) (= v_~a~0_43 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t922~0.base_38| 4)) (= v_~y$r_buff0_thd1~0_30 0) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~y$w_buff0_used~0_658 0) (= 0 v_~__unbuffered_p0_EAX~0_49) (= v_~z~0_82 0) (= v_~y$read_delayed~0_8 0) (= v_~x~0_24 0) (= v_~weak$$choice2~0_156 0) (= v_~__unbuffered_cnt~0_101 0) (= 0 v_~y$r_buff1_thd2~0_256) (= 0 |v_ULTIMATE.start_main_~#t922~0.offset_26|) (= v_~y$w_buff1_used~0_429 0) (= 0 v_~y$r_buff0_thd3~0_155) (< 0 |v_#StackHeapBarrier_18|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t922~0.base_38|) (= 0 v_~y$flush_delayed~0_35) (= 0 |v_#NULL.base_4|) (= v_~main$tmp_guard0~0_20 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t922~0.base_38| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t922~0.base_38|) |v_ULTIMATE.start_main_~#t922~0.offset_26| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_p1_EAX~0_63) (= 0 v_~__unbuffered_p2_EAX~0_107) (= v_~y$mem_tmp~0_12 0) (= v_~y~0_134 0) (= |v_#NULL.offset_4| 0) (= 0 v_~y$read_delayed_var~0.base_8) (= |v_#valid_74| (store .cse0 |v_ULTIMATE.start_main_~#t922~0.base_38| 1)) (= 0 v_~y$r_buff0_thd2~0_301) (= v_~y$r_buff1_thd0~0_160 0) (= v_~__unbuffered_p2_EBX~0_107 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t922~0.base_38|)) (= 0 v_~y$r_buff1_thd1~0_80) (= 0 v_~y$r_buff1_thd3~0_129) (= v_~y$r_buff0_thd0~0_90 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_18|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_20|, #NULL.offset=|v_#NULL.offset_4|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~a~0=v_~a~0_43, ~y$mem_tmp~0=v_~y$mem_tmp~0_12, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_49, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_129, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_63, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_30, ~y$flush_delayed~0=v_~y$flush_delayed~0_35, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_107, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_107, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_32|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_68|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_34|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_79|, ~y$w_buff1~0=v_~y$w_buff1~0_255, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_301, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_160, ~x~0=v_~x~0_24, ULTIMATE.start_main_~#t924~0.base=|v_ULTIMATE.start_main_~#t924~0.base_32|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_658, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_80, ~y$w_buff0~0=v_~y$w_buff0~0_383, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_155, ULTIMATE.start_main_~#t922~0.offset=|v_ULTIMATE.start_main_~#t922~0.offset_26|, ~y~0=v_~y~0_134, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_66|, ULTIMATE.start_main_~#t923~0.offset=|v_ULTIMATE.start_main_~#t923~0.offset_27|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_66|, ULTIMATE.start_main_~#t923~0.base=|v_ULTIMATE.start_main_~#t923~0.base_40|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_256, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_90, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t924~0.offset=|v_ULTIMATE.start_main_~#t924~0.offset_19|, ULTIMATE.start_main_~#t922~0.base=|v_ULTIMATE.start_main_~#t922~0.base_38|, ~z~0=v_~z~0_82, ~weak$$choice2~0=v_~weak$$choice2~0_156, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_429} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, #NULL.offset, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~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~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~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, ULTIMATE.start_main_~#t924~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t922~0.offset, ~y~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_~#t923~0.offset, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t923~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_~#t924~0.offset, ULTIMATE.start_main_~#t922~0.base, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:12:57,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L822-1-->L824: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t923~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t923~0.base_13|) |v_ULTIMATE.start_main_~#t923~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t923~0.base_13| 4)) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t923~0.base_13|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t923~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t923~0.base_13| 0)) (= 0 |v_ULTIMATE.start_main_~#t923~0.offset_11|) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t923~0.base_13| 1) |v_#valid_38|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t923~0.offset=|v_ULTIMATE.start_main_~#t923~0.offset_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t923~0.base=|v_ULTIMATE.start_main_~#t923~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t923~0.offset, #length, ULTIMATE.start_main_~#t923~0.base] because there is no mapped edge [2019-11-28 18:12:57,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L824-1-->L826: Formula: (and (not (= |v_ULTIMATE.start_main_~#t924~0.base_12| 0)) (= 0 |v_ULTIMATE.start_main_~#t924~0.offset_10|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t924~0.base_12| 4) |v_#length_15|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t924~0.base_12| 1) |v_#valid_34|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t924~0.base_12|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t924~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t924~0.base_12|) |v_ULTIMATE.start_main_~#t924~0.offset_10| 2))) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t924~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t924~0.base=|v_ULTIMATE.start_main_~#t924~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t924~0.offset=|v_ULTIMATE.start_main_~#t924~0.offset_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t924~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t924~0.offset, #length] because there is no mapped edge [2019-11-28 18:12:57,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [606] [606] L4-->L799: Formula: (and (= v_~y$r_buff0_thd3~0_16 v_~y$r_buff1_thd3~0_10) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_4)) (= v_~__unbuffered_p2_EBX~0_4 v_~a~0_4) (= 1 v_~z~0_3) (= v_~y$r_buff0_thd0~0_18 v_~y$r_buff1_thd0~0_10) (= v_~y$r_buff1_thd1~0_3 v_~y$r_buff0_thd1~0_3) (= v_~__unbuffered_p2_EAX~0_4 v_~z~0_3) (= v_~y$r_buff0_thd3~0_15 1) (= v_~y$r_buff0_thd2~0_37 v_~y$r_buff1_thd2~0_23)) InVars {~a~0=v_~a~0_4, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_16, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_18, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_3, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_4} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_4, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_4, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_23, ~a~0=v_~a~0_4, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_3, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_10, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_15, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_18, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_4, ~z~0=v_~z~0_3, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:12:57,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_18 v_~__unbuffered_p0_EAX~0_19) (= 0 |v_P0Thread1of1ForFork0_#res.base_9|) (= v_P0Thread1of1ForFork0_~arg.base_13 |v_P0Thread1of1ForFork0_#in~arg.base_15|) (= |v_P0Thread1of1ForFork0_#res.offset_9| 0) (= v_~a~0_27 1) (= v_P0Thread1of1ForFork0_~arg.offset_13 |v_P0Thread1of1ForFork0_#in~arg.offset_15|) (= v_~__unbuffered_cnt~0_76 (+ v_~__unbuffered_cnt~0_77 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, ~x~0=v_~x~0_18} OutVars{~a~0=v_~a~0_27, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_19, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_9|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_13, ~x~0=v_~x~0_18, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_13} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-11-28 18:12:57,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L758-->L758-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-2071145013 256)))) (or (and (= ~y$w_buff0~0_In-2071145013 |P1Thread1of1ForFork1_#t~ite8_Out-2071145013|) (= |P1Thread1of1ForFork1_#t~ite9_Out-2071145013| |P1Thread1of1ForFork1_#t~ite8_Out-2071145013|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-2071145013 256)))) (or (and (= (mod ~y$r_buff1_thd2~0_In-2071145013 256) 0) .cse0) (and .cse0 (= (mod ~y$w_buff1_used~0_In-2071145013 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-2071145013 256)))) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite8_In-2071145013| |P1Thread1of1ForFork1_#t~ite8_Out-2071145013|) (not .cse1) (= ~y$w_buff0~0_In-2071145013 |P1Thread1of1ForFork1_#t~ite9_Out-2071145013|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2071145013, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2071145013, ~y$w_buff0~0=~y$w_buff0~0_In-2071145013, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2071145013, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In-2071145013|, ~weak$$choice2~0=~weak$$choice2~0_In-2071145013, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2071145013} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2071145013, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2071145013, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-2071145013|, ~y$w_buff0~0=~y$w_buff0~0_In-2071145013, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2071145013, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out-2071145013|, ~weak$$choice2~0=~weak$$choice2~0_In-2071145013, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2071145013} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-11-28 18:12:57,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L762-->L763: Formula: (and (not (= (mod v_~weak$$choice2~0_22 256) 0)) (= v_~y$r_buff0_thd2~0_85 v_~y$r_buff0_thd2~0_84)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_14|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_10|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_84, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_22} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:12:57,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1219430838 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite23_Out-1219430838| ~y$r_buff1_thd2~0_In-1219430838) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1219430838 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-1219430838 256)) .cse1) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-1219430838 256) 0)) (= (mod ~y$w_buff0_used~0_In-1219430838 256) 0))) (= |P1Thread1of1ForFork1_#t~ite24_Out-1219430838| |P1Thread1of1ForFork1_#t~ite23_Out-1219430838|)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite23_In-1219430838| |P1Thread1of1ForFork1_#t~ite23_Out-1219430838|) (= |P1Thread1of1ForFork1_#t~ite24_Out-1219430838| ~y$r_buff1_thd2~0_In-1219430838)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1219430838, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1219430838, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1219430838, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1219430838|, ~weak$$choice2~0=~weak$$choice2~0_In-1219430838, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1219430838} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1219430838, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1219430838, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1219430838, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1219430838|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1219430838|, ~weak$$choice2~0=~weak$$choice2~0_In-1219430838, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1219430838} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-11-28 18:12:57,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [615] [615] L765-->L773: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 v_~y$flush_delayed~0_8) (not (= 0 (mod v_~y$flush_delayed~0_9 256))) (= v_~y~0_14 v_~y$mem_tmp~0_4)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~y~0=v_~y~0_14, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_9|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-11-28 18:12:57,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-663050372 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-663050372 256)))) (or (and (= ~y$w_buff0_used~0_In-663050372 |P2Thread1of1ForFork2_#t~ite28_Out-663050372|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite28_Out-663050372|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-663050372, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-663050372} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-663050372, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-663050372, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out-663050372|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-11-28 18:12:57,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In508590166 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In508590166 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In508590166 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In508590166 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite29_Out508590166| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P2Thread1of1ForFork2_#t~ite29_Out508590166| ~y$w_buff1_used~0_In508590166)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In508590166, ~y$w_buff0_used~0=~y$w_buff0_used~0_In508590166, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In508590166, ~y$w_buff1_used~0=~y$w_buff1_used~0_In508590166} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In508590166, ~y$w_buff0_used~0=~y$w_buff0_used~0_In508590166, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In508590166, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out508590166|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In508590166} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-11-28 18:12:57,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L802-->L803: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1908376772 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-1908376772 256))) (.cse1 (= ~y$r_buff0_thd3~0_In-1908376772 ~y$r_buff0_thd3~0_Out-1908376772))) (or (and .cse0 .cse1) (and (not .cse0) (not .cse2) (= ~y$r_buff0_thd3~0_Out-1908376772 0)) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1908376772, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1908376772} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1908376772, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-1908376772|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1908376772} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-11-28 18:12:57,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L803-->L803-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-1088995816 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1088995816 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-1088995816 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1088995816 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite31_Out-1088995816|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd3~0_In-1088995816 |P2Thread1of1ForFork2_#t~ite31_Out-1088995816|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1088995816, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1088995816, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1088995816, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1088995816} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1088995816, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1088995816, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out-1088995816|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1088995816, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1088995816} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-11-28 18:12:57,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L803-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite31_26| v_~y$r_buff1_thd3~0_47)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_47, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_25|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-11-28 18:12:57,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [610] [610] L826-1-->L832: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_13) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:12:57,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L832-2-->L832-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In597800782 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In597800782 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite35_Out597800782| ~y$w_buff1~0_In597800782) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite35_Out597800782| ~y~0_In597800782) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In597800782, ~y~0=~y~0_In597800782, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In597800782, ~y$w_buff1_used~0=~y$w_buff1_used~0_In597800782} OutVars{~y$w_buff1~0=~y$w_buff1~0_In597800782, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out597800782|, ~y~0=~y~0_In597800782, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In597800782, ~y$w_buff1_used~0=~y$w_buff1_used~0_In597800782} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-11-28 18:12:57,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L832-4-->L833: Formula: (= v_~y~0_55 |v_ULTIMATE.start_main_#t~ite35_32|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_32|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_33|, ~y~0=v_~y~0_55} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-11-28 18:12:57,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-2120013689 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-2120013689 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite37_Out-2120013689|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-2120013689 |ULTIMATE.start_main_#t~ite37_Out-2120013689|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2120013689, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2120013689} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2120013689, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2120013689, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-2120013689|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:12:57,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L834-->L834-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1139098528 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1139098528 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1139098528 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In1139098528 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1139098528 |ULTIMATE.start_main_#t~ite38_Out1139098528|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite38_Out1139098528|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1139098528, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1139098528, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1139098528, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1139098528} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1139098528, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1139098528, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1139098528|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1139098528, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1139098528} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:12:57,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L835-->L835-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1238851628 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1238851628 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out1238851628| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In1238851628 |ULTIMATE.start_main_#t~ite39_Out1238851628|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1238851628, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1238851628} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1238851628, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1238851628|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1238851628} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:12:57,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L836-->L836-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-185546599 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-185546599 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-185546599 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-185546599 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-185546599| ~y$r_buff1_thd0~0_In-185546599) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite40_Out-185546599| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-185546599, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-185546599, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-185546599, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-185546599} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-185546599|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-185546599, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-185546599, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-185546599, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-185546599} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:12:57,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|) (= v_~y$r_buff1_thd0~0_131 |v_ULTIMATE.start_main_#t~ite40_46|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~main$tmp_guard1~0_20 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_84 0) (= 1 v_~__unbuffered_p2_EAX~0_84) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~__unbuffered_p0_EAX~0_34))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_84, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_84} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_84, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_84, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_131, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:12:57,358 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:12:57,359 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:12:57,360 INFO L168 Benchmark]: Toolchain (without parser) took 16699.11 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 903.9 MB). Free memory was 956.3 MB in the beginning and 1.3 GB in the end (delta: -351.2 MB). Peak memory consumption was 552.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:57,363 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:12:57,363 INFO L168 Benchmark]: CACSL2BoogieTranslator took 773.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -113.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:57,364 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:57,364 INFO L168 Benchmark]: Boogie Preprocessor took 44.20 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:12:57,364 INFO L168 Benchmark]: RCFGBuilder took 715.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:57,365 INFO L168 Benchmark]: TraceAbstraction took 14953.23 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 794.8 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -310.3 MB). Peak memory consumption was 484.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:57,365 INFO L168 Benchmark]: Witness Printer took 146.56 ms. Allocated memory is still 1.9 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:57,370 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 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 773.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -113.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.20 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 715.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14953.23 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 794.8 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -310.3 MB). Peak memory consumption was 484.6 MB. Max. memory is 11.5 GB. * Witness Printer took 146.56 ms. Allocated memory is still 1.9 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 154 ProgramPointsBefore, 71 ProgramPointsAfterwards, 179 TransitionsBefore, 79 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 21 ChoiceCompositions, 4868 VarBasedMoverChecksPositive, 199 VarBasedMoverChecksNegative, 61 SemBasedMoverChecksPositive, 174 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 44280 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t922, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L824] FCALL, FORK 0 pthread_create(&t923, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L826] FCALL, FORK 0 pthread_create(&t924, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 1 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L750] 2 x = 1 [L753] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 2 y$flush_delayed = weak$$choice2 [L756] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 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) [L799] 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 [!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, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 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)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 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)) [L760] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 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)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 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)) [L763] 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)) [L764] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 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) [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] 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 [L832] 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}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, 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] [L833] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L834] 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 [L835] 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, 145 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.6s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1063 SDtfs, 1070 SDslu, 1043 SDs, 0 SdLazy, 431 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18470occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 11822 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 313 NumberOfCodeBlocks, 313 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 257 ConstructedInterpolants, 0 QuantifiedInterpolants, 55995 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...