./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix011_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix011_power.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c25fe089ad97933d9897fcbf06674a22dab139de .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:03:20,164 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:03:20,167 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:03:20,188 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:03:20,188 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:03:20,191 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:03:20,193 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:03:20,202 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:03:20,208 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:03:20,211 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:03:20,213 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:03:20,215 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:03:20,215 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:03:20,218 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:03:20,220 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:03:20,222 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:03:20,223 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:03:20,225 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:03:20,227 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:03:20,231 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:03:20,236 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:03:20,241 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:03:20,242 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:03:20,244 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:03:20,248 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:03:20,249 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:03:20,249 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:03:20,251 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:03:20,252 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:03:20,253 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:03:20,253 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:03:20,254 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:03:20,255 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:03:20,256 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:03:20,257 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:03:20,258 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:03:20,259 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:03:20,259 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:03:20,259 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:03:20,260 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:03:20,262 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:03:20,263 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:03:20,298 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:03:20,298 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:03:20,301 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:03:20,303 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:03:20,303 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:03:20,303 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:03:20,304 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:03:20,304 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:03:20,305 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:03:20,305 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:03:20,306 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:03:20,306 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:03:20,306 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:03:20,308 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:03:20,308 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:03:20,308 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:03:20,308 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:03:20,309 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:03:20,309 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:03:20,309 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:03:20,310 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:03:20,310 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:03:20,310 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:03:20,311 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:03:20,311 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:03:20,311 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:03:20,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:03:20,312 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:03:20,312 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:03:20,313 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 -> c25fe089ad97933d9897fcbf06674a22dab139de [2019-11-28 18:03:20,624 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:03:20,645 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:03:20,649 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:03:20,651 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:03:20,652 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:03:20,653 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix011_power.opt.i [2019-11-28 18:03:20,720 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48b99702c/eac9a83379b14acdbd4f30431eea9004/FLAG4541a67b2 [2019-11-28 18:03:21,302 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:03:21,303 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix011_power.opt.i [2019-11-28 18:03:21,332 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48b99702c/eac9a83379b14acdbd4f30431eea9004/FLAG4541a67b2 [2019-11-28 18:03:21,566 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48b99702c/eac9a83379b14acdbd4f30431eea9004 [2019-11-28 18:03:21,569 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:03:21,571 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:03:21,575 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:03:21,576 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:03:21,580 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:03:21,581 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:03:21" (1/1) ... [2019-11-28 18:03:21,584 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:03:21, skipping insertion in model container [2019-11-28 18:03:21,584 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:03:21" (1/1) ... [2019-11-28 18:03:21,592 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:03:21,659 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:03:22,223 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:03:22,236 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:03:22,341 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:03:22,424 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:03:22,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:03:22 WrapperNode [2019-11-28 18:03:22,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:03:22,426 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:03:22,426 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:03:22,427 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:03:22,436 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:03:22" (1/1) ... [2019-11-28 18:03:22,466 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:03:22" (1/1) ... [2019-11-28 18:03:22,514 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:03:22,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:03:22,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:03:22,515 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:03:22,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:03:22" (1/1) ... [2019-11-28 18:03:22,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:03:22" (1/1) ... [2019-11-28 18:03:22,530 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:03:22" (1/1) ... [2019-11-28 18:03:22,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:03:22" (1/1) ... [2019-11-28 18:03:22,542 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:03:22" (1/1) ... [2019-11-28 18:03:22,547 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:03:22" (1/1) ... [2019-11-28 18:03:22,552 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:03:22" (1/1) ... [2019-11-28 18:03:22,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:03:22,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:03:22,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:03:22,559 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:03:22,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:03:22" (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:03:22,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:03:22,661 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:03:22,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:03:22,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:03:22,662 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:03:22,663 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:03:22,663 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:03:22,663 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:03:22,663 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-11-28 18:03:22,664 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-11-28 18:03:22,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:03:22,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:03:22,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:03:22,668 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:03:23,560 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:03:23,560 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:03:23,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:03:23 BoogieIcfgContainer [2019-11-28 18:03:23,562 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:03:23,563 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:03:23,563 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:03:23,567 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:03:23,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:03:21" (1/3) ... [2019-11-28 18:03:23,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@577b6046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:03:23, skipping insertion in model container [2019-11-28 18:03:23,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:03:22" (2/3) ... [2019-11-28 18:03:23,569 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@577b6046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:03:23, skipping insertion in model container [2019-11-28 18:03:23,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:03:23" (3/3) ... [2019-11-28 18:03:23,571 INFO L109 eAbstractionObserver]: Analyzing ICFG mix011_power.opt.i [2019-11-28 18:03:23,581 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:03:23,582 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:03:23,589 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:03:23,590 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:03:23,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,638 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,638 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,641 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,642 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,671 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,671 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,672 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,672 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,672 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:23,731 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-28 18:03:23,753 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:03:23,754 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:03:23,754 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:03:23,754 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:03:23,754 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:03:23,754 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:03:23,755 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:03:23,755 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:03:23,774 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 242 transitions [2019-11-28 18:03:23,776 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 242 transitions [2019-11-28 18:03:23,892 INFO L134 PetriNetUnfolder]: 56/239 cut-off events. [2019-11-28 18:03:23,892 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:03:23,921 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 239 events. 56/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 909 event pairs. 9/190 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-11-28 18:03:23,961 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 242 transitions [2019-11-28 18:03:24,041 INFO L134 PetriNetUnfolder]: 56/239 cut-off events. [2019-11-28 18:03:24,042 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:03:24,054 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 239 events. 56/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 909 event pairs. 9/190 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-11-28 18:03:24,087 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-11-28 18:03:24,089 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:03:29,487 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-11-28 18:03:29,591 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-28 18:03:30,046 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-11-28 18:03:30,196 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-28 18:03:30,502 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-28 18:03:30,636 INFO L206 etLargeBlockEncoding]: Checked pairs total: 115591 [2019-11-28 18:03:30,636 INFO L214 etLargeBlockEncoding]: Total number of compositions: 128 [2019-11-28 18:03:30,639 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 103 places, 122 transitions [2019-11-28 18:03:34,556 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 39870 states. [2019-11-28 18:03:34,558 INFO L276 IsEmpty]: Start isEmpty. Operand 39870 states. [2019-11-28 18:03:34,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 18:03:34,564 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:34,565 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:34,566 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:03:34,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:34,570 INFO L82 PathProgramCache]: Analyzing trace with hash 191430122, now seen corresponding path program 1 times [2019-11-28 18:03:34,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:34,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006869570] [2019-11-28 18:03:34,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:34,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:34,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:03:34,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006869570] [2019-11-28 18:03:34,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:34,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:03:34,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604216200] [2019-11-28 18:03:34,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:03:34,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:34,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:03:34,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:03:34,915 INFO L87 Difference]: Start difference. First operand 39870 states. Second operand 3 states. [2019-11-28 18:03:35,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:35,663 INFO L93 Difference]: Finished difference Result 39574 states and 160408 transitions. [2019-11-28 18:03:35,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:03:35,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-28 18:03:35,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:36,052 INFO L225 Difference]: With dead ends: 39574 [2019-11-28 18:03:36,060 INFO L226 Difference]: Without dead ends: 36868 [2019-11-28 18:03:36,063 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:03:37,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36868 states. [2019-11-28 18:03:37,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36868 to 36868. [2019-11-28 18:03:37,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36868 states. [2019-11-28 18:03:38,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36868 states to 36868 states and 149325 transitions. [2019-11-28 18:03:38,303 INFO L78 Accepts]: Start accepts. Automaton has 36868 states and 149325 transitions. Word has length 7 [2019-11-28 18:03:38,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:38,304 INFO L462 AbstractCegarLoop]: Abstraction has 36868 states and 149325 transitions. [2019-11-28 18:03:38,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:03:38,305 INFO L276 IsEmpty]: Start isEmpty. Operand 36868 states and 149325 transitions. [2019-11-28 18:03:38,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 18:03:38,310 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:38,310 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:38,311 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:03:38,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:38,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1210424527, now seen corresponding path program 1 times [2019-11-28 18:03:38,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:38,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402789022] [2019-11-28 18:03:38,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:38,456 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:03:38,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402789022] [2019-11-28 18:03:38,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:38,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:03:38,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944183009] [2019-11-28 18:03:38,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:03:38,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:38,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:03:38,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:03:38,460 INFO L87 Difference]: Start difference. First operand 36868 states and 149325 transitions. Second operand 4 states. [2019-11-28 18:03:39,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:39,316 INFO L93 Difference]: Finished difference Result 23583 states and 83510 transitions. [2019-11-28 18:03:39,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:03:39,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-28 18:03:39,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:39,410 INFO L225 Difference]: With dead ends: 23583 [2019-11-28 18:03:39,410 INFO L226 Difference]: Without dead ends: 20877 [2019-11-28 18:03:39,413 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:03:39,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20877 states. [2019-11-28 18:03:40,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20877 to 20877. [2019-11-28 18:03:40,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20877 states. [2019-11-28 18:03:40,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20877 states to 20877 states and 73863 transitions. [2019-11-28 18:03:40,243 INFO L78 Accepts]: Start accepts. Automaton has 20877 states and 73863 transitions. Word has length 13 [2019-11-28 18:03:40,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:40,244 INFO L462 AbstractCegarLoop]: Abstraction has 20877 states and 73863 transitions. [2019-11-28 18:03:40,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:03:40,244 INFO L276 IsEmpty]: Start isEmpty. Operand 20877 states and 73863 transitions. [2019-11-28 18:03:40,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:03:40,247 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:40,247 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:40,247 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:03:40,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:40,248 INFO L82 PathProgramCache]: Analyzing trace with hash -683536690, now seen corresponding path program 1 times [2019-11-28 18:03:40,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:40,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092391555] [2019-11-28 18:03:40,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:40,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:40,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:03:40,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092391555] [2019-11-28 18:03:40,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:40,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:03:40,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27353029] [2019-11-28 18:03:40,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:03:40,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:40,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:03:40,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:03:40,352 INFO L87 Difference]: Start difference. First operand 20877 states and 73863 transitions. Second operand 4 states. [2019-11-28 18:03:40,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:40,819 INFO L93 Difference]: Finished difference Result 31787 states and 108416 transitions. [2019-11-28 18:03:40,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:03:40,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:03:40,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:41,000 INFO L225 Difference]: With dead ends: 31787 [2019-11-28 18:03:41,000 INFO L226 Difference]: Without dead ends: 31772 [2019-11-28 18:03:41,001 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:03:41,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31772 states. [2019-11-28 18:03:42,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31772 to 30600. [2019-11-28 18:03:42,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30600 states. [2019-11-28 18:03:42,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30600 states to 30600 states and 105187 transitions. [2019-11-28 18:03:42,743 INFO L78 Accepts]: Start accepts. Automaton has 30600 states and 105187 transitions. Word has length 14 [2019-11-28 18:03:42,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:42,744 INFO L462 AbstractCegarLoop]: Abstraction has 30600 states and 105187 transitions. [2019-11-28 18:03:42,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:03:42,749 INFO L276 IsEmpty]: Start isEmpty. Operand 30600 states and 105187 transitions. [2019-11-28 18:03:42,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:03:42,753 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:42,753 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:03:42,753 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:03:42,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:42,754 INFO L82 PathProgramCache]: Analyzing trace with hash -2049494264, now seen corresponding path program 1 times [2019-11-28 18:03:42,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:42,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20648355] [2019-11-28 18:03:42,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:42,837 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:03:42,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20648355] [2019-11-28 18:03:42,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:42,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:03:42,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698937179] [2019-11-28 18:03:42,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:03:42,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:42,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:03:42,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:03:42,844 INFO L87 Difference]: Start difference. First operand 30600 states and 105187 transitions. Second operand 4 states. [2019-11-28 18:03:43,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:43,241 INFO L93 Difference]: Finished difference Result 40226 states and 135997 transitions. [2019-11-28 18:03:43,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:03:43,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-28 18:03:43,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:43,323 INFO L225 Difference]: With dead ends: 40226 [2019-11-28 18:03:43,323 INFO L226 Difference]: Without dead ends: 40157 [2019-11-28 18:03:43,323 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:03:43,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40157 states. [2019-11-28 18:03:44,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40157 to 35465. [2019-11-28 18:03:44,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35465 states. [2019-11-28 18:03:44,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35465 states to 35465 states and 121322 transitions. [2019-11-28 18:03:44,255 INFO L78 Accepts]: Start accepts. Automaton has 35465 states and 121322 transitions. Word has length 16 [2019-11-28 18:03:44,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:44,255 INFO L462 AbstractCegarLoop]: Abstraction has 35465 states and 121322 transitions. [2019-11-28 18:03:44,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:03:44,255 INFO L276 IsEmpty]: Start isEmpty. Operand 35465 states and 121322 transitions. [2019-11-28 18:03:44,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 18:03:44,262 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:44,263 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:03:44,263 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:03:44,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:44,263 INFO L82 PathProgramCache]: Analyzing trace with hash -883448571, now seen corresponding path program 1 times [2019-11-28 18:03:44,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:44,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573047111] [2019-11-28 18:03:44,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:44,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:03:44,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573047111] [2019-11-28 18:03:44,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:44,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:03:44,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346409433] [2019-11-28 18:03:44,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:03:44,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:44,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:03:44,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:03:44,346 INFO L87 Difference]: Start difference. First operand 35465 states and 121322 transitions. Second operand 5 states. [2019-11-28 18:03:44,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:44,415 INFO L93 Difference]: Finished difference Result 7382 states and 22115 transitions. [2019-11-28 18:03:44,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:03:44,415 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-28 18:03:44,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:44,424 INFO L225 Difference]: With dead ends: 7382 [2019-11-28 18:03:44,424 INFO L226 Difference]: Without dead ends: 5258 [2019-11-28 18:03:44,425 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:03:44,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2019-11-28 18:03:44,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 5258. [2019-11-28 18:03:44,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5258 states. [2019-11-28 18:03:44,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5258 states to 5258 states and 14903 transitions. [2019-11-28 18:03:44,515 INFO L78 Accepts]: Start accepts. Automaton has 5258 states and 14903 transitions. Word has length 19 [2019-11-28 18:03:44,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:44,515 INFO L462 AbstractCegarLoop]: Abstraction has 5258 states and 14903 transitions. [2019-11-28 18:03:44,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:03:44,515 INFO L276 IsEmpty]: Start isEmpty. Operand 5258 states and 14903 transitions. [2019-11-28 18:03:44,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 18:03:44,524 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:44,525 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:44,525 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:03:44,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:44,525 INFO L82 PathProgramCache]: Analyzing trace with hash 350149048, now seen corresponding path program 1 times [2019-11-28 18:03:44,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:44,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983870473] [2019-11-28 18:03:44,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:44,597 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:03:44,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983870473] [2019-11-28 18:03:44,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:44,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:03:44,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472754390] [2019-11-28 18:03:44,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:03:44,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:44,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:03:44,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:03:44,600 INFO L87 Difference]: Start difference. First operand 5258 states and 14903 transitions. Second operand 5 states. [2019-11-28 18:03:45,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:45,402 INFO L93 Difference]: Finished difference Result 5774 states and 15950 transitions. [2019-11-28 18:03:45,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:03:45,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 18:03:45,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:45,412 INFO L225 Difference]: With dead ends: 5774 [2019-11-28 18:03:45,412 INFO L226 Difference]: Without dead ends: 5773 [2019-11-28 18:03:45,413 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:03:45,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5773 states. [2019-11-28 18:03:45,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5773 to 5491. [2019-11-28 18:03:45,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5491 states. [2019-11-28 18:03:45,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5491 states to 5491 states and 15399 transitions. [2019-11-28 18:03:45,479 INFO L78 Accepts]: Start accepts. Automaton has 5491 states and 15399 transitions. Word has length 31 [2019-11-28 18:03:45,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:45,479 INFO L462 AbstractCegarLoop]: Abstraction has 5491 states and 15399 transitions. [2019-11-28 18:03:45,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:03:45,479 INFO L276 IsEmpty]: Start isEmpty. Operand 5491 states and 15399 transitions. [2019-11-28 18:03:45,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 18:03:45,490 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:45,490 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] [2019-11-28 18:03:45,491 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:03:45,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:45,491 INFO L82 PathProgramCache]: Analyzing trace with hash -243852197, now seen corresponding path program 1 times [2019-11-28 18:03:45,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:45,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21089004] [2019-11-28 18:03:45,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:45,592 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:03:45,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21089004] [2019-11-28 18:03:45,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:45,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:03:45,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015746309] [2019-11-28 18:03:45,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:03:45,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:45,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:03:45,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:03:45,595 INFO L87 Difference]: Start difference. First operand 5491 states and 15399 transitions. Second operand 4 states. [2019-11-28 18:03:45,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:45,635 INFO L93 Difference]: Finished difference Result 6690 states and 18128 transitions. [2019-11-28 18:03:45,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:03:45,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-11-28 18:03:45,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:45,646 INFO L225 Difference]: With dead ends: 6690 [2019-11-28 18:03:45,647 INFO L226 Difference]: Without dead ends: 6458 [2019-11-28 18:03:45,647 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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:03:45,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6458 states. [2019-11-28 18:03:45,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6458 to 6361. [2019-11-28 18:03:45,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6361 states. [2019-11-28 18:03:45,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6361 states to 6361 states and 17371 transitions. [2019-11-28 18:03:45,750 INFO L78 Accepts]: Start accepts. Automaton has 6361 states and 17371 transitions. Word has length 36 [2019-11-28 18:03:45,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:45,751 INFO L462 AbstractCegarLoop]: Abstraction has 6361 states and 17371 transitions. [2019-11-28 18:03:45,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:03:45,751 INFO L276 IsEmpty]: Start isEmpty. Operand 6361 states and 17371 transitions. [2019-11-28 18:03:45,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-28 18:03:45,763 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:45,763 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:45,764 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:03:45,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:45,764 INFO L82 PathProgramCache]: Analyzing trace with hash -196896900, now seen corresponding path program 1 times [2019-11-28 18:03:45,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:45,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345043640] [2019-11-28 18:03:45,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:45,892 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:03:45,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345043640] [2019-11-28 18:03:45,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:45,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:03:45,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126896058] [2019-11-28 18:03:45,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:03:45,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:45,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:03:45,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:03:45,895 INFO L87 Difference]: Start difference. First operand 6361 states and 17371 transitions. Second operand 6 states. [2019-11-28 18:03:45,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:45,985 INFO L93 Difference]: Finished difference Result 4756 states and 13565 transitions. [2019-11-28 18:03:45,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:03:45,987 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-11-28 18:03:45,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:45,995 INFO L225 Difference]: With dead ends: 4756 [2019-11-28 18:03:45,995 INFO L226 Difference]: Without dead ends: 4525 [2019-11-28 18:03:45,996 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:03:46,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4525 states. [2019-11-28 18:03:46,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4525 to 3951. [2019-11-28 18:03:46,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3951 states. [2019-11-28 18:03:46,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3951 states to 3951 states and 11725 transitions. [2019-11-28 18:03:46,051 INFO L78 Accepts]: Start accepts. Automaton has 3951 states and 11725 transitions. Word has length 44 [2019-11-28 18:03:46,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:46,051 INFO L462 AbstractCegarLoop]: Abstraction has 3951 states and 11725 transitions. [2019-11-28 18:03:46,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:03:46,052 INFO L276 IsEmpty]: Start isEmpty. Operand 3951 states and 11725 transitions. [2019-11-28 18:03:46,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-28 18:03:46,058 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:46,059 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:46,059 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:03:46,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:46,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1135209702, now seen corresponding path program 1 times [2019-11-28 18:03:46,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:46,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514749970] [2019-11-28 18:03:46,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:46,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:46,189 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:03:46,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514749970] [2019-11-28 18:03:46,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:46,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:03:46,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801295737] [2019-11-28 18:03:46,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:03:46,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:46,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:03:46,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:03:46,192 INFO L87 Difference]: Start difference. First operand 3951 states and 11725 transitions. Second operand 4 states. [2019-11-28 18:03:46,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:46,252 INFO L93 Difference]: Finished difference Result 5783 states and 16310 transitions. [2019-11-28 18:03:46,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:03:46,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-28 18:03:46,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:46,263 INFO L225 Difference]: With dead ends: 5783 [2019-11-28 18:03:46,263 INFO L226 Difference]: Without dead ends: 5196 [2019-11-28 18:03:46,264 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:03:46,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5196 states. [2019-11-28 18:03:46,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5196 to 3591. [2019-11-28 18:03:46,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3591 states. [2019-11-28 18:03:46,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3591 states to 3591 states and 10729 transitions. [2019-11-28 18:03:46,338 INFO L78 Accepts]: Start accepts. Automaton has 3591 states and 10729 transitions. Word has length 61 [2019-11-28 18:03:46,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:46,338 INFO L462 AbstractCegarLoop]: Abstraction has 3591 states and 10729 transitions. [2019-11-28 18:03:46,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:03:46,338 INFO L276 IsEmpty]: Start isEmpty. Operand 3591 states and 10729 transitions. [2019-11-28 18:03:46,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-28 18:03:46,344 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:46,345 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:46,345 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:03:46,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:46,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1552184320, now seen corresponding path program 2 times [2019-11-28 18:03:46,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:46,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213757122] [2019-11-28 18:03:46,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:46,612 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:03:46,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213757122] [2019-11-28 18:03:46,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:46,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 18:03:46,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814614530] [2019-11-28 18:03:46,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 18:03:46,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:46,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 18:03:46,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-28 18:03:46,616 INFO L87 Difference]: Start difference. First operand 3591 states and 10729 transitions. Second operand 8 states. [2019-11-28 18:03:47,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:47,337 INFO L93 Difference]: Finished difference Result 8426 states and 23272 transitions. [2019-11-28 18:03:47,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:03:47,338 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2019-11-28 18:03:47,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:47,350 INFO L225 Difference]: With dead ends: 8426 [2019-11-28 18:03:47,350 INFO L226 Difference]: Without dead ends: 8360 [2019-11-28 18:03:47,351 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-11-28 18:03:47,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8360 states. [2019-11-28 18:03:47,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8360 to 5068. [2019-11-28 18:03:47,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5068 states. [2019-11-28 18:03:47,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5068 states to 5068 states and 14553 transitions. [2019-11-28 18:03:47,448 INFO L78 Accepts]: Start accepts. Automaton has 5068 states and 14553 transitions. Word has length 61 [2019-11-28 18:03:47,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:47,448 INFO L462 AbstractCegarLoop]: Abstraction has 5068 states and 14553 transitions. [2019-11-28 18:03:47,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 18:03:47,448 INFO L276 IsEmpty]: Start isEmpty. Operand 5068 states and 14553 transitions. [2019-11-28 18:03:47,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-28 18:03:47,456 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:47,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:47,456 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:03:47,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:47,457 INFO L82 PathProgramCache]: Analyzing trace with hash 2075558236, now seen corresponding path program 3 times [2019-11-28 18:03:47,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:47,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110764741] [2019-11-28 18:03:47,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:47,533 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:03:47,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110764741] [2019-11-28 18:03:47,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:47,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:03:47,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418594854] [2019-11-28 18:03:47,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:03:47,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:47,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:03:47,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:03:47,536 INFO L87 Difference]: Start difference. First operand 5068 states and 14553 transitions. Second operand 3 states. [2019-11-28 18:03:47,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:47,565 INFO L93 Difference]: Finished difference Result 5068 states and 14552 transitions. [2019-11-28 18:03:47,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:03:47,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-28 18:03:47,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:47,575 INFO L225 Difference]: With dead ends: 5068 [2019-11-28 18:03:47,575 INFO L226 Difference]: Without dead ends: 5068 [2019-11-28 18:03:47,576 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:03:47,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5068 states. [2019-11-28 18:03:47,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5068 to 4974. [2019-11-28 18:03:47,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4974 states. [2019-11-28 18:03:47,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4974 states to 4974 states and 14347 transitions. [2019-11-28 18:03:47,662 INFO L78 Accepts]: Start accepts. Automaton has 4974 states and 14347 transitions. Word has length 61 [2019-11-28 18:03:47,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:47,662 INFO L462 AbstractCegarLoop]: Abstraction has 4974 states and 14347 transitions. [2019-11-28 18:03:47,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:03:47,663 INFO L276 IsEmpty]: Start isEmpty. Operand 4974 states and 14347 transitions. [2019-11-28 18:03:47,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-28 18:03:47,673 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:47,673 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:47,674 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:03:47,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:47,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1956331133, now seen corresponding path program 1 times [2019-11-28 18:03:47,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:47,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560603542] [2019-11-28 18:03:47,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:47,805 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:03:47,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560603542] [2019-11-28 18:03:47,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:47,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:03:47,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125853913] [2019-11-28 18:03:47,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:03:47,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:47,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:03:47,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:03:47,808 INFO L87 Difference]: Start difference. First operand 4974 states and 14347 transitions. Second operand 7 states. [2019-11-28 18:03:48,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:48,344 INFO L93 Difference]: Finished difference Result 15920 states and 43844 transitions. [2019-11-28 18:03:48,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 18:03:48,344 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-11-28 18:03:48,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:48,371 INFO L225 Difference]: With dead ends: 15920 [2019-11-28 18:03:48,372 INFO L226 Difference]: Without dead ends: 14260 [2019-11-28 18:03:48,372 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-11-28 18:03:48,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14260 states. [2019-11-28 18:03:48,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14260 to 7705. [2019-11-28 18:03:48,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7705 states. [2019-11-28 18:03:48,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7705 states to 7705 states and 22625 transitions. [2019-11-28 18:03:48,542 INFO L78 Accepts]: Start accepts. Automaton has 7705 states and 22625 transitions. Word has length 62 [2019-11-28 18:03:48,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:48,542 INFO L462 AbstractCegarLoop]: Abstraction has 7705 states and 22625 transitions. [2019-11-28 18:03:48,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:03:48,543 INFO L276 IsEmpty]: Start isEmpty. Operand 7705 states and 22625 transitions. [2019-11-28 18:03:48,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-28 18:03:48,554 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:48,554 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:48,555 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:03:48,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:48,555 INFO L82 PathProgramCache]: Analyzing trace with hash -423408767, now seen corresponding path program 2 times [2019-11-28 18:03:48,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:48,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516515136] [2019-11-28 18:03:48,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:48,710 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:03:48,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516515136] [2019-11-28 18:03:48,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:48,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:03:48,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989704444] [2019-11-28 18:03:48,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:03:48,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:48,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:03:48,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:03:48,712 INFO L87 Difference]: Start difference. First operand 7705 states and 22625 transitions. Second operand 7 states. [2019-11-28 18:03:49,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:49,005 INFO L93 Difference]: Finished difference Result 18337 states and 52732 transitions. [2019-11-28 18:03:49,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 18:03:49,006 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-11-28 18:03:49,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:49,025 INFO L225 Difference]: With dead ends: 18337 [2019-11-28 18:03:49,025 INFO L226 Difference]: Without dead ends: 10633 [2019-11-28 18:03:49,026 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-11-28 18:03:49,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10633 states. [2019-11-28 18:03:49,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10633 to 8422. [2019-11-28 18:03:49,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8422 states. [2019-11-28 18:03:49,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8422 states to 8422 states and 24359 transitions. [2019-11-28 18:03:49,155 INFO L78 Accepts]: Start accepts. Automaton has 8422 states and 24359 transitions. Word has length 62 [2019-11-28 18:03:49,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:49,155 INFO L462 AbstractCegarLoop]: Abstraction has 8422 states and 24359 transitions. [2019-11-28 18:03:49,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:03:49,155 INFO L276 IsEmpty]: Start isEmpty. Operand 8422 states and 24359 transitions. [2019-11-28 18:03:49,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-28 18:03:49,169 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:49,169 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:49,169 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:03:49,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:49,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1589792780, now seen corresponding path program 1 times [2019-11-28 18:03:49,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:49,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909673822] [2019-11-28 18:03:49,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:49,275 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:03:49,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909673822] [2019-11-28 18:03:49,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:49,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:03:49,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844531920] [2019-11-28 18:03:49,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:03:49,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:49,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:03:49,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:03:49,279 INFO L87 Difference]: Start difference. First operand 8422 states and 24359 transitions. Second operand 5 states. [2019-11-28 18:03:49,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:49,372 INFO L93 Difference]: Finished difference Result 13178 states and 36545 transitions. [2019-11-28 18:03:49,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:03:49,373 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-11-28 18:03:49,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:49,381 INFO L225 Difference]: With dead ends: 13178 [2019-11-28 18:03:49,381 INFO L226 Difference]: Without dead ends: 3814 [2019-11-28 18:03:49,382 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:03:49,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3814 states. [2019-11-28 18:03:49,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3814 to 3458. [2019-11-28 18:03:49,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3458 states. [2019-11-28 18:03:49,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3458 states to 3458 states and 9087 transitions. [2019-11-28 18:03:49,451 INFO L78 Accepts]: Start accepts. Automaton has 3458 states and 9087 transitions. Word has length 63 [2019-11-28 18:03:49,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:49,452 INFO L462 AbstractCegarLoop]: Abstraction has 3458 states and 9087 transitions. [2019-11-28 18:03:49,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:03:49,452 INFO L276 IsEmpty]: Start isEmpty. Operand 3458 states and 9087 transitions. [2019-11-28 18:03:49,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-28 18:03:49,460 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:49,460 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:49,461 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:03:49,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:49,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1053035404, now seen corresponding path program 2 times [2019-11-28 18:03:49,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:49,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633944058] [2019-11-28 18:03:49,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:50,013 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:03:50,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633944058] [2019-11-28 18:03:50,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:50,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:03:50,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994604781] [2019-11-28 18:03:50,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:03:50,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:50,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:03:50,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:03:50,016 INFO L87 Difference]: Start difference. First operand 3458 states and 9087 transitions. Second operand 4 states. [2019-11-28 18:03:50,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:50,048 INFO L93 Difference]: Finished difference Result 3858 states and 9983 transitions. [2019-11-28 18:03:50,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:03:50,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-11-28 18:03:50,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:50,049 INFO L225 Difference]: With dead ends: 3858 [2019-11-28 18:03:50,050 INFO L226 Difference]: Without dead ends: 485 [2019-11-28 18:03:50,050 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:03:50,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-11-28 18:03:50,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 485. [2019-11-28 18:03:50,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-11-28 18:03:50,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 1027 transitions. [2019-11-28 18:03:50,061 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 1027 transitions. Word has length 63 [2019-11-28 18:03:50,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:50,061 INFO L462 AbstractCegarLoop]: Abstraction has 485 states and 1027 transitions. [2019-11-28 18:03:50,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:03:50,062 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 1027 transitions. [2019-11-28 18:03:50,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-28 18:03:50,063 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:50,063 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:50,063 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:03:50,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:50,064 INFO L82 PathProgramCache]: Analyzing trace with hash -2126696180, now seen corresponding path program 3 times [2019-11-28 18:03:50,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:50,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652084311] [2019-11-28 18:03:50,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:50,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:50,295 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:03:50,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652084311] [2019-11-28 18:03:50,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:50,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 18:03:50,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790681478] [2019-11-28 18:03:50,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 18:03:50,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:50,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 18:03:50,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-28 18:03:50,298 INFO L87 Difference]: Start difference. First operand 485 states and 1027 transitions. Second operand 13 states. [2019-11-28 18:03:51,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:51,046 INFO L93 Difference]: Finished difference Result 1163 states and 2483 transitions. [2019-11-28 18:03:51,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 18:03:51,046 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2019-11-28 18:03:51,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:51,048 INFO L225 Difference]: With dead ends: 1163 [2019-11-28 18:03:51,048 INFO L226 Difference]: Without dead ends: 960 [2019-11-28 18:03:51,049 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2019-11-28 18:03:51,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2019-11-28 18:03:51,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 506. [2019-11-28 18:03:51,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-11-28 18:03:51,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 1096 transitions. [2019-11-28 18:03:51,057 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 1096 transitions. Word has length 63 [2019-11-28 18:03:51,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:51,058 INFO L462 AbstractCegarLoop]: Abstraction has 506 states and 1096 transitions. [2019-11-28 18:03:51,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 18:03:51,058 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 1096 transitions. [2019-11-28 18:03:51,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-28 18:03:51,059 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:51,059 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:51,059 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:03:51,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:51,059 INFO L82 PathProgramCache]: Analyzing trace with hash 222753420, now seen corresponding path program 4 times [2019-11-28 18:03:51,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:51,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382340293] [2019-11-28 18:03:51,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:03:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:03:51,183 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:03:51,183 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:03:51,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1029] [1029] ULTIMATE.startENTRY-->L838: Formula: (let ((.cse0 (store |v_#valid_69| 0 0))) (and (= 0 v_~__unbuffered_p2_EAX~0_40) (= 0 v_~z$flush_delayed~0_312) (= v_~z$r_buff0_thd1~0_133 0) (= |v_#NULL.offset_6| 0) (= 0 v_~z$r_buff1_thd3~0_369) (= v_~__unbuffered_p2_EBX~0_30 0) (= v_~x~0_59 0) (= v_~z$read_delayed~0_6 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t284~0.base_31| 4) |v_#length_23|) (= v_~main$tmp_guard1~0_30 0) (= v_~z$w_buff0~0_407 0) (= v_~z$r_buff1_thd0~0_262 0) (= v_~z$r_buff1_thd1~0_201 0) (= 0 v_~__unbuffered_p1_EAX~0_53) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$mem_tmp~0_246) (= v_~z$r_buff1_thd2~0_361 0) (= |v_ULTIMATE.start_main_~#t284~0.offset_23| 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$w_buff0_used~0_953 0) (= v_~z$r_buff0_thd0~0_190 0) (= v_~a~0_20 0) (= v_~weak$$choice2~0_312 0) (= 0 |v_#NULL.base_6|) (= v_~__unbuffered_p1_EBX~0_29 0) (= 0 v_~z$r_buff0_thd3~0_586) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$w_buff1~0_282 0) (= v_~z$w_buff1_used~0_540 0) (= v_~z$r_buff0_thd2~0_401 0) (= 0 v_~weak$$choice0~0_233) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t284~0.base_31| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t284~0.base_31|) |v_ULTIMATE.start_main_~#t284~0.offset_23| 0)) |v_#memory_int_23|) (= v_~main$tmp_guard0~0_32 0) (= v_~__unbuffered_cnt~0_150 0) (= |v_#valid_67| (store .cse0 |v_ULTIMATE.start_main_~#t284~0.base_31| 1)) (= (select .cse0 |v_ULTIMATE.start_main_~#t284~0.base_31|) 0) (= v_~y~0_37 0) (= v_~z~0_322 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t284~0.base_31|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t285~0.base=|v_ULTIMATE.start_main_~#t285~0.base_22|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_21|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_361, #NULL.offset=|v_#NULL.offset_6|, ~a~0=v_~a~0_20, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_190, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_53, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_40, ~z$mem_tmp~0=v_~z$mem_tmp~0_246, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_58|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_540, ~z$flush_delayed~0=v_~z$flush_delayed~0_312, ULTIMATE.start_main_~#t286~0.offset=|v_ULTIMATE.start_main_~#t286~0.offset_18|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_52|, ULTIMATE.start_main_~#t285~0.offset=|v_ULTIMATE.start_main_~#t285~0.offset_18|, ~weak$$choice0~0=v_~weak$$choice0~0_233, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_40|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_201, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_586, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_150, ULTIMATE.start_main_~#t284~0.base=|v_ULTIMATE.start_main_~#t284~0.base_31|, ~x~0=v_~x~0_59, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_282, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t284~0.offset=|v_ULTIMATE.start_main_~#t284~0.offset_23|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_262, ~y~0=v_~y~0_37, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_401, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_953, ~z$w_buff0~0=v_~z$w_buff0~0_407, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_369, ULTIMATE.start_main_~#t286~0.base=|v_ULTIMATE.start_main_~#t286~0.base_22|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_73|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_28|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_446|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_322, ~weak$$choice2~0=v_~weak$$choice2~0_312, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_133} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t285~0.base, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t286~0.offset, ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_~#t285~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t284~0.base, ~x~0, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t284~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t286~0.base, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:03:51,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [974] [974] L838-1-->L840: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t285~0.base_10| 4)) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t285~0.base_10| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t285~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t285~0.base_10|) |v_ULTIMATE.start_main_~#t285~0.offset_9| 1)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t285~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t285~0.offset_9|) (not (= |v_ULTIMATE.start_main_~#t285~0.base_10| 0)) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t285~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t285~0.offset=|v_ULTIMATE.start_main_~#t285~0.offset_9|, ULTIMATE.start_main_~#t285~0.base=|v_ULTIMATE.start_main_~#t285~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_4|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t285~0.offset, ULTIMATE.start_main_~#t285~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-11-28 18:03:51,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L840-1-->L842: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t286~0.base_11|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t286~0.base_11| 4) |v_#length_17|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t286~0.base_11|) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t286~0.base_11| 1)) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t286~0.base_11|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t286~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t286~0.base_11|) |v_ULTIMATE.start_main_~#t286~0.offset_10| 2)) |v_#memory_int_17|) (= |v_ULTIMATE.start_main_~#t286~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t286~0.base=|v_ULTIMATE.start_main_~#t286~0.base_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t286~0.offset=|v_ULTIMATE.start_main_~#t286~0.offset_10|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t286~0.base, #length, ULTIMATE.start_main_~#t286~0.offset] because there is no mapped edge [2019-11-28 18:03:51,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [896] [896] P2ENTRY-->L4-3: Formula: (and (= |v_P2Thread1of1ForFork0_#in~arg.base_19| v_P2Thread1of1ForFork0_~arg.base_17) (= v_~z$w_buff0~0_55 v_~z$w_buff1~0_45) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_19)) (= |v_P2Thread1of1ForFork0_#in~arg.offset_19| v_P2Thread1of1ForFork0_~arg.offset_17) (= v_~z$w_buff0_used~0_158 v_~z$w_buff1_used~0_82) (= 1 v_~z$w_buff0~0_54) (= v_~z$w_buff0_used~0_157 1) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_19 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_17|) (= (ite (not (and (not (= 0 (mod v_~z$w_buff0_used~0_157 256))) (not (= (mod v_~z$w_buff1_used~0_82 256) 0)))) 1 0) |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_17|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_158, ~z$w_buff0~0=v_~z$w_buff0~0_55, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_19|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_17, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_19|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_17|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_157, ~z$w_buff0~0=v_~z$w_buff0~0_54, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_17, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_82, ~z$w_buff1~0=v_~z$w_buff1~0_45, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_19|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_19} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-11-28 18:03:51,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [954] [954] L800-2-->L800-5: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1997706063 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1997706063 256) 0)) (.cse2 (= |P2Thread1of1ForFork0_#t~ite28_Out-1997706063| |P2Thread1of1ForFork0_#t~ite29_Out-1997706063|))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_Out-1997706063| ~z$w_buff1~0_In-1997706063) (or .cse0 .cse1) .cse2) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out-1997706063| ~z$w_buff0~0_In-1997706063) (not .cse0) .cse2))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1997706063, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1997706063, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1997706063, ~z$w_buff1~0=~z$w_buff1~0_In-1997706063} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-1997706063|, ~z$w_buff0~0=~z$w_buff0~0_In-1997706063, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1997706063, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1997706063, ~z$w_buff1~0=~z$w_buff1~0_In-1997706063, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-1997706063|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-11-28 18:03:51,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] L805-->L806: Formula: (and (= v_~z$r_buff0_thd3~0_95 v_~z$r_buff0_thd3~0_94) (not (= (mod v_~weak$$choice2~0_47 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_47} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_9|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_94, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_6|, ~weak$$choice2~0=v_~weak$$choice2~0_47} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-11-28 18:03:51,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In270440562 256) 0))) (or (and (= ~z~0_In270440562 |P2Thread1of1ForFork0_#t~ite48_Out270440562|) .cse0) (and (= |P2Thread1of1ForFork0_#t~ite48_Out270440562| ~z$mem_tmp~0_In270440562) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In270440562, ~z$flush_delayed~0=~z$flush_delayed~0_In270440562, ~z~0=~z~0_In270440562} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out270440562|, ~z$mem_tmp~0=~z$mem_tmp~0_In270440562, ~z$flush_delayed~0=~z$flush_delayed~0_In270440562, ~z~0=~z~0_In270440562} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-11-28 18:03:51,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_36 1) (= v_P0Thread1of1ForFork1_~arg.base_7 |v_P0Thread1of1ForFork1_#in~arg.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_90 1) v_~__unbuffered_cnt~0_89) (= v_P0Thread1of1ForFork1_~arg.offset_7 |v_P0Thread1of1ForFork1_#in~arg.offset_9|) (= v_~a~0_13 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|} OutVars{~a~0=v_~a~0_13, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~x~0=v_~x~0_36, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_7} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-11-28 18:03:51,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L816-->L816-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1747071552 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1747071552 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite51_Out1747071552| ~z$w_buff0_used~0_In1747071552) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite51_Out1747071552| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1747071552, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1747071552} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1747071552, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1747071552, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out1747071552|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-11-28 18:03:51,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L817-->L817-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-39822262 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-39822262 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd3~0_In-39822262 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-39822262 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite52_Out-39822262|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-39822262 |P2Thread1of1ForFork0_#t~ite52_Out-39822262|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-39822262, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-39822262, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-39822262, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-39822262} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-39822262, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-39822262, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-39822262, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-39822262|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-39822262} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-11-28 18:03:51,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L818-->L819: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1897779497 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1897779497 256))) (.cse2 (= ~z$r_buff0_thd3~0_In-1897779497 ~z$r_buff0_thd3~0_Out-1897779497))) (or (and (not .cse0) (= ~z$r_buff0_thd3~0_Out-1897779497 0) (not .cse1)) (and .cse2 .cse1) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1897779497, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1897779497} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1897779497, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-1897779497, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-1897779497|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-11-28 18:03:51,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L819-->L819-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-408589243 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In-408589243 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-408589243 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-408589243 256) 0))) (or (and (= ~z$r_buff1_thd3~0_In-408589243 |P2Thread1of1ForFork0_#t~ite54_Out-408589243|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite54_Out-408589243| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-408589243, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-408589243, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-408589243, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-408589243} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-408589243, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out-408589243|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-408589243, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-408589243, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-408589243} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-11-28 18:03:51,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L819-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~z$r_buff1_thd3~0_301 |v_P2Thread1of1ForFork0_#t~ite54_30|) (= v_~__unbuffered_cnt~0_121 (+ v_~__unbuffered_cnt~0_122 1)) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_122} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_29|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_301, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_121, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-11-28 18:03:51,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-857758073 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite25_Out-857758073| ~z$mem_tmp~0_In-857758073) (not .cse0)) (and .cse0 (= |P1Thread1of1ForFork2_#t~ite25_Out-857758073| ~z~0_In-857758073)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-857758073, ~z$flush_delayed~0=~z$flush_delayed~0_In-857758073, ~z~0=~z~0_In-857758073} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-857758073, ~z$flush_delayed~0=~z$flush_delayed~0_In-857758073, ~z~0=~z~0_In-857758073, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-857758073|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-11-28 18:03:51,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L771-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= 0 v_~z$flush_delayed~0_126) (= v_~z~0_145 |v_P1Thread1of1ForFork2_#t~ite25_56|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_56|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~z$flush_delayed~0=v_~z$flush_delayed~0_126, ~z~0=v_~z~0_145, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_55|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-11-28 18:03:51,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] L846-->L848-2: Formula: (and (or (= 0 (mod v_~z$r_buff0_thd0~0_18 256)) (= 0 (mod v_~z$w_buff0_used~0_136 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_136, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_136, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:03:51,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L848-2-->L848-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-401490066 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite58_Out-401490066| |ULTIMATE.start_main_#t~ite59_Out-401490066|)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-401490066 256)))) (or (and (= |ULTIMATE.start_main_#t~ite58_Out-401490066| ~z~0_In-401490066) (or .cse0 .cse1) .cse2) (and (= |ULTIMATE.start_main_#t~ite58_Out-401490066| ~z$w_buff1~0_In-401490066) (not .cse1) .cse2 (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-401490066, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-401490066, ~z$w_buff1~0=~z$w_buff1~0_In-401490066, ~z~0=~z~0_In-401490066} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-401490066, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-401490066|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-401490066, ~z$w_buff1~0=~z$w_buff1~0_In-401490066, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-401490066|, ~z~0=~z~0_In-401490066} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-11-28 18:03:51,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L849-->L849-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-508657555 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-508657555 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-508657555 |ULTIMATE.start_main_#t~ite60_Out-508657555|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite60_Out-508657555|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-508657555, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-508657555} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-508657555|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-508657555, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-508657555} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-11-28 18:03:51,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L850-->L850-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In428191153 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In428191153 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In428191153 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In428191153 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite61_Out428191153|)) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In428191153 |ULTIMATE.start_main_#t~ite61_Out428191153|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In428191153, ~z$w_buff0_used~0=~z$w_buff0_used~0_In428191153, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In428191153, ~z$w_buff1_used~0=~z$w_buff1_used~0_In428191153} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In428191153, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out428191153|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In428191153, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In428191153, ~z$w_buff1_used~0=~z$w_buff1_used~0_In428191153} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-11-28 18:03:51,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L851-->L851-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1528948208 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1528948208 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite62_Out1528948208| 0)) (and (= |ULTIMATE.start_main_#t~ite62_Out1528948208| ~z$r_buff0_thd0~0_In1528948208) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1528948208, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1528948208} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1528948208|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1528948208, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1528948208} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-11-28 18:03:51,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L852-->L852-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd0~0_In-2001192419 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-2001192419 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-2001192419 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-2001192419 256) 0))) (or (and (= ~z$r_buff1_thd0~0_In-2001192419 |ULTIMATE.start_main_#t~ite63_Out-2001192419|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite63_Out-2001192419|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2001192419, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2001192419, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2001192419, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2001192419} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-2001192419|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2001192419, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2001192419, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2001192419, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2001192419} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-11-28 18:03:51,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1022] [1022] L852-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z$r_buff1_thd0~0_249 |v_ULTIMATE.start_main_#t~ite63_36|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= (mod v_~main$tmp_guard1~0_21 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~main$tmp_guard1~0_21 (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_31) (= v_~x~0_50 2) (= v_~__unbuffered_p1_EBX~0_20 0) (= v_~__unbuffered_p2_EBX~0_21 0) (= 1 v_~__unbuffered_p1_EAX~0_44))) 1 0)) 0 1))) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_36|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~x~0=v_~x~0_50} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_35|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_249, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~x~0=v_~x~0_50, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:03:51,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:03:51 BasicIcfg [2019-11-28 18:03:51,338 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:03:51,339 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:03:51,339 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:03:51,339 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:03:51,340 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:03:23" (3/4) ... [2019-11-28 18:03:51,342 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:03:51,343 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1029] [1029] ULTIMATE.startENTRY-->L838: Formula: (let ((.cse0 (store |v_#valid_69| 0 0))) (and (= 0 v_~__unbuffered_p2_EAX~0_40) (= 0 v_~z$flush_delayed~0_312) (= v_~z$r_buff0_thd1~0_133 0) (= |v_#NULL.offset_6| 0) (= 0 v_~z$r_buff1_thd3~0_369) (= v_~__unbuffered_p2_EBX~0_30 0) (= v_~x~0_59 0) (= v_~z$read_delayed~0_6 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t284~0.base_31| 4) |v_#length_23|) (= v_~main$tmp_guard1~0_30 0) (= v_~z$w_buff0~0_407 0) (= v_~z$r_buff1_thd0~0_262 0) (= v_~z$r_buff1_thd1~0_201 0) (= 0 v_~__unbuffered_p1_EAX~0_53) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$mem_tmp~0_246) (= v_~z$r_buff1_thd2~0_361 0) (= |v_ULTIMATE.start_main_~#t284~0.offset_23| 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$w_buff0_used~0_953 0) (= v_~z$r_buff0_thd0~0_190 0) (= v_~a~0_20 0) (= v_~weak$$choice2~0_312 0) (= 0 |v_#NULL.base_6|) (= v_~__unbuffered_p1_EBX~0_29 0) (= 0 v_~z$r_buff0_thd3~0_586) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$w_buff1~0_282 0) (= v_~z$w_buff1_used~0_540 0) (= v_~z$r_buff0_thd2~0_401 0) (= 0 v_~weak$$choice0~0_233) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t284~0.base_31| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t284~0.base_31|) |v_ULTIMATE.start_main_~#t284~0.offset_23| 0)) |v_#memory_int_23|) (= v_~main$tmp_guard0~0_32 0) (= v_~__unbuffered_cnt~0_150 0) (= |v_#valid_67| (store .cse0 |v_ULTIMATE.start_main_~#t284~0.base_31| 1)) (= (select .cse0 |v_ULTIMATE.start_main_~#t284~0.base_31|) 0) (= v_~y~0_37 0) (= v_~z~0_322 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t284~0.base_31|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t285~0.base=|v_ULTIMATE.start_main_~#t285~0.base_22|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_21|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_361, #NULL.offset=|v_#NULL.offset_6|, ~a~0=v_~a~0_20, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_190, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_53, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_40, ~z$mem_tmp~0=v_~z$mem_tmp~0_246, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_58|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_540, ~z$flush_delayed~0=v_~z$flush_delayed~0_312, ULTIMATE.start_main_~#t286~0.offset=|v_ULTIMATE.start_main_~#t286~0.offset_18|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_52|, ULTIMATE.start_main_~#t285~0.offset=|v_ULTIMATE.start_main_~#t285~0.offset_18|, ~weak$$choice0~0=v_~weak$$choice0~0_233, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_40|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_201, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_586, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_150, ULTIMATE.start_main_~#t284~0.base=|v_ULTIMATE.start_main_~#t284~0.base_31|, ~x~0=v_~x~0_59, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_282, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t284~0.offset=|v_ULTIMATE.start_main_~#t284~0.offset_23|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_262, ~y~0=v_~y~0_37, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_401, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_953, ~z$w_buff0~0=v_~z$w_buff0~0_407, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_369, ULTIMATE.start_main_~#t286~0.base=|v_ULTIMATE.start_main_~#t286~0.base_22|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_73|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_28|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_446|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_322, ~weak$$choice2~0=v_~weak$$choice2~0_312, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_133} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t285~0.base, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t286~0.offset, ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_~#t285~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t284~0.base, ~x~0, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t284~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t286~0.base, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:03:51,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [974] [974] L838-1-->L840: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t285~0.base_10| 4)) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t285~0.base_10| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t285~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t285~0.base_10|) |v_ULTIMATE.start_main_~#t285~0.offset_9| 1)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t285~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t285~0.offset_9|) (not (= |v_ULTIMATE.start_main_~#t285~0.base_10| 0)) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t285~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t285~0.offset=|v_ULTIMATE.start_main_~#t285~0.offset_9|, ULTIMATE.start_main_~#t285~0.base=|v_ULTIMATE.start_main_~#t285~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_4|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t285~0.offset, ULTIMATE.start_main_~#t285~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-11-28 18:03:51,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L840-1-->L842: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t286~0.base_11|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t286~0.base_11| 4) |v_#length_17|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t286~0.base_11|) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t286~0.base_11| 1)) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t286~0.base_11|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t286~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t286~0.base_11|) |v_ULTIMATE.start_main_~#t286~0.offset_10| 2)) |v_#memory_int_17|) (= |v_ULTIMATE.start_main_~#t286~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t286~0.base=|v_ULTIMATE.start_main_~#t286~0.base_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t286~0.offset=|v_ULTIMATE.start_main_~#t286~0.offset_10|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t286~0.base, #length, ULTIMATE.start_main_~#t286~0.offset] because there is no mapped edge [2019-11-28 18:03:51,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [896] [896] P2ENTRY-->L4-3: Formula: (and (= |v_P2Thread1of1ForFork0_#in~arg.base_19| v_P2Thread1of1ForFork0_~arg.base_17) (= v_~z$w_buff0~0_55 v_~z$w_buff1~0_45) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_19)) (= |v_P2Thread1of1ForFork0_#in~arg.offset_19| v_P2Thread1of1ForFork0_~arg.offset_17) (= v_~z$w_buff0_used~0_158 v_~z$w_buff1_used~0_82) (= 1 v_~z$w_buff0~0_54) (= v_~z$w_buff0_used~0_157 1) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_19 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_17|) (= (ite (not (and (not (= 0 (mod v_~z$w_buff0_used~0_157 256))) (not (= (mod v_~z$w_buff1_used~0_82 256) 0)))) 1 0) |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_17|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_158, ~z$w_buff0~0=v_~z$w_buff0~0_55, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_19|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_17, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_19|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_17|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_157, ~z$w_buff0~0=v_~z$w_buff0~0_54, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_17, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_82, ~z$w_buff1~0=v_~z$w_buff1~0_45, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_19|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_19} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-11-28 18:03:51,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [954] [954] L800-2-->L800-5: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1997706063 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1997706063 256) 0)) (.cse2 (= |P2Thread1of1ForFork0_#t~ite28_Out-1997706063| |P2Thread1of1ForFork0_#t~ite29_Out-1997706063|))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_Out-1997706063| ~z$w_buff1~0_In-1997706063) (or .cse0 .cse1) .cse2) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out-1997706063| ~z$w_buff0~0_In-1997706063) (not .cse0) .cse2))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1997706063, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1997706063, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1997706063, ~z$w_buff1~0=~z$w_buff1~0_In-1997706063} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-1997706063|, ~z$w_buff0~0=~z$w_buff0~0_In-1997706063, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1997706063, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1997706063, ~z$w_buff1~0=~z$w_buff1~0_In-1997706063, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-1997706063|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-11-28 18:03:51,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] L805-->L806: Formula: (and (= v_~z$r_buff0_thd3~0_95 v_~z$r_buff0_thd3~0_94) (not (= (mod v_~weak$$choice2~0_47 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_47} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_9|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_94, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_6|, ~weak$$choice2~0=v_~weak$$choice2~0_47} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-11-28 18:03:51,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In270440562 256) 0))) (or (and (= ~z~0_In270440562 |P2Thread1of1ForFork0_#t~ite48_Out270440562|) .cse0) (and (= |P2Thread1of1ForFork0_#t~ite48_Out270440562| ~z$mem_tmp~0_In270440562) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In270440562, ~z$flush_delayed~0=~z$flush_delayed~0_In270440562, ~z~0=~z~0_In270440562} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out270440562|, ~z$mem_tmp~0=~z$mem_tmp~0_In270440562, ~z$flush_delayed~0=~z$flush_delayed~0_In270440562, ~z~0=~z~0_In270440562} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-11-28 18:03:51,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_36 1) (= v_P0Thread1of1ForFork1_~arg.base_7 |v_P0Thread1of1ForFork1_#in~arg.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_90 1) v_~__unbuffered_cnt~0_89) (= v_P0Thread1of1ForFork1_~arg.offset_7 |v_P0Thread1of1ForFork1_#in~arg.offset_9|) (= v_~a~0_13 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|} OutVars{~a~0=v_~a~0_13, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~x~0=v_~x~0_36, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_7} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-11-28 18:03:51,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L816-->L816-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1747071552 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1747071552 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite51_Out1747071552| ~z$w_buff0_used~0_In1747071552) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite51_Out1747071552| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1747071552, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1747071552} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1747071552, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1747071552, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out1747071552|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-11-28 18:03:51,366 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L817-->L817-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-39822262 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-39822262 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd3~0_In-39822262 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-39822262 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite52_Out-39822262|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-39822262 |P2Thread1of1ForFork0_#t~ite52_Out-39822262|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-39822262, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-39822262, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-39822262, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-39822262} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-39822262, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-39822262, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-39822262, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-39822262|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-39822262} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-11-28 18:03:51,367 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L818-->L819: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1897779497 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1897779497 256))) (.cse2 (= ~z$r_buff0_thd3~0_In-1897779497 ~z$r_buff0_thd3~0_Out-1897779497))) (or (and (not .cse0) (= ~z$r_buff0_thd3~0_Out-1897779497 0) (not .cse1)) (and .cse2 .cse1) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1897779497, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1897779497} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1897779497, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-1897779497, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-1897779497|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-11-28 18:03:51,367 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L819-->L819-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-408589243 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In-408589243 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-408589243 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-408589243 256) 0))) (or (and (= ~z$r_buff1_thd3~0_In-408589243 |P2Thread1of1ForFork0_#t~ite54_Out-408589243|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite54_Out-408589243| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-408589243, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-408589243, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-408589243, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-408589243} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-408589243, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out-408589243|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-408589243, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-408589243, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-408589243} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-11-28 18:03:51,367 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L819-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~z$r_buff1_thd3~0_301 |v_P2Thread1of1ForFork0_#t~ite54_30|) (= v_~__unbuffered_cnt~0_121 (+ v_~__unbuffered_cnt~0_122 1)) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_122} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_29|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_301, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_121, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-11-28 18:03:51,367 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-857758073 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite25_Out-857758073| ~z$mem_tmp~0_In-857758073) (not .cse0)) (and .cse0 (= |P1Thread1of1ForFork2_#t~ite25_Out-857758073| ~z~0_In-857758073)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-857758073, ~z$flush_delayed~0=~z$flush_delayed~0_In-857758073, ~z~0=~z~0_In-857758073} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-857758073, ~z$flush_delayed~0=~z$flush_delayed~0_In-857758073, ~z~0=~z~0_In-857758073, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-857758073|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-11-28 18:03:51,367 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L771-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= 0 v_~z$flush_delayed~0_126) (= v_~z~0_145 |v_P1Thread1of1ForFork2_#t~ite25_56|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_56|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~z$flush_delayed~0=v_~z$flush_delayed~0_126, ~z~0=v_~z~0_145, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_55|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-11-28 18:03:51,368 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] L846-->L848-2: Formula: (and (or (= 0 (mod v_~z$r_buff0_thd0~0_18 256)) (= 0 (mod v_~z$w_buff0_used~0_136 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_136, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_136, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:03:51,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L848-2-->L848-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-401490066 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite58_Out-401490066| |ULTIMATE.start_main_#t~ite59_Out-401490066|)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-401490066 256)))) (or (and (= |ULTIMATE.start_main_#t~ite58_Out-401490066| ~z~0_In-401490066) (or .cse0 .cse1) .cse2) (and (= |ULTIMATE.start_main_#t~ite58_Out-401490066| ~z$w_buff1~0_In-401490066) (not .cse1) .cse2 (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-401490066, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-401490066, ~z$w_buff1~0=~z$w_buff1~0_In-401490066, ~z~0=~z~0_In-401490066} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-401490066, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-401490066|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-401490066, ~z$w_buff1~0=~z$w_buff1~0_In-401490066, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-401490066|, ~z~0=~z~0_In-401490066} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-11-28 18:03:51,370 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L849-->L849-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-508657555 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-508657555 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-508657555 |ULTIMATE.start_main_#t~ite60_Out-508657555|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite60_Out-508657555|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-508657555, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-508657555} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-508657555|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-508657555, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-508657555} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-11-28 18:03:51,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L850-->L850-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In428191153 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In428191153 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In428191153 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In428191153 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite61_Out428191153|)) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In428191153 |ULTIMATE.start_main_#t~ite61_Out428191153|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In428191153, ~z$w_buff0_used~0=~z$w_buff0_used~0_In428191153, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In428191153, ~z$w_buff1_used~0=~z$w_buff1_used~0_In428191153} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In428191153, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out428191153|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In428191153, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In428191153, ~z$w_buff1_used~0=~z$w_buff1_used~0_In428191153} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-11-28 18:03:51,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L851-->L851-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1528948208 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1528948208 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite62_Out1528948208| 0)) (and (= |ULTIMATE.start_main_#t~ite62_Out1528948208| ~z$r_buff0_thd0~0_In1528948208) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1528948208, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1528948208} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1528948208|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1528948208, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1528948208} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-11-28 18:03:51,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L852-->L852-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd0~0_In-2001192419 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-2001192419 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-2001192419 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-2001192419 256) 0))) (or (and (= ~z$r_buff1_thd0~0_In-2001192419 |ULTIMATE.start_main_#t~ite63_Out-2001192419|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite63_Out-2001192419|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2001192419, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2001192419, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2001192419, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2001192419} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-2001192419|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2001192419, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2001192419, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2001192419, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2001192419} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-11-28 18:03:51,373 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1022] [1022] L852-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z$r_buff1_thd0~0_249 |v_ULTIMATE.start_main_#t~ite63_36|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= (mod v_~main$tmp_guard1~0_21 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~main$tmp_guard1~0_21 (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_31) (= v_~x~0_50 2) (= v_~__unbuffered_p1_EBX~0_20 0) (= v_~__unbuffered_p2_EBX~0_21 0) (= 1 v_~__unbuffered_p1_EAX~0_44))) 1 0)) 0 1))) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_36|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~x~0=v_~x~0_50} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_35|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_249, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~x~0=v_~x~0_50, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:03:51,486 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:03:51,486 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:03:51,488 INFO L168 Benchmark]: Toolchain (without parser) took 29917.58 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 961.7 MB in the beginning and 1.5 GB in the end (delta: -530.9 MB). Peak memory consumption was 790.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:03:51,489 INFO L168 Benchmark]: CDTParser took 0.85 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:03:51,489 INFO L168 Benchmark]: CACSL2BoogieTranslator took 850.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -145.3 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-28 18:03:51,490 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.03 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:03:51,490 INFO L168 Benchmark]: Boogie Preprocessor took 43.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:03:51,491 INFO L168 Benchmark]: RCFGBuilder took 1003.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.6 MB). Peak memory consumption was 58.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:03:51,491 INFO L168 Benchmark]: TraceAbstraction took 27775.28 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -481.0 MB). Peak memory consumption was 706.5 MB. Max. memory is 11.5 GB. [2019-11-28 18:03:51,492 INFO L168 Benchmark]: Witness Printer took 147.48 ms. Allocated memory is still 2.4 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:03:51,495 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.85 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 850.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -145.3 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 88.03 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.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 1003.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.6 MB). Peak memory consumption was 58.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27775.28 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -481.0 MB). Peak memory consumption was 706.5 MB. Max. memory is 11.5 GB. * Witness Printer took 147.48 ms. Allocated memory is still 2.4 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.8s, 196 ProgramPointsBefore, 103 ProgramPointsAfterwards, 242 TransitionsBefore, 122 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 31 ChoiceCompositions, 9041 VarBasedMoverChecksPositive, 312 VarBasedMoverChecksNegative, 82 SemBasedMoverChecksPositive, 320 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.2s, 0 MoverChecksTotal, 115591 CheckedPairsTotal, 128 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L838] FCALL, FORK 0 pthread_create(&t284, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] FCALL, FORK 0 pthread_create(&t285, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] FCALL, FORK 0 pthread_create(&t286, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L790] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L791] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L792] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L793] 3 z$r_buff0_thd3 = (_Bool)1 [L796] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L797] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L798] 3 z$flush_delayed = weak$$choice2 [L799] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L801] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L802] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L803] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L804] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L804] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L806] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 3 z = z$flush_delayed ? z$mem_tmp : z [L809] 3 z$flush_delayed = (_Bool)0 [L812] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 2 x = 2 [L753] 2 y = 1 [L756] 2 __unbuffered_p1_EAX = y [L759] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 2 z$flush_delayed = weak$$choice2 [L762] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L763] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L763] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L764] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L765] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L766] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L767] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L769] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L816] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L817] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L851] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 187 locations, 2 error locations. Result: UNSAFE, OverallTime: 27.4s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3327 SDtfs, 5477 SDslu, 7551 SDs, 0 SdLazy, 1974 SolverSat, 185 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39870occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 21384 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 739 NumberOfCodeBlocks, 739 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 660 ConstructedInterpolants, 0 QuantifiedInterpolants, 255196 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...