./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe034_pso.oepc.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/safe034_pso.oepc.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 984fe7a408c4b4bfd8e7c1f04541266588449597 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:33:46,269 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:33:46,271 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:33:46,292 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:33:46,293 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:33:46,295 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:33:46,297 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:33:46,307 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:33:46,311 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:33:46,312 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:33:46,314 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:33:46,316 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:33:46,316 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:33:46,317 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:33:46,318 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:33:46,319 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:33:46,320 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:33:46,321 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:33:46,323 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:33:46,325 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:33:46,326 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:33:46,327 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:33:46,329 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:33:46,330 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:33:46,332 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:33:46,332 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:33:46,332 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:33:46,334 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:33:46,334 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:33:46,335 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:33:46,335 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:33:46,336 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:33:46,337 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:33:46,338 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:33:46,339 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:33:46,339 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:33:46,340 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:33:46,341 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:33:46,341 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:33:46,342 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:33:46,343 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:33:46,344 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:33:46,370 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:33:46,370 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:33:46,372 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:33:46,373 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:33:46,373 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:33:46,374 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:33:46,374 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:33:46,374 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:33:46,374 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:33:46,375 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:33:46,376 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:33:46,376 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:33:46,376 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:33:46,377 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:33:46,377 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:33:46,378 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:33:46,378 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:33:46,378 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:33:46,379 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:33:46,379 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:33:46,379 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:33:46,380 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:33:46,380 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:33:46,380 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:33:46,381 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:33:46,381 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:33:46,381 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:33:46,382 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:33:46,382 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:33:46,382 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 -> 984fe7a408c4b4bfd8e7c1f04541266588449597 [2019-11-28 18:33:46,716 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:33:46,729 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:33:46,733 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:33:46,734 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:33:46,735 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:33:46,736 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe034_pso.oepc.i [2019-11-28 18:33:46,813 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/663c9bc7f/4dbffd82039949bbb3fa431bfdbea0c2/FLAG198e5b49f [2019-11-28 18:33:47,416 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:33:47,419 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe034_pso.oepc.i [2019-11-28 18:33:47,449 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/663c9bc7f/4dbffd82039949bbb3fa431bfdbea0c2/FLAG198e5b49f [2019-11-28 18:33:47,723 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/663c9bc7f/4dbffd82039949bbb3fa431bfdbea0c2 [2019-11-28 18:33:47,727 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:33:47,729 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:33:47,730 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:33:47,730 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:33:47,733 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:33:47,734 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:33:47" (1/1) ... [2019-11-28 18:33:47,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e727e30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:47, skipping insertion in model container [2019-11-28 18:33:47,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:33:47" (1/1) ... [2019-11-28 18:33:47,747 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:33:47,795 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:33:48,275 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:33:48,293 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:33:48,381 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:33:48,464 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:33:48,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:48 WrapperNode [2019-11-28 18:33:48,465 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:33:48,466 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:33:48,466 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:33:48,466 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:33:48,476 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:33:48" (1/1) ... [2019-11-28 18:33:48,497 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:33:48" (1/1) ... [2019-11-28 18:33:48,529 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:33:48,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:33:48,530 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:33:48,530 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:33:48,538 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:48" (1/1) ... [2019-11-28 18:33:48,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:48" (1/1) ... [2019-11-28 18:33:48,544 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:48" (1/1) ... [2019-11-28 18:33:48,544 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:48" (1/1) ... [2019-11-28 18:33:48,557 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:48" (1/1) ... [2019-11-28 18:33:48,562 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:48" (1/1) ... [2019-11-28 18:33:48,565 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:48" (1/1) ... [2019-11-28 18:33:48,571 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:33:48,572 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:33:48,572 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:33:48,572 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:33:48,573 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:33:48,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:33:48,644 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:33:48,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:33:48,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:33:48,645 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:33:48,645 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:33:48,645 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:33:48,645 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:33:48,645 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-11-28 18:33:48,646 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-11-28 18:33:48,646 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:33:48,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:33:48,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:33:48,648 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:33:49,375 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:33:49,375 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:33:49,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:33:49 BoogieIcfgContainer [2019-11-28 18:33:49,377 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:33:49,378 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:33:49,378 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:33:49,382 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:33:49,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:33:47" (1/3) ... [2019-11-28 18:33:49,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7adb3558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:33:49, skipping insertion in model container [2019-11-28 18:33:49,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:48" (2/3) ... [2019-11-28 18:33:49,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7adb3558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:33:49, skipping insertion in model container [2019-11-28 18:33:49,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:33:49" (3/3) ... [2019-11-28 18:33:49,386 INFO L109 eAbstractionObserver]: Analyzing ICFG safe034_pso.oepc.i [2019-11-28 18:33:49,397 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:33:49,398 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:33:49,406 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:33:49,407 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:33:49,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,446 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,446 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,449 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,450 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,482 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,482 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,482 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,483 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,483 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,510 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-28 18:33:49,528 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:33:49,528 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:33:49,528 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:33:49,528 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:33:49,529 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:33:49,529 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:33:49,529 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:33:49,529 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:33:49,547 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 176 transitions [2019-11-28 18:33:49,549 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-11-28 18:33:49,634 INFO L134 PetriNetUnfolder]: 35/173 cut-off events. [2019-11-28 18:33:49,634 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:33:49,652 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 560 event pairs. 9/145 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-11-28 18:33:49,675 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-11-28 18:33:49,754 INFO L134 PetriNetUnfolder]: 35/173 cut-off events. [2019-11-28 18:33:49,754 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:33:49,762 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 560 event pairs. 9/145 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-11-28 18:33:49,778 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-11-28 18:33:49,780 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:33:54,266 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-11-28 18:33:54,417 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-28 18:33:54,639 INFO L206 etLargeBlockEncoding]: Checked pairs total: 63936 [2019-11-28 18:33:54,640 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-11-28 18:33:54,644 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 73 places, 82 transitions [2019-11-28 18:33:56,136 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14042 states. [2019-11-28 18:33:56,139 INFO L276 IsEmpty]: Start isEmpty. Operand 14042 states. [2019-11-28 18:33:56,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 18:33:56,146 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:56,147 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:33:56,148 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:33:56,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:56,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1097508166, now seen corresponding path program 1 times [2019-11-28 18:33:56,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:56,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974556167] [2019-11-28 18:33:56,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:56,462 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:33:56,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974556167] [2019-11-28 18:33:56,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:56,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:33:56,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586201265] [2019-11-28 18:33:56,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:33:56,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:56,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:33:56,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:33:56,490 INFO L87 Difference]: Start difference. First operand 14042 states. Second operand 3 states. [2019-11-28 18:33:56,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:56,875 INFO L93 Difference]: Finished difference Result 13722 states and 52554 transitions. [2019-11-28 18:33:56,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:33:56,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-28 18:33:56,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:57,018 INFO L225 Difference]: With dead ends: 13722 [2019-11-28 18:33:57,019 INFO L226 Difference]: Without dead ends: 12214 [2019-11-28 18:33:57,020 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:33:57,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12214 states. [2019-11-28 18:33:57,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12214 to 12214. [2019-11-28 18:33:57,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12214 states. [2019-11-28 18:33:57,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12214 states to 12214 states and 46640 transitions. [2019-11-28 18:33:57,796 INFO L78 Accepts]: Start accepts. Automaton has 12214 states and 46640 transitions. Word has length 7 [2019-11-28 18:33:57,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:57,798 INFO L462 AbstractCegarLoop]: Abstraction has 12214 states and 46640 transitions. [2019-11-28 18:33:57,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:33:57,798 INFO L276 IsEmpty]: Start isEmpty. Operand 12214 states and 46640 transitions. [2019-11-28 18:33:57,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 18:33:57,810 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:57,810 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:33:57,811 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:33:57,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:57,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1356084764, now seen corresponding path program 1 times [2019-11-28 18:33:57,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:57,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926343488] [2019-11-28 18:33:57,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:57,949 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:33:57,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926343488] [2019-11-28 18:33:57,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:57,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:33:57,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269536503] [2019-11-28 18:33:57,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:33:57,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:57,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:33:57,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:33:57,953 INFO L87 Difference]: Start difference. First operand 12214 states and 46640 transitions. Second operand 4 states. [2019-11-28 18:33:58,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:58,316 INFO L93 Difference]: Finished difference Result 18446 states and 67942 transitions. [2019-11-28 18:33:58,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:33:58,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-28 18:33:58,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:58,452 INFO L225 Difference]: With dead ends: 18446 [2019-11-28 18:33:58,453 INFO L226 Difference]: Without dead ends: 18390 [2019-11-28 18:33:58,454 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:33:58,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18390 states. [2019-11-28 18:33:59,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18390 to 16710. [2019-11-28 18:33:59,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16710 states. [2019-11-28 18:33:59,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16710 states to 16710 states and 62402 transitions. [2019-11-28 18:33:59,158 INFO L78 Accepts]: Start accepts. Automaton has 16710 states and 62402 transitions. Word has length 13 [2019-11-28 18:33:59,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:59,159 INFO L462 AbstractCegarLoop]: Abstraction has 16710 states and 62402 transitions. [2019-11-28 18:33:59,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:33:59,159 INFO L276 IsEmpty]: Start isEmpty. Operand 16710 states and 62402 transitions. [2019-11-28 18:33:59,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:33:59,164 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:59,165 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:33:59,165 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:33:59,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:59,166 INFO L82 PathProgramCache]: Analyzing trace with hash -280168635, now seen corresponding path program 1 times [2019-11-28 18:33:59,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:59,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832809767] [2019-11-28 18:33:59,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:59,280 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:33:59,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832809767] [2019-11-28 18:33:59,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:59,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:33:59,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388741087] [2019-11-28 18:33:59,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:33:59,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:59,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:33:59,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:33:59,285 INFO L87 Difference]: Start difference. First operand 16710 states and 62402 transitions. Second operand 5 states. [2019-11-28 18:33:59,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:59,908 INFO L93 Difference]: Finished difference Result 24000 states and 87901 transitions. [2019-11-28 18:33:59,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:33:59,908 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-28 18:33:59,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:34:00,008 INFO L225 Difference]: With dead ends: 24000 [2019-11-28 18:34:00,009 INFO L226 Difference]: Without dead ends: 23924 [2019-11-28 18:34:00,009 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:34:00,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23924 states. [2019-11-28 18:34:00,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23924 to 20292. [2019-11-28 18:34:00,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20292 states. [2019-11-28 18:34:00,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20292 states to 20292 states and 75385 transitions. [2019-11-28 18:34:00,742 INFO L78 Accepts]: Start accepts. Automaton has 20292 states and 75385 transitions. Word has length 16 [2019-11-28 18:34:00,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:34:00,742 INFO L462 AbstractCegarLoop]: Abstraction has 20292 states and 75385 transitions. [2019-11-28 18:34:00,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:34:00,743 INFO L276 IsEmpty]: Start isEmpty. Operand 20292 states and 75385 transitions. [2019-11-28 18:34:00,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 18:34:00,752 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:34:00,752 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:34:00,752 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:34:00,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:34:00,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1749985236, now seen corresponding path program 1 times [2019-11-28 18:34:00,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:34:00,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182753271] [2019-11-28 18:34:00,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:34:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:34:00,845 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:34:00,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182753271] [2019-11-28 18:34:00,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:34:00,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:34:00,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627687193] [2019-11-28 18:34:00,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:34:00,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:34:00,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:34:00,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:34:00,847 INFO L87 Difference]: Start difference. First operand 20292 states and 75385 transitions. Second operand 4 states. [2019-11-28 18:34:00,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:34:00,941 INFO L93 Difference]: Finished difference Result 12898 states and 41735 transitions. [2019-11-28 18:34:00,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:34:00,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-28 18:34:00,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:34:00,976 INFO L225 Difference]: With dead ends: 12898 [2019-11-28 18:34:00,976 INFO L226 Difference]: Without dead ends: 11700 [2019-11-28 18:34:00,977 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:34:01,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11700 states. [2019-11-28 18:34:01,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11700 to 11700. [2019-11-28 18:34:01,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11700 states. [2019-11-28 18:34:01,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11700 states to 11700 states and 37917 transitions. [2019-11-28 18:34:01,308 INFO L78 Accepts]: Start accepts. Automaton has 11700 states and 37917 transitions. Word has length 18 [2019-11-28 18:34:01,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:34:01,309 INFO L462 AbstractCegarLoop]: Abstraction has 11700 states and 37917 transitions. [2019-11-28 18:34:01,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:34:01,309 INFO L276 IsEmpty]: Start isEmpty. Operand 11700 states and 37917 transitions. [2019-11-28 18:34:01,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 18:34:01,316 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:34:01,316 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:34:01,317 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:34:01,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:34:01,317 INFO L82 PathProgramCache]: Analyzing trace with hash -292292173, now seen corresponding path program 1 times [2019-11-28 18:34:01,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:34:01,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092472955] [2019-11-28 18:34:01,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:34:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:34:01,378 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:34:01,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092472955] [2019-11-28 18:34:01,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:34:01,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:34:01,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742898088] [2019-11-28 18:34:01,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:34:01,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:34:01,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:34:01,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:34:01,381 INFO L87 Difference]: Start difference. First operand 11700 states and 37917 transitions. Second operand 3 states. [2019-11-28 18:34:01,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:34:01,742 INFO L93 Difference]: Finished difference Result 11132 states and 35581 transitions. [2019-11-28 18:34:01,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:34:01,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 18:34:01,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:34:01,769 INFO L225 Difference]: With dead ends: 11132 [2019-11-28 18:34:01,770 INFO L226 Difference]: Without dead ends: 11132 [2019-11-28 18:34:01,770 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:34:01,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11132 states. [2019-11-28 18:34:02,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11132 to 10908. [2019-11-28 18:34:02,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10908 states. [2019-11-28 18:34:02,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10908 states to 10908 states and 34891 transitions. [2019-11-28 18:34:02,086 INFO L78 Accepts]: Start accepts. Automaton has 10908 states and 34891 transitions. Word has length 19 [2019-11-28 18:34:02,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:34:02,087 INFO L462 AbstractCegarLoop]: Abstraction has 10908 states and 34891 transitions. [2019-11-28 18:34:02,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:34:02,088 INFO L276 IsEmpty]: Start isEmpty. Operand 10908 states and 34891 transitions. [2019-11-28 18:34:02,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 18:34:02,095 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:34:02,095 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:34:02,096 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:34:02,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:34:02,096 INFO L82 PathProgramCache]: Analyzing trace with hash 44045431, now seen corresponding path program 1 times [2019-11-28 18:34:02,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:34:02,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012323348] [2019-11-28 18:34:02,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:34:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:34:02,190 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:34:02,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012323348] [2019-11-28 18:34:02,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:34:02,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:34:02,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233946476] [2019-11-28 18:34:02,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:34:02,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:34:02,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:34:02,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:34:02,192 INFO L87 Difference]: Start difference. First operand 10908 states and 34891 transitions. Second operand 5 states. [2019-11-28 18:34:02,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:34:02,277 INFO L93 Difference]: Finished difference Result 2615 states and 7252 transitions. [2019-11-28 18:34:02,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:34:02,278 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-28 18:34:02,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:34:02,284 INFO L225 Difference]: With dead ends: 2615 [2019-11-28 18:34:02,285 INFO L226 Difference]: Without dead ends: 2014 [2019-11-28 18:34:02,286 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:34:02,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2014 states. [2019-11-28 18:34:02,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2014 to 2014. [2019-11-28 18:34:02,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2014 states. [2019-11-28 18:34:02,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 2014 states and 5324 transitions. [2019-11-28 18:34:02,337 INFO L78 Accepts]: Start accepts. Automaton has 2014 states and 5324 transitions. Word has length 19 [2019-11-28 18:34:02,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:34:02,337 INFO L462 AbstractCegarLoop]: Abstraction has 2014 states and 5324 transitions. [2019-11-28 18:34:02,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:34:02,338 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 5324 transitions. [2019-11-28 18:34:02,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 18:34:02,344 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:34:02,344 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:34:02,345 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:34:02,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:34:02,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1434647427, now seen corresponding path program 1 times [2019-11-28 18:34:02,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:34:02,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062519157] [2019-11-28 18:34:02,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:34:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:34:02,402 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:34:02,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062519157] [2019-11-28 18:34:02,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:34:02,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:34:02,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062663833] [2019-11-28 18:34:02,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:34:02,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:34:02,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:34:02,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:34:02,404 INFO L87 Difference]: Start difference. First operand 2014 states and 5324 transitions. Second operand 3 states. [2019-11-28 18:34:02,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:34:02,460 INFO L93 Difference]: Finished difference Result 2850 states and 7274 transitions. [2019-11-28 18:34:02,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:34:02,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-28 18:34:02,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:34:02,467 INFO L225 Difference]: With dead ends: 2850 [2019-11-28 18:34:02,467 INFO L226 Difference]: Without dead ends: 2850 [2019-11-28 18:34:02,468 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:34:02,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2850 states. [2019-11-28 18:34:02,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2850 to 2110. [2019-11-28 18:34:02,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2110 states. [2019-11-28 18:34:02,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2110 states to 2110 states and 5466 transitions. [2019-11-28 18:34:02,512 INFO L78 Accepts]: Start accepts. Automaton has 2110 states and 5466 transitions. Word has length 29 [2019-11-28 18:34:02,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:34:02,512 INFO L462 AbstractCegarLoop]: Abstraction has 2110 states and 5466 transitions. [2019-11-28 18:34:02,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:34:02,512 INFO L276 IsEmpty]: Start isEmpty. Operand 2110 states and 5466 transitions. [2019-11-28 18:34:02,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 18:34:02,517 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:34:02,517 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:34:02,518 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:34:02,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:34:02,518 INFO L82 PathProgramCache]: Analyzing trace with hash 364652847, now seen corresponding path program 1 times [2019-11-28 18:34:02,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:34:02,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813022689] [2019-11-28 18:34:02,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:34:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:34:02,639 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:34:02,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813022689] [2019-11-28 18:34:02,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:34:02,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:34:02,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976964681] [2019-11-28 18:34:02,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:34:02,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:34:02,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:34:02,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:34:02,642 INFO L87 Difference]: Start difference. First operand 2110 states and 5466 transitions. Second operand 6 states. [2019-11-28 18:34:02,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:34:02,959 INFO L93 Difference]: Finished difference Result 3354 states and 8440 transitions. [2019-11-28 18:34:02,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 18:34:02,959 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-11-28 18:34:02,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:34:02,966 INFO L225 Difference]: With dead ends: 3354 [2019-11-28 18:34:02,967 INFO L226 Difference]: Without dead ends: 3346 [2019-11-28 18:34:02,967 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-28 18:34:02,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3346 states. [2019-11-28 18:34:03,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3346 to 2160. [2019-11-28 18:34:03,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2160 states. [2019-11-28 18:34:03,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2160 states to 2160 states and 5592 transitions. [2019-11-28 18:34:03,014 INFO L78 Accepts]: Start accepts. Automaton has 2160 states and 5592 transitions. Word has length 29 [2019-11-28 18:34:03,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:34:03,018 INFO L462 AbstractCegarLoop]: Abstraction has 2160 states and 5592 transitions. [2019-11-28 18:34:03,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:34:03,018 INFO L276 IsEmpty]: Start isEmpty. Operand 2160 states and 5592 transitions. [2019-11-28 18:34:03,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 18:34:03,024 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:34:03,024 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] [2019-11-28 18:34:03,025 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:34:03,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:34:03,025 INFO L82 PathProgramCache]: Analyzing trace with hash 804701306, now seen corresponding path program 1 times [2019-11-28 18:34:03,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:34:03,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14081981] [2019-11-28 18:34:03,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:34:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:34:03,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:34:03,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14081981] [2019-11-28 18:34:03,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:34:03,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:34:03,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000244870] [2019-11-28 18:34:03,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:34:03,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:34:03,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:34:03,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:34:03,139 INFO L87 Difference]: Start difference. First operand 2160 states and 5592 transitions. Second operand 6 states. [2019-11-28 18:34:03,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:34:03,228 INFO L93 Difference]: Finished difference Result 1348 states and 3614 transitions. [2019-11-28 18:34:03,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:34:03,229 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-11-28 18:34:03,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:34:03,231 INFO L225 Difference]: With dead ends: 1348 [2019-11-28 18:34:03,232 INFO L226 Difference]: Without dead ends: 1276 [2019-11-28 18:34:03,232 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:34:03,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2019-11-28 18:34:03,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1276. [2019-11-28 18:34:03,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1276 states. [2019-11-28 18:34:03,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 3443 transitions. [2019-11-28 18:34:03,253 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 3443 transitions. Word has length 30 [2019-11-28 18:34:03,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:34:03,254 INFO L462 AbstractCegarLoop]: Abstraction has 1276 states and 3443 transitions. [2019-11-28 18:34:03,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:34:03,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 3443 transitions. [2019-11-28 18:34:03,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:34:03,261 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:34:03,261 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:34:03,261 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:34:03,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:34:03,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1812124980, now seen corresponding path program 1 times [2019-11-28 18:34:03,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:34:03,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302017924] [2019-11-28 18:34:03,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:34:03,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:34:03,319 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:34:03,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302017924] [2019-11-28 18:34:03,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:34:03,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:34:03,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078826269] [2019-11-28 18:34:03,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:34:03,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:34:03,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:34:03,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:34:03,323 INFO L87 Difference]: Start difference. First operand 1276 states and 3443 transitions. Second operand 3 states. [2019-11-28 18:34:03,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:34:03,370 INFO L93 Difference]: Finished difference Result 1496 states and 3891 transitions. [2019-11-28 18:34:03,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:34:03,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-11-28 18:34:03,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:34:03,375 INFO L225 Difference]: With dead ends: 1496 [2019-11-28 18:34:03,375 INFO L226 Difference]: Without dead ends: 1496 [2019-11-28 18:34:03,376 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:34:03,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2019-11-28 18:34:03,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1328. [2019-11-28 18:34:03,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1328 states. [2019-11-28 18:34:03,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 3495 transitions. [2019-11-28 18:34:03,401 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 3495 transitions. Word has length 45 [2019-11-28 18:34:03,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:34:03,402 INFO L462 AbstractCegarLoop]: Abstraction has 1328 states and 3495 transitions. [2019-11-28 18:34:03,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:34:03,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 3495 transitions. [2019-11-28 18:34:03,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:34:03,407 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:34:03,408 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:34:03,408 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:34:03,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:34:03,408 INFO L82 PathProgramCache]: Analyzing trace with hash -24959066, now seen corresponding path program 1 times [2019-11-28 18:34:03,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:34:03,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413964015] [2019-11-28 18:34:03,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:34:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:34:03,872 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:34:03,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413964015] [2019-11-28 18:34:03,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:34:03,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 18:34:03,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185150668] [2019-11-28 18:34:03,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 18:34:03,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:34:03,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 18:34:03,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-28 18:34:03,875 INFO L87 Difference]: Start difference. First operand 1328 states and 3495 transitions. Second operand 12 states. [2019-11-28 18:34:06,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:34:06,599 INFO L93 Difference]: Finished difference Result 4594 states and 11296 transitions. [2019-11-28 18:34:06,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-28 18:34:06,600 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2019-11-28 18:34:06,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:34:06,608 INFO L225 Difference]: With dead ends: 4594 [2019-11-28 18:34:06,608 INFO L226 Difference]: Without dead ends: 4328 [2019-11-28 18:34:06,609 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=189, Invalid=741, Unknown=0, NotChecked=0, Total=930 [2019-11-28 18:34:06,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4328 states. [2019-11-28 18:34:06,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4328 to 1921. [2019-11-28 18:34:06,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1921 states. [2019-11-28 18:34:06,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1921 states to 1921 states and 5069 transitions. [2019-11-28 18:34:06,660 INFO L78 Accepts]: Start accepts. Automaton has 1921 states and 5069 transitions. Word has length 45 [2019-11-28 18:34:06,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:34:06,661 INFO L462 AbstractCegarLoop]: Abstraction has 1921 states and 5069 transitions. [2019-11-28 18:34:06,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 18:34:06,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1921 states and 5069 transitions. [2019-11-28 18:34:06,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:34:06,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:34:06,667 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:34:06,667 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:34:06,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:34:06,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1408267876, now seen corresponding path program 2 times [2019-11-28 18:34:06,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:34:06,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483804318] [2019-11-28 18:34:06,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:34:06,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:34:06,993 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:34:06,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483804318] [2019-11-28 18:34:06,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:34:06,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 18:34:06,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742077103] [2019-11-28 18:34:06,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 18:34:06,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:34:06,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 18:34:06,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-11-28 18:34:06,997 INFO L87 Difference]: Start difference. First operand 1921 states and 5069 transitions. Second operand 12 states. [2019-11-28 18:34:09,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:34:09,500 INFO L93 Difference]: Finished difference Result 5047 states and 12244 transitions. [2019-11-28 18:34:09,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-28 18:34:09,501 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2019-11-28 18:34:09,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:34:09,508 INFO L225 Difference]: With dead ends: 5047 [2019-11-28 18:34:09,508 INFO L226 Difference]: Without dead ends: 4527 [2019-11-28 18:34:09,509 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=196, Invalid=860, Unknown=0, NotChecked=0, Total=1056 [2019-11-28 18:34:09,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4527 states. [2019-11-28 18:34:09,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4527 to 1958. [2019-11-28 18:34:09,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1958 states. [2019-11-28 18:34:09,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1958 states to 1958 states and 5090 transitions. [2019-11-28 18:34:09,555 INFO L78 Accepts]: Start accepts. Automaton has 1958 states and 5090 transitions. Word has length 45 [2019-11-28 18:34:09,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:34:09,555 INFO L462 AbstractCegarLoop]: Abstraction has 1958 states and 5090 transitions. [2019-11-28 18:34:09,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 18:34:09,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1958 states and 5090 transitions. [2019-11-28 18:34:09,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:34:09,560 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:34:09,560 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:34:09,560 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:34:09,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:34:09,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1317309266, now seen corresponding path program 3 times [2019-11-28 18:34:09,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:34:09,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039318779] [2019-11-28 18:34:09,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:34:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:34:09,671 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:34:09,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039318779] [2019-11-28 18:34:09,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:34:09,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:34:09,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760361979] [2019-11-28 18:34:09,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:34:09,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:34:09,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:34:09,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:34:09,674 INFO L87 Difference]: Start difference. First operand 1958 states and 5090 transitions. Second operand 4 states. [2019-11-28 18:34:09,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:34:09,698 INFO L93 Difference]: Finished difference Result 2614 states and 6500 transitions. [2019-11-28 18:34:09,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:34:09,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-28 18:34:09,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:34:09,701 INFO L225 Difference]: With dead ends: 2614 [2019-11-28 18:34:09,702 INFO L226 Difference]: Without dead ends: 1746 [2019-11-28 18:34:09,702 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:34:09,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1746 states. [2019-11-28 18:34:09,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1746 to 1746. [2019-11-28 18:34:09,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1746 states. [2019-11-28 18:34:09,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1746 states to 1746 states and 4518 transitions. [2019-11-28 18:34:09,731 INFO L78 Accepts]: Start accepts. Automaton has 1746 states and 4518 transitions. Word has length 45 [2019-11-28 18:34:09,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:34:09,732 INFO L462 AbstractCegarLoop]: Abstraction has 1746 states and 4518 transitions. [2019-11-28 18:34:09,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:34:09,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1746 states and 4518 transitions. [2019-11-28 18:34:09,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:34:09,736 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:34:09,736 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:34:09,737 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:34:09,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:34:09,737 INFO L82 PathProgramCache]: Analyzing trace with hash 414189712, now seen corresponding path program 4 times [2019-11-28 18:34:09,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:34:09,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176961868] [2019-11-28 18:34:09,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:34:09,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:34:09,894 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:34:09,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176961868] [2019-11-28 18:34:09,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:34:09,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:34:09,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875928178] [2019-11-28 18:34:09,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:34:09,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:34:09,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:34:09,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:34:09,896 INFO L87 Difference]: Start difference. First operand 1746 states and 4518 transitions. Second operand 7 states. [2019-11-28 18:34:10,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:34:10,247 INFO L93 Difference]: Finished difference Result 3898 states and 9944 transitions. [2019-11-28 18:34:10,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 18:34:10,247 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-11-28 18:34:10,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:34:10,252 INFO L225 Difference]: With dead ends: 3898 [2019-11-28 18:34:10,252 INFO L226 Difference]: Without dead ends: 3247 [2019-11-28 18:34:10,253 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-11-28 18:34:10,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3247 states. [2019-11-28 18:34:10,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3247 to 1832. [2019-11-28 18:34:10,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1832 states. [2019-11-28 18:34:10,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1832 states and 4609 transitions. [2019-11-28 18:34:10,292 INFO L78 Accepts]: Start accepts. Automaton has 1832 states and 4609 transitions. Word has length 45 [2019-11-28 18:34:10,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:34:10,293 INFO L462 AbstractCegarLoop]: Abstraction has 1832 states and 4609 transitions. [2019-11-28 18:34:10,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:34:10,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 4609 transitions. [2019-11-28 18:34:10,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:34:10,297 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:34:10,297 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:34:10,297 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:34:10,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:34:10,298 INFO L82 PathProgramCache]: Analyzing trace with hash -228434578, now seen corresponding path program 5 times [2019-11-28 18:34:10,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:34:10,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549185551] [2019-11-28 18:34:10,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:34:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:34:10,388 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:34:10,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549185551] [2019-11-28 18:34:10,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:34:10,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:34:10,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59943263] [2019-11-28 18:34:10,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:34:10,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:34:10,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:34:10,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:34:10,391 INFO L87 Difference]: Start difference. First operand 1832 states and 4609 transitions. Second operand 4 states. [2019-11-28 18:34:10,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:34:10,422 INFO L93 Difference]: Finished difference Result 2355 states and 5770 transitions. [2019-11-28 18:34:10,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:34:10,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-28 18:34:10,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:34:10,426 INFO L225 Difference]: With dead ends: 2355 [2019-11-28 18:34:10,426 INFO L226 Difference]: Without dead ends: 1774 [2019-11-28 18:34:10,429 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:34:10,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1774 states. [2019-11-28 18:34:10,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1371. [2019-11-28 18:34:10,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1371 states. [2019-11-28 18:34:10,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 3502 transitions. [2019-11-28 18:34:10,453 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 3502 transitions. Word has length 45 [2019-11-28 18:34:10,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:34:10,453 INFO L462 AbstractCegarLoop]: Abstraction has 1371 states and 3502 transitions. [2019-11-28 18:34:10,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:34:10,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 3502 transitions. [2019-11-28 18:34:10,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:34:10,456 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:34:10,456 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:34:10,457 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:34:10,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:34:10,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1267873360, now seen corresponding path program 6 times [2019-11-28 18:34:10,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:34:10,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234092554] [2019-11-28 18:34:10,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:34:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:34:10,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:34:10,580 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:34:10,583 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:34:10,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= v_~y$w_buff1_used~0_392 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y~0_142 0) (= v_~y$r_buff1_thd0~0_186 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2583~0.base_31|) (= |v_#NULL.offset_6| 0) (= v_~z~0_143 0) (= v_~weak$$choice2~0_148 0) (= 0 v_~y$flush_delayed~0_39) (= v_~y$w_buff0_used~0_626 0) (= v_~main$tmp_guard1~0_45 0) (= 0 v_~__unbuffered_p0_EAX~0_41) (= 0 v_~__unbuffered_p1_EAX~0_72) (= v_~y$w_buff1~0_220 0) (= v_~y$r_buff1_thd1~0_109 0) (= v_~y$mem_tmp~0_18 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~y$r_buff0_thd2~0_297) (= (select .cse0 |v_ULTIMATE.start_main_~#t2583~0.base_31|) 0) (= |v_#valid_66| (store .cse0 |v_ULTIMATE.start_main_~#t2583~0.base_31| 1)) (= 0 v_~y$w_buff0~0_290) (= 0 |v_#NULL.base_6|) (= v_~y$read_delayed~0_5 0) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$r_buff0_thd3~0_185) (= v_~y$r_buff0_thd0~0_93 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2583~0.base_31| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2583~0.base_31|) |v_ULTIMATE.start_main_~#t2583~0.offset_22| 0)) |v_#memory_int_23|) (= |v_ULTIMATE.start_main_~#t2583~0.offset_22| 0) (= 0 v_~y$r_buff1_thd3~0_159) (= v_~main$tmp_guard0~0_26 0) (= 0 v_~__unbuffered_cnt~0_77) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2583~0.base_31| 4)) (= 0 v_~y$r_buff1_thd2~0_283) (= v_~x~0_19 0) (= v_~y$r_buff0_thd1~0_25 0) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_16|, #NULL.offset=|v_#NULL.offset_6|, ~y$read_delayed~0=v_~y$read_delayed~0_5, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_159, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_72, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_25, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, #length=|v_#length_25|, ULTIMATE.start_main_~#t2585~0.offset=|v_ULTIMATE.start_main_~#t2585~0.offset_15|, ULTIMATE.start_main_~#t2583~0.base=|v_ULTIMATE.start_main_~#t2583~0.base_31|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_29|, ULTIMATE.start_main_~#t2584~0.base=|v_ULTIMATE.start_main_~#t2584~0.base_31|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_~#t2584~0.offset=|v_ULTIMATE.start_main_~#t2584~0.offset_22|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_92|, ~y$w_buff1~0=v_~y$w_buff1~0_220, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_297, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, ULTIMATE.start_main_~#t2583~0.offset=|v_ULTIMATE.start_main_~#t2583~0.offset_22|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_186, ~x~0=v_~x~0_19, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_626, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ULTIMATE.start_main_~#t2585~0.base=|v_ULTIMATE.start_main_~#t2585~0.base_23|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_109, ~y$w_buff0~0=v_~y$w_buff0~0_290, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_185, ~y~0=v_~y~0_142, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_32|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_107|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_283, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_93, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_143, ~weak$$choice2~0=v_~weak$$choice2~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_392} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_#t~nondet34, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t2585~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t2585~0.offset, ULTIMATE.start_main_~#t2583~0.base, ~y~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t2584~0.base, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t2584~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ~y$r_buff0_thd2~0, #valid, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2583~0.offset, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:34:10,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L814-1-->L816: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2584~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2584~0.base_10|) |v_ULTIMATE.start_main_~#t2584~0.offset_9| 1)) |v_#memory_int_11|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2584~0.base_10| 1) |v_#valid_27|) (not (= |v_ULTIMATE.start_main_~#t2584~0.base_10| 0)) (= |v_ULTIMATE.start_main_~#t2584~0.offset_9| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2584~0.base_10|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2584~0.base_10|) 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2584~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t2584~0.base=|v_ULTIMATE.start_main_~#t2584~0.base_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t2584~0.offset=|v_ULTIMATE.start_main_~#t2584~0.offset_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t2584~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t2584~0.offset, #length] because there is no mapped edge [2019-11-28 18:34:10,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L816-1-->L818: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2585~0.base_11| 4)) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2585~0.base_11| 1) |v_#valid_36|) (= 0 |v_ULTIMATE.start_main_~#t2585~0.offset_10|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2585~0.base_11|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2585~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2585~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2585~0.base_11|) |v_ULTIMATE.start_main_~#t2585~0.offset_10| 2)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t2585~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_4|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2585~0.offset=|v_ULTIMATE.start_main_~#t2585~0.offset_10|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2585~0.base=|v_ULTIMATE.start_main_~#t2585~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t2585~0.offset, #length, ULTIMATE.start_main_~#t2585~0.base] because there is no mapped edge [2019-11-28 18:34:10,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [620] [620] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_113 1) (= v_~y$w_buff0~0_41 v_~y$w_buff1~0_33) (= 1 v_~y$w_buff0~0_40) (= v_P2Thread1of1ForFork2_~arg.offset_14 |v_P2Thread1of1ForFork2_#in~arg.offset_16|) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_14| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_113 256) 0)) (not (= 0 (mod v_~y$w_buff1_used~0_71 256))))) 1 0)) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_16)) (= |v_P2Thread1of1ForFork2_#in~arg.base_16| v_P2Thread1of1ForFork2_~arg.base_14) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_14| v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_16) (= v_~y$w_buff1_used~0_71 v_~y$w_buff0_used~0_114)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_114, ~y$w_buff0~0=v_~y$w_buff0~0_41, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_16|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_113, ~y$w_buff1~0=v_~y$w_buff1~0_33, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_14, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_14, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_14|, ~y$w_buff0~0=v_~y$w_buff0~0_40, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_16, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_16|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_71} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression, ~y$w_buff0~0, P2Thread1of1ForFork2___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:34:10,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_10|) (= v_~z~0_85 2) (= v_~x~0_14 v_~__unbuffered_p0_EAX~0_18) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_10|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, ~x~0=v_~x~0_14} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, ~z~0=v_~z~0_85, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, ~x~0=v_~x~0_14, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-11-28 18:34:10,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L756-->L756-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-335735611 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite8_In-335735611| |P1Thread1of1ForFork1_#t~ite8_Out-335735611|) (not .cse0) (= ~y$w_buff0~0_In-335735611 |P1Thread1of1ForFork1_#t~ite9_Out-335735611|)) (and .cse0 (= ~y$w_buff0~0_In-335735611 |P1Thread1of1ForFork1_#t~ite8_Out-335735611|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-335735611 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-335735611 256))) (= 0 (mod ~y$w_buff0_used~0_In-335735611 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In-335735611 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite8_Out-335735611| |P1Thread1of1ForFork1_#t~ite9_Out-335735611|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-335735611, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-335735611, ~y$w_buff0~0=~y$w_buff0~0_In-335735611, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-335735611, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In-335735611|, ~weak$$choice2~0=~weak$$choice2~0_In-335735611, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-335735611} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-335735611, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-335735611, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-335735611|, ~y$w_buff0~0=~y$w_buff0~0_In-335735611, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-335735611, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out-335735611|, ~weak$$choice2~0=~weak$$choice2~0_In-335735611, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-335735611} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-11-28 18:34:10,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L758-->L758-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1563107477 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out1563107477| |P1Thread1of1ForFork1_#t~ite15_Out1563107477|) (= ~y$w_buff0_used~0_In1563107477 |P1Thread1of1ForFork1_#t~ite14_Out1563107477|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1563107477 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In1563107477 256) 0) .cse0) (= 0 (mod ~y$w_buff0_used~0_In1563107477 256)) (and .cse0 (= (mod ~y$r_buff1_thd2~0_In1563107477 256) 0)))) .cse1) (and (= ~y$w_buff0_used~0_In1563107477 |P1Thread1of1ForFork1_#t~ite15_Out1563107477|) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite14_In1563107477| |P1Thread1of1ForFork1_#t~ite14_Out1563107477|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1563107477, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1563107477, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1563107477, ~weak$$choice2~0=~weak$$choice2~0_In1563107477, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In1563107477|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1563107477} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1563107477, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1563107477, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1563107477, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out1563107477|, ~weak$$choice2~0=~weak$$choice2~0_In1563107477, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1563107477|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1563107477} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:34:10,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [625] [625] L760-->L761: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~y$r_buff0_thd2~0_59 v_~y$r_buff0_thd2~0_58)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_14|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_9|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_58, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_27} 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:34:10,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L792-->L792-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In1228303807 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1228303807 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite28_Out1228303807|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In1228303807 |P2Thread1of1ForFork2_#t~ite28_Out1228303807|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1228303807, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1228303807} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1228303807, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1228303807, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out1228303807|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-11-28 18:34:10,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L763-->L771: Formula: (and (= v_~y~0_31 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= 0 v_~y$flush_delayed~0_7) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~y~0=v_~y~0_31, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-11-28 18:34:10,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L793-->L793-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd3~0_In-1999378458 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1999378458 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-1999378458 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-1999378458 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite29_Out-1999378458| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1999378458 |P2Thread1of1ForFork2_#t~ite29_Out-1999378458|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1999378458, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1999378458, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1999378458, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1999378458} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1999378458, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1999378458, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1999378458, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-1999378458|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1999378458} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-11-28 18:34:10,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L794-->L795: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In236354802 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In236354802 256) 0)) (.cse2 (= ~y$r_buff0_thd3~0_In236354802 ~y$r_buff0_thd3~0_Out236354802))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out236354802)) (and .cse2 .cse0) (and .cse1 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In236354802, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In236354802} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In236354802, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out236354802|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out236354802} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-11-28 18:34:10,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L795-->L795-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd3~0_In-186812281 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-186812281 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-186812281 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-186812281 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In-186812281 |P2Thread1of1ForFork2_#t~ite31_Out-186812281|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork2_#t~ite31_Out-186812281|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-186812281, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-186812281, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-186812281, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-186812281} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-186812281, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-186812281, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out-186812281|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-186812281, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-186812281} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-11-28 18:34:10,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L795-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite31_36| v_~y$r_buff1_thd3~0_108) (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_108, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_35|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, 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:34:10,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L822-->L824-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~y$r_buff0_thd0~0_32 256)) (= (mod v_~y$w_buff0_used~0_137 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:34:10,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L824-2-->L824-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1038574903 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1038574903 256)))) (or (and (= ~y$w_buff1~0_In1038574903 |ULTIMATE.start_main_#t~ite35_Out1038574903|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y~0_In1038574903 |ULTIMATE.start_main_#t~ite35_Out1038574903|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1038574903, ~y~0=~y~0_In1038574903, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1038574903, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1038574903} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1038574903, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1038574903|, ~y~0=~y~0_In1038574903, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1038574903, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1038574903} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-11-28 18:34:10,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [617] [617] L824-4-->L825: Formula: (= v_~y~0_22 |v_ULTIMATE.start_main_#t~ite35_10|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_10|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ~y~0=v_~y~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-11-28 18:34:10,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L825-->L825-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1026067028 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1026067028 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite37_Out-1026067028| ~y$w_buff0_used~0_In-1026067028)) (and (= |ULTIMATE.start_main_#t~ite37_Out-1026067028| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1026067028, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1026067028} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1026067028, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1026067028, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1026067028|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:34:10,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L826-->L826-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd0~0_In1527975793 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1527975793 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1527975793 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1527975793 256)))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out1527975793| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite38_Out1527975793| ~y$w_buff1_used~0_In1527975793) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1527975793, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1527975793, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1527975793, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1527975793} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1527975793, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1527975793, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1527975793|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1527975793, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1527975793} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:34:10,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L827-->L827-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1965999018 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1965999018 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite39_Out1965999018| ~y$r_buff0_thd0~0_In1965999018)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite39_Out1965999018| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1965999018, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1965999018} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1965999018, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1965999018|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1965999018} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:34:10,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L828-->L828-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1399082591 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1399082591 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1399082591 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1399082591 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1399082591| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite40_Out1399082591| ~y$r_buff1_thd0~0_In1399082591) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1399082591, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1399082591, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1399082591, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1399082591} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1399082591|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1399082591, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1399082591, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1399082591, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1399082591} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:34:10,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L828-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~y$r_buff1_thd0~0_128 |v_ULTIMATE.start_main_#t~ite40_47|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_49) (= 0 v_~__unbuffered_p0_EAX~0_23) (= v_~z~0_99 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~z~0=v_~z~0_99} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~z~0=v_~z~0_99, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_128, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} 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:34:10,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:34:10 BasicIcfg [2019-11-28 18:34:10,742 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:34:10,742 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:34:10,742 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:34:10,742 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:34:10,743 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:33:49" (3/4) ... [2019-11-28 18:34:10,746 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:34:10,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= v_~y$w_buff1_used~0_392 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y~0_142 0) (= v_~y$r_buff1_thd0~0_186 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2583~0.base_31|) (= |v_#NULL.offset_6| 0) (= v_~z~0_143 0) (= v_~weak$$choice2~0_148 0) (= 0 v_~y$flush_delayed~0_39) (= v_~y$w_buff0_used~0_626 0) (= v_~main$tmp_guard1~0_45 0) (= 0 v_~__unbuffered_p0_EAX~0_41) (= 0 v_~__unbuffered_p1_EAX~0_72) (= v_~y$w_buff1~0_220 0) (= v_~y$r_buff1_thd1~0_109 0) (= v_~y$mem_tmp~0_18 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~y$r_buff0_thd2~0_297) (= (select .cse0 |v_ULTIMATE.start_main_~#t2583~0.base_31|) 0) (= |v_#valid_66| (store .cse0 |v_ULTIMATE.start_main_~#t2583~0.base_31| 1)) (= 0 v_~y$w_buff0~0_290) (= 0 |v_#NULL.base_6|) (= v_~y$read_delayed~0_5 0) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$r_buff0_thd3~0_185) (= v_~y$r_buff0_thd0~0_93 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2583~0.base_31| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2583~0.base_31|) |v_ULTIMATE.start_main_~#t2583~0.offset_22| 0)) |v_#memory_int_23|) (= |v_ULTIMATE.start_main_~#t2583~0.offset_22| 0) (= 0 v_~y$r_buff1_thd3~0_159) (= v_~main$tmp_guard0~0_26 0) (= 0 v_~__unbuffered_cnt~0_77) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2583~0.base_31| 4)) (= 0 v_~y$r_buff1_thd2~0_283) (= v_~x~0_19 0) (= v_~y$r_buff0_thd1~0_25 0) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_16|, #NULL.offset=|v_#NULL.offset_6|, ~y$read_delayed~0=v_~y$read_delayed~0_5, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_159, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_72, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_25, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, #length=|v_#length_25|, ULTIMATE.start_main_~#t2585~0.offset=|v_ULTIMATE.start_main_~#t2585~0.offset_15|, ULTIMATE.start_main_~#t2583~0.base=|v_ULTIMATE.start_main_~#t2583~0.base_31|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_29|, ULTIMATE.start_main_~#t2584~0.base=|v_ULTIMATE.start_main_~#t2584~0.base_31|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_~#t2584~0.offset=|v_ULTIMATE.start_main_~#t2584~0.offset_22|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_92|, ~y$w_buff1~0=v_~y$w_buff1~0_220, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_297, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, ULTIMATE.start_main_~#t2583~0.offset=|v_ULTIMATE.start_main_~#t2583~0.offset_22|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_186, ~x~0=v_~x~0_19, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_626, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ULTIMATE.start_main_~#t2585~0.base=|v_ULTIMATE.start_main_~#t2585~0.base_23|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_109, ~y$w_buff0~0=v_~y$w_buff0~0_290, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_185, ~y~0=v_~y~0_142, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_32|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_107|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_283, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_93, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_143, ~weak$$choice2~0=v_~weak$$choice2~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_392} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_#t~nondet34, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t2585~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t2585~0.offset, ULTIMATE.start_main_~#t2583~0.base, ~y~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t2584~0.base, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t2584~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ~y$r_buff0_thd2~0, #valid, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2583~0.offset, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:34:10,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L814-1-->L816: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2584~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2584~0.base_10|) |v_ULTIMATE.start_main_~#t2584~0.offset_9| 1)) |v_#memory_int_11|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2584~0.base_10| 1) |v_#valid_27|) (not (= |v_ULTIMATE.start_main_~#t2584~0.base_10| 0)) (= |v_ULTIMATE.start_main_~#t2584~0.offset_9| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2584~0.base_10|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2584~0.base_10|) 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2584~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t2584~0.base=|v_ULTIMATE.start_main_~#t2584~0.base_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t2584~0.offset=|v_ULTIMATE.start_main_~#t2584~0.offset_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t2584~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t2584~0.offset, #length] because there is no mapped edge [2019-11-28 18:34:10,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L816-1-->L818: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2585~0.base_11| 4)) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2585~0.base_11| 1) |v_#valid_36|) (= 0 |v_ULTIMATE.start_main_~#t2585~0.offset_10|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2585~0.base_11|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2585~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2585~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2585~0.base_11|) |v_ULTIMATE.start_main_~#t2585~0.offset_10| 2)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t2585~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_4|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2585~0.offset=|v_ULTIMATE.start_main_~#t2585~0.offset_10|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2585~0.base=|v_ULTIMATE.start_main_~#t2585~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t2585~0.offset, #length, ULTIMATE.start_main_~#t2585~0.base] because there is no mapped edge [2019-11-28 18:34:10,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [620] [620] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_113 1) (= v_~y$w_buff0~0_41 v_~y$w_buff1~0_33) (= 1 v_~y$w_buff0~0_40) (= v_P2Thread1of1ForFork2_~arg.offset_14 |v_P2Thread1of1ForFork2_#in~arg.offset_16|) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_14| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_113 256) 0)) (not (= 0 (mod v_~y$w_buff1_used~0_71 256))))) 1 0)) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_16)) (= |v_P2Thread1of1ForFork2_#in~arg.base_16| v_P2Thread1of1ForFork2_~arg.base_14) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_14| v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_16) (= v_~y$w_buff1_used~0_71 v_~y$w_buff0_used~0_114)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_114, ~y$w_buff0~0=v_~y$w_buff0~0_41, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_16|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_113, ~y$w_buff1~0=v_~y$w_buff1~0_33, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_14, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_14, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_14|, ~y$w_buff0~0=v_~y$w_buff0~0_40, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_16, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_16|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_71} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression, ~y$w_buff0~0, P2Thread1of1ForFork2___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:34:10,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_10|) (= v_~z~0_85 2) (= v_~x~0_14 v_~__unbuffered_p0_EAX~0_18) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_10|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, ~x~0=v_~x~0_14} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, ~z~0=v_~z~0_85, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, ~x~0=v_~x~0_14, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-11-28 18:34:10,757 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L756-->L756-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-335735611 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite8_In-335735611| |P1Thread1of1ForFork1_#t~ite8_Out-335735611|) (not .cse0) (= ~y$w_buff0~0_In-335735611 |P1Thread1of1ForFork1_#t~ite9_Out-335735611|)) (and .cse0 (= ~y$w_buff0~0_In-335735611 |P1Thread1of1ForFork1_#t~ite8_Out-335735611|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-335735611 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-335735611 256))) (= 0 (mod ~y$w_buff0_used~0_In-335735611 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In-335735611 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite8_Out-335735611| |P1Thread1of1ForFork1_#t~ite9_Out-335735611|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-335735611, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-335735611, ~y$w_buff0~0=~y$w_buff0~0_In-335735611, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-335735611, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In-335735611|, ~weak$$choice2~0=~weak$$choice2~0_In-335735611, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-335735611} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-335735611, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-335735611, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-335735611|, ~y$w_buff0~0=~y$w_buff0~0_In-335735611, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-335735611, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out-335735611|, ~weak$$choice2~0=~weak$$choice2~0_In-335735611, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-335735611} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-11-28 18:34:10,760 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L758-->L758-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1563107477 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out1563107477| |P1Thread1of1ForFork1_#t~ite15_Out1563107477|) (= ~y$w_buff0_used~0_In1563107477 |P1Thread1of1ForFork1_#t~ite14_Out1563107477|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1563107477 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In1563107477 256) 0) .cse0) (= 0 (mod ~y$w_buff0_used~0_In1563107477 256)) (and .cse0 (= (mod ~y$r_buff1_thd2~0_In1563107477 256) 0)))) .cse1) (and (= ~y$w_buff0_used~0_In1563107477 |P1Thread1of1ForFork1_#t~ite15_Out1563107477|) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite14_In1563107477| |P1Thread1of1ForFork1_#t~ite14_Out1563107477|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1563107477, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1563107477, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1563107477, ~weak$$choice2~0=~weak$$choice2~0_In1563107477, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In1563107477|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1563107477} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1563107477, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1563107477, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1563107477, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out1563107477|, ~weak$$choice2~0=~weak$$choice2~0_In1563107477, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1563107477|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1563107477} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:34:10,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [625] [625] L760-->L761: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~y$r_buff0_thd2~0_59 v_~y$r_buff0_thd2~0_58)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_14|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_9|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_58, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_27} 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:34:10,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L792-->L792-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In1228303807 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1228303807 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite28_Out1228303807|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In1228303807 |P2Thread1of1ForFork2_#t~ite28_Out1228303807|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1228303807, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1228303807} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1228303807, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1228303807, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out1228303807|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-11-28 18:34:10,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L763-->L771: Formula: (and (= v_~y~0_31 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= 0 v_~y$flush_delayed~0_7) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~y~0=v_~y~0_31, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-11-28 18:34:10,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L793-->L793-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd3~0_In-1999378458 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1999378458 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-1999378458 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-1999378458 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite29_Out-1999378458| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1999378458 |P2Thread1of1ForFork2_#t~ite29_Out-1999378458|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1999378458, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1999378458, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1999378458, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1999378458} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1999378458, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1999378458, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1999378458, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-1999378458|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1999378458} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-11-28 18:34:10,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L794-->L795: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In236354802 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In236354802 256) 0)) (.cse2 (= ~y$r_buff0_thd3~0_In236354802 ~y$r_buff0_thd3~0_Out236354802))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out236354802)) (and .cse2 .cse0) (and .cse1 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In236354802, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In236354802} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In236354802, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out236354802|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out236354802} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-11-28 18:34:10,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L795-->L795-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd3~0_In-186812281 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-186812281 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-186812281 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-186812281 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In-186812281 |P2Thread1of1ForFork2_#t~ite31_Out-186812281|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork2_#t~ite31_Out-186812281|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-186812281, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-186812281, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-186812281, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-186812281} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-186812281, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-186812281, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out-186812281|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-186812281, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-186812281} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-11-28 18:34:10,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L795-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite31_36| v_~y$r_buff1_thd3~0_108) (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_108, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_35|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, 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:34:10,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L822-->L824-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~y$r_buff0_thd0~0_32 256)) (= (mod v_~y$w_buff0_used~0_137 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:34:10,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L824-2-->L824-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1038574903 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1038574903 256)))) (or (and (= ~y$w_buff1~0_In1038574903 |ULTIMATE.start_main_#t~ite35_Out1038574903|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y~0_In1038574903 |ULTIMATE.start_main_#t~ite35_Out1038574903|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1038574903, ~y~0=~y~0_In1038574903, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1038574903, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1038574903} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1038574903, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1038574903|, ~y~0=~y~0_In1038574903, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1038574903, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1038574903} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-11-28 18:34:10,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [617] [617] L824-4-->L825: Formula: (= v_~y~0_22 |v_ULTIMATE.start_main_#t~ite35_10|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_10|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ~y~0=v_~y~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-11-28 18:34:10,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L825-->L825-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1026067028 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1026067028 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite37_Out-1026067028| ~y$w_buff0_used~0_In-1026067028)) (and (= |ULTIMATE.start_main_#t~ite37_Out-1026067028| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1026067028, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1026067028} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1026067028, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1026067028, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1026067028|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:34:10,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L826-->L826-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd0~0_In1527975793 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1527975793 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1527975793 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1527975793 256)))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out1527975793| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite38_Out1527975793| ~y$w_buff1_used~0_In1527975793) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1527975793, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1527975793, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1527975793, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1527975793} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1527975793, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1527975793, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1527975793|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1527975793, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1527975793} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:34:10,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L827-->L827-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1965999018 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1965999018 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite39_Out1965999018| ~y$r_buff0_thd0~0_In1965999018)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite39_Out1965999018| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1965999018, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1965999018} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1965999018, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1965999018|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1965999018} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:34:10,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L828-->L828-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1399082591 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1399082591 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1399082591 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1399082591 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1399082591| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite40_Out1399082591| ~y$r_buff1_thd0~0_In1399082591) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1399082591, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1399082591, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1399082591, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1399082591} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1399082591|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1399082591, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1399082591, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1399082591, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1399082591} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:34:10,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L828-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~y$r_buff1_thd0~0_128 |v_ULTIMATE.start_main_#t~ite40_47|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_49) (= 0 v_~__unbuffered_p0_EAX~0_23) (= v_~z~0_99 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~z~0=v_~z~0_99} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~z~0=v_~z~0_99, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_128, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} 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:34:10,894 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:34:10,898 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:34:10,903 INFO L168 Benchmark]: Toolchain (without parser) took 23171.59 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 995.6 MB). Free memory was 956.3 MB in the beginning and 930.7 MB in the end (delta: 25.6 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2019-11-28 18:34:10,903 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:34:10,904 INFO L168 Benchmark]: CACSL2BoogieTranslator took 735.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -154.2 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:34:10,905 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:34:10,905 INFO L168 Benchmark]: Boogie Preprocessor took 41.62 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:34:10,906 INFO L168 Benchmark]: RCFGBuilder took 805.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 11.5 GB. [2019-11-28 18:34:10,909 INFO L168 Benchmark]: TraceAbstraction took 21363.51 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 852.0 MB). Free memory was 1.1 GB in the beginning and 951.1 MB in the end (delta: 103.1 MB). Peak memory consumption was 955.1 MB. Max. memory is 11.5 GB. [2019-11-28 18:34:10,910 INFO L168 Benchmark]: Witness Printer took 156.01 ms. Allocated memory is still 2.0 GB. Free memory was 951.1 MB in the beginning and 930.7 MB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-28 18:34:10,914 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 735.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -154.2 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.62 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 805.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21363.51 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 852.0 MB). Free memory was 1.1 GB in the beginning and 951.1 MB in the end (delta: 103.1 MB). Peak memory consumption was 955.1 MB. Max. memory is 11.5 GB. * Witness Printer took 156.01 ms. Allocated memory is still 2.0 GB. Free memory was 951.1 MB in the beginning and 930.7 MB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.0s, 151 ProgramPointsBefore, 73 ProgramPointsAfterwards, 176 TransitionsBefore, 82 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 12 FixpointIterations, 32 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 20 ChoiceCompositions, 4974 VarBasedMoverChecksPositive, 245 VarBasedMoverChecksNegative, 129 SemBasedMoverChecksPositive, 162 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 63936 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L814] FCALL, FORK 0 pthread_create(&t2583, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t2584, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t2585, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 [L788] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 2 x = 1 [L751] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 2 y$flush_delayed = weak$$choice2 [L754] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L756] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L757] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L758] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L759] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L761] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L761] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 21.0s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1975 SDtfs, 3279 SDslu, 5777 SDs, 0 SdLazy, 4283 SolverSat, 258 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 34 SyntacticMatches, 6 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20292occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 14424 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 495 NumberOfCodeBlocks, 495 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 435 ConstructedInterpolants, 0 QuantifiedInterpolants, 94563 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...