./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix015_tso.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/mix015_tso.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 2d6b2e8069af4598b0b4e83ccd284d21f82e991c .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:05:04,172 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:05:04,175 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:05:04,188 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:05:04,188 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:05:04,190 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:05:04,191 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:05:04,193 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:05:04,195 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:05:04,196 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:05:04,197 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:05:04,199 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:05:04,199 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:05:04,200 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:05:04,201 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:05:04,203 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:05:04,204 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:05:04,205 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:05:04,207 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:05:04,209 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:05:04,211 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:05:04,213 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:05:04,214 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:05:04,215 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:05:04,217 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:05:04,218 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:05:04,218 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:05:04,219 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:05:04,220 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:05:04,221 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:05:04,221 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:05:04,222 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:05:04,223 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:05:04,224 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:05:04,225 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:05:04,225 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:05:04,226 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:05:04,226 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:05:04,227 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:05:04,228 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:05:04,228 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:05:04,229 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:05:04,249 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:05:04,249 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:05:04,251 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:05:04,251 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:05:04,252 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:05:04,252 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:05:04,252 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:05:04,253 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:05:04,253 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:05:04,253 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:05:04,254 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:05:04,255 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:05:04,255 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:05:04,255 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:05:04,256 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:05:04,256 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:05:04,256 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:05:04,257 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:05:04,257 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:05:04,257 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:05:04,258 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:05:04,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:05:04,258 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:05:04,259 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:05:04,259 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:05:04,259 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:05:04,259 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:05:04,260 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:05:04,260 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:05:04,260 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 -> 2d6b2e8069af4598b0b4e83ccd284d21f82e991c [2019-11-28 18:05:04,579 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:05:04,593 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:05:04,597 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:05:04,598 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:05:04,599 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:05:04,600 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix015_tso.opt.i [2019-11-28 18:05:04,662 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/473603d51/02d1afdf43274682a03e9e437da8662c/FLAG4352928a9 [2019-11-28 18:05:05,238 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:05:05,239 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix015_tso.opt.i [2019-11-28 18:05:05,259 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/473603d51/02d1afdf43274682a03e9e437da8662c/FLAG4352928a9 [2019-11-28 18:05:05,525 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/473603d51/02d1afdf43274682a03e9e437da8662c [2019-11-28 18:05:05,528 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:05:05,530 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:05:05,531 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:05:05,531 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:05:05,535 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:05:05,536 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:05:05" (1/1) ... [2019-11-28 18:05:05,539 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c1dbb8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:05:05, skipping insertion in model container [2019-11-28 18:05:05,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:05:05" (1/1) ... [2019-11-28 18:05:05,547 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:05:05,608 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:05:06,117 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:05:06,132 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:05:06,209 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:05:06,303 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:05:06,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:05:06 WrapperNode [2019-11-28 18:05:06,305 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:05:06,306 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:05:06,306 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:05:06,306 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:05:06,315 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:05:06" (1/1) ... [2019-11-28 18:05:06,347 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:05:06" (1/1) ... [2019-11-28 18:05:06,385 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:05:06,385 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:05:06,385 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:05:06,386 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:05:06,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:05:06" (1/1) ... [2019-11-28 18:05:06,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:05:06" (1/1) ... [2019-11-28 18:05:06,405 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:05:06" (1/1) ... [2019-11-28 18:05:06,405 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:05:06" (1/1) ... [2019-11-28 18:05:06,417 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:05:06" (1/1) ... [2019-11-28 18:05:06,422 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:05:06" (1/1) ... [2019-11-28 18:05:06,427 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:05:06" (1/1) ... [2019-11-28 18:05:06,433 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:05:06,434 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:05:06,434 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:05:06,435 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:05:06,436 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:05:06" (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:05:06,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:05:06,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:05:06,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:05:06,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:05:06,508 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:05:06,508 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:05:06,508 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:05:06,509 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:05:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-11-28 18:05:06,509 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-11-28 18:05:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:05:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:05:06,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:05:06,512 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:05:07,304 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:05:07,305 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:05:07,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:05:07 BoogieIcfgContainer [2019-11-28 18:05:07,306 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:05:07,308 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:05:07,308 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:05:07,313 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:05:07,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:05:05" (1/3) ... [2019-11-28 18:05:07,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a82dac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:05:07, skipping insertion in model container [2019-11-28 18:05:07,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:05:06" (2/3) ... [2019-11-28 18:05:07,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a82dac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:05:07, skipping insertion in model container [2019-11-28 18:05:07,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:05:07" (3/3) ... [2019-11-28 18:05:07,318 INFO L109 eAbstractionObserver]: Analyzing ICFG mix015_tso.opt.i [2019-11-28 18:05:07,328 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:05:07,329 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:05:07,340 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:05:07,343 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:05:07,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,416 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,417 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,421 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,422 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,462 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,463 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,463 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,463 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,464 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:05:07,523 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-28 18:05:07,544 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:05:07,544 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:05:07,544 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:05:07,545 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:05:07,545 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:05:07,545 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:05:07,545 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:05:07,545 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:05:07,562 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 243 transitions [2019-11-28 18:05:07,564 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-11-28 18:05:07,692 INFO L134 PetriNetUnfolder]: 56/240 cut-off events. [2019-11-28 18:05:07,693 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:05:07,721 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 922 event pairs. 9/191 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-11-28 18:05:07,764 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-11-28 18:05:07,841 INFO L134 PetriNetUnfolder]: 56/240 cut-off events. [2019-11-28 18:05:07,842 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:05:07,866 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 922 event pairs. 9/191 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-11-28 18:05:07,902 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-11-28 18:05:07,904 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:05:13,420 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-28 18:05:13,758 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-11-28 18:05:14,244 WARN L192 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-11-28 18:05:14,375 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-11-28 18:05:14,422 INFO L206 etLargeBlockEncoding]: Checked pairs total: 124397 [2019-11-28 18:05:14,423 INFO L214 etLargeBlockEncoding]: Total number of compositions: 127 [2019-11-28 18:05:14,427 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 108 places, 130 transitions [2019-11-28 18:05:19,033 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44886 states. [2019-11-28 18:05:19,035 INFO L276 IsEmpty]: Start isEmpty. Operand 44886 states. [2019-11-28 18:05:19,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 18:05:19,043 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:05:19,044 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:05:19,044 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:05:19,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:05:19,049 INFO L82 PathProgramCache]: Analyzing trace with hash -615654133, now seen corresponding path program 1 times [2019-11-28 18:05:19,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:05:19,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342273498] [2019-11-28 18:05:19,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:05:19,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:05:19,350 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:05:19,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342273498] [2019-11-28 18:05:19,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:05:19,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:05:19,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640980257] [2019-11-28 18:05:19,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:05:19,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:05:19,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:05:19,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:05:19,381 INFO L87 Difference]: Start difference. First operand 44886 states. Second operand 3 states. [2019-11-28 18:05:20,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:05:20,246 INFO L93 Difference]: Finished difference Result 44562 states and 182514 transitions. [2019-11-28 18:05:20,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:05:20,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-28 18:05:20,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:05:21,028 INFO L225 Difference]: With dead ends: 44562 [2019-11-28 18:05:21,030 INFO L226 Difference]: Without dead ends: 41502 [2019-11-28 18:05:21,032 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:05:21,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41502 states. [2019-11-28 18:05:23,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41502 to 41502. [2019-11-28 18:05:23,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41502 states. [2019-11-28 18:05:23,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41502 states to 41502 states and 169862 transitions. [2019-11-28 18:05:23,713 INFO L78 Accepts]: Start accepts. Automaton has 41502 states and 169862 transitions. Word has length 7 [2019-11-28 18:05:23,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:05:23,715 INFO L462 AbstractCegarLoop]: Abstraction has 41502 states and 169862 transitions. [2019-11-28 18:05:23,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:05:23,715 INFO L276 IsEmpty]: Start isEmpty. Operand 41502 states and 169862 transitions. [2019-11-28 18:05:23,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 18:05:23,721 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:05:23,722 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:05:23,722 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:05:23,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:05:23,723 INFO L82 PathProgramCache]: Analyzing trace with hash -42181455, now seen corresponding path program 1 times [2019-11-28 18:05:23,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:05:23,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599288813] [2019-11-28 18:05:23,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:05:23,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:05:23,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:05:23,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599288813] [2019-11-28 18:05:23,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:05:23,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:05:23,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200958518] [2019-11-28 18:05:23,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:05:23,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:05:23,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:05:23,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:05:23,891 INFO L87 Difference]: Start difference. First operand 41502 states and 169862 transitions. Second operand 4 states. [2019-11-28 18:05:24,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:05:24,262 INFO L93 Difference]: Finished difference Result 26491 states and 94929 transitions. [2019-11-28 18:05:24,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:05:24,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-28 18:05:24,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:05:24,391 INFO L225 Difference]: With dead ends: 26491 [2019-11-28 18:05:24,392 INFO L226 Difference]: Without dead ends: 23431 [2019-11-28 18:05:24,393 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:05:24,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23431 states. [2019-11-28 18:05:25,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23431 to 23431. [2019-11-28 18:05:25,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23431 states. [2019-11-28 18:05:25,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23431 states to 23431 states and 83897 transitions. [2019-11-28 18:05:25,311 INFO L78 Accepts]: Start accepts. Automaton has 23431 states and 83897 transitions. Word has length 13 [2019-11-28 18:05:25,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:05:25,312 INFO L462 AbstractCegarLoop]: Abstraction has 23431 states and 83897 transitions. [2019-11-28 18:05:25,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:05:25,313 INFO L276 IsEmpty]: Start isEmpty. Operand 23431 states and 83897 transitions. [2019-11-28 18:05:25,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:05:25,320 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:05:25,321 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:05:25,321 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:05:25,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:05:25,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1080804847, now seen corresponding path program 1 times [2019-11-28 18:05:25,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:05:25,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671721919] [2019-11-28 18:05:25,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:05:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:05:25,505 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:05:25,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671721919] [2019-11-28 18:05:25,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:05:25,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:05:25,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37861637] [2019-11-28 18:05:25,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:05:25,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:05:25,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:05:25,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:05:25,510 INFO L87 Difference]: Start difference. First operand 23431 states and 83897 transitions. Second operand 5 states. [2019-11-28 18:05:25,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:05:25,627 INFO L93 Difference]: Finished difference Result 5977 states and 18478 transitions. [2019-11-28 18:05:25,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:05:25,628 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-28 18:05:25,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:05:25,640 INFO L225 Difference]: With dead ends: 5977 [2019-11-28 18:05:25,641 INFO L226 Difference]: Without dead ends: 4369 [2019-11-28 18:05:25,642 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:05:25,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4369 states. [2019-11-28 18:05:25,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4369 to 4324. [2019-11-28 18:05:25,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4324 states. [2019-11-28 18:05:25,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4324 states to 4324 states and 12670 transitions. [2019-11-28 18:05:25,768 INFO L78 Accepts]: Start accepts. Automaton has 4324 states and 12670 transitions. Word has length 14 [2019-11-28 18:05:25,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:05:25,769 INFO L462 AbstractCegarLoop]: Abstraction has 4324 states and 12670 transitions. [2019-11-28 18:05:25,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:05:25,770 INFO L276 IsEmpty]: Start isEmpty. Operand 4324 states and 12670 transitions. [2019-11-28 18:05:25,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:05:25,776 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:05:25,776 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:05:25,776 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:05:25,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:05:25,777 INFO L82 PathProgramCache]: Analyzing trace with hash -902377345, now seen corresponding path program 1 times [2019-11-28 18:05:25,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:05:25,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927682201] [2019-11-28 18:05:25,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:05:25,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:05:25,908 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:05:25,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927682201] [2019-11-28 18:05:25,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:05:25,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:05:25,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481975509] [2019-11-28 18:05:25,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:05:25,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:05:25,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:05:25,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:05:25,911 INFO L87 Difference]: Start difference. First operand 4324 states and 12670 transitions. Second operand 4 states. [2019-11-28 18:05:26,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:05:26,275 INFO L93 Difference]: Finished difference Result 5896 states and 16778 transitions. [2019-11-28 18:05:26,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:05:26,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-28 18:05:26,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:05:26,289 INFO L225 Difference]: With dead ends: 5896 [2019-11-28 18:05:26,290 INFO L226 Difference]: Without dead ends: 5844 [2019-11-28 18:05:26,290 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:05:26,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5844 states. [2019-11-28 18:05:26,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5844 to 5748. [2019-11-28 18:05:26,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5748 states. [2019-11-28 18:05:26,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5748 states to 5748 states and 16462 transitions. [2019-11-28 18:05:26,466 INFO L78 Accepts]: Start accepts. Automaton has 5748 states and 16462 transitions. Word has length 16 [2019-11-28 18:05:26,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:05:26,467 INFO L462 AbstractCegarLoop]: Abstraction has 5748 states and 16462 transitions. [2019-11-28 18:05:26,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:05:26,468 INFO L276 IsEmpty]: Start isEmpty. Operand 5748 states and 16462 transitions. [2019-11-28 18:05:26,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 18:05:26,481 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:05:26,481 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:05:26,482 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:05:26,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:05:26,483 INFO L82 PathProgramCache]: Analyzing trace with hash 788566727, now seen corresponding path program 1 times [2019-11-28 18:05:26,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:05:26,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338068905] [2019-11-28 18:05:26,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:05:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:05:26,587 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:05:26,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338068905] [2019-11-28 18:05:26,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:05:26,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:05:26,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602341438] [2019-11-28 18:05:26,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:05:26,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:05:26,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:05:26,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:05:26,590 INFO L87 Difference]: Start difference. First operand 5748 states and 16462 transitions. Second operand 6 states. [2019-11-28 18:05:26,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:05:26,889 INFO L93 Difference]: Finished difference Result 4634 states and 13762 transitions. [2019-11-28 18:05:26,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:05:26,890 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-11-28 18:05:26,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:05:26,899 INFO L225 Difference]: With dead ends: 4634 [2019-11-28 18:05:26,899 INFO L226 Difference]: Without dead ends: 4495 [2019-11-28 18:05:26,900 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:05:26,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4495 states. [2019-11-28 18:05:26,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4495 to 4439. [2019-11-28 18:05:26,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4439 states. [2019-11-28 18:05:26,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4439 states to 4439 states and 13327 transitions. [2019-11-28 18:05:26,981 INFO L78 Accepts]: Start accepts. Automaton has 4439 states and 13327 transitions. Word has length 31 [2019-11-28 18:05:26,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:05:26,982 INFO L462 AbstractCegarLoop]: Abstraction has 4439 states and 13327 transitions. [2019-11-28 18:05:26,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:05:26,982 INFO L276 IsEmpty]: Start isEmpty. Operand 4439 states and 13327 transitions. [2019-11-28 18:05:26,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-28 18:05:26,995 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:05:26,995 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:05:26,996 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:05:26,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:05:26,996 INFO L82 PathProgramCache]: Analyzing trace with hash 97552975, now seen corresponding path program 1 times [2019-11-28 18:05:26,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:05:26,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635293123] [2019-11-28 18:05:26,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:05:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:05:27,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:05:27,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635293123] [2019-11-28 18:05:27,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:05:27,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:05:27,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137893706] [2019-11-28 18:05:27,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:05:27,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:05:27,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:05:27,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:05:27,138 INFO L87 Difference]: Start difference. First operand 4439 states and 13327 transitions. Second operand 6 states. [2019-11-28 18:05:27,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:05:27,825 INFO L93 Difference]: Finished difference Result 5198 states and 15270 transitions. [2019-11-28 18:05:27,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:05:27,825 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-11-28 18:05:27,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:05:27,834 INFO L225 Difference]: With dead ends: 5198 [2019-11-28 18:05:27,835 INFO L226 Difference]: Without dead ends: 5198 [2019-11-28 18:05:27,835 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:05:27,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5198 states. [2019-11-28 18:05:27,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5198 to 4891. [2019-11-28 18:05:27,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4891 states. [2019-11-28 18:05:27,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4891 states to 4891 states and 14527 transitions. [2019-11-28 18:05:27,931 INFO L78 Accepts]: Start accepts. Automaton has 4891 states and 14527 transitions. Word has length 61 [2019-11-28 18:05:27,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:05:27,931 INFO L462 AbstractCegarLoop]: Abstraction has 4891 states and 14527 transitions. [2019-11-28 18:05:27,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:05:27,931 INFO L276 IsEmpty]: Start isEmpty. Operand 4891 states and 14527 transitions. [2019-11-28 18:05:27,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-28 18:05:27,945 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:05:27,945 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:05:27,945 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:05:27,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:05:27,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1532974713, now seen corresponding path program 2 times [2019-11-28 18:05:27,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:05:27,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93021907] [2019-11-28 18:05:27,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:05:27,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:05:28,104 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:05:28,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93021907] [2019-11-28 18:05:28,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:05:28,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:05:28,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887216206] [2019-11-28 18:05:28,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:05:28,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:05:28,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:05:28,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:05:28,106 INFO L87 Difference]: Start difference. First operand 4891 states and 14527 transitions. Second operand 7 states. [2019-11-28 18:05:28,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:05:28,623 INFO L93 Difference]: Finished difference Result 10663 states and 31071 transitions. [2019-11-28 18:05:28,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 18:05:28,623 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2019-11-28 18:05:28,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:05:28,639 INFO L225 Difference]: With dead ends: 10663 [2019-11-28 18:05:28,639 INFO L226 Difference]: Without dead ends: 9958 [2019-11-28 18:05:28,640 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-11-28 18:05:28,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9958 states. [2019-11-28 18:05:28,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9958 to 7457. [2019-11-28 18:05:28,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7457 states. [2019-11-28 18:05:28,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7457 states to 7457 states and 22508 transitions. [2019-11-28 18:05:28,797 INFO L78 Accepts]: Start accepts. Automaton has 7457 states and 22508 transitions. Word has length 61 [2019-11-28 18:05:28,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:05:28,797 INFO L462 AbstractCegarLoop]: Abstraction has 7457 states and 22508 transitions. [2019-11-28 18:05:28,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:05:28,797 INFO L276 IsEmpty]: Start isEmpty. Operand 7457 states and 22508 transitions. [2019-11-28 18:05:28,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-28 18:05:28,816 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:05:28,817 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:05:28,817 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:05:28,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:05:28,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1471715017, now seen corresponding path program 3 times [2019-11-28 18:05:28,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:05:28,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111355149] [2019-11-28 18:05:28,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:05:28,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:05:29,050 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:05:29,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111355149] [2019-11-28 18:05:29,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:05:29,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 18:05:29,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459101857] [2019-11-28 18:05:29,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 18:05:29,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:05:29,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 18:05:29,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-28 18:05:29,055 INFO L87 Difference]: Start difference. First operand 7457 states and 22508 transitions. Second operand 10 states. [2019-11-28 18:05:30,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:05:30,373 INFO L93 Difference]: Finished difference Result 14127 states and 41621 transitions. [2019-11-28 18:05:30,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 18:05:30,374 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 61 [2019-11-28 18:05:30,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:05:30,396 INFO L225 Difference]: With dead ends: 14127 [2019-11-28 18:05:30,396 INFO L226 Difference]: Without dead ends: 14127 [2019-11-28 18:05:30,397 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-11-28 18:05:30,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14127 states. [2019-11-28 18:05:30,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14127 to 10845. [2019-11-28 18:05:30,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10845 states. [2019-11-28 18:05:30,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10845 states to 10845 states and 32634 transitions. [2019-11-28 18:05:30,622 INFO L78 Accepts]: Start accepts. Automaton has 10845 states and 32634 transitions. Word has length 61 [2019-11-28 18:05:30,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:05:30,622 INFO L462 AbstractCegarLoop]: Abstraction has 10845 states and 32634 transitions. [2019-11-28 18:05:30,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 18:05:30,623 INFO L276 IsEmpty]: Start isEmpty. Operand 10845 states and 32634 transitions. [2019-11-28 18:05:30,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-28 18:05:30,646 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:05:30,646 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:05:30,647 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:05:30,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:05:30,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1237090409, now seen corresponding path program 1 times [2019-11-28 18:05:30,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:05:30,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460761827] [2019-11-28 18:05:30,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:05:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:05:30,725 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:05:30,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460761827] [2019-11-28 18:05:30,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:05:30,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:05:30,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150508581] [2019-11-28 18:05:30,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:05:30,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:05:30,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:05:30,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:05:30,728 INFO L87 Difference]: Start difference. First operand 10845 states and 32634 transitions. Second operand 3 states. [2019-11-28 18:05:30,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:05:30,787 INFO L93 Difference]: Finished difference Result 10845 states and 32633 transitions. [2019-11-28 18:05:30,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:05:30,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-11-28 18:05:30,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:05:30,812 INFO L225 Difference]: With dead ends: 10845 [2019-11-28 18:05:30,812 INFO L226 Difference]: Without dead ends: 10845 [2019-11-28 18:05:30,813 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:05:30,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10845 states. [2019-11-28 18:05:31,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10845 to 10654. [2019-11-28 18:05:31,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10654 states. [2019-11-28 18:05:31,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10654 states to 10654 states and 32194 transitions. [2019-11-28 18:05:31,319 INFO L78 Accepts]: Start accepts. Automaton has 10654 states and 32194 transitions. Word has length 62 [2019-11-28 18:05:31,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:05:31,320 INFO L462 AbstractCegarLoop]: Abstraction has 10654 states and 32194 transitions. [2019-11-28 18:05:31,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:05:31,320 INFO L276 IsEmpty]: Start isEmpty. Operand 10654 states and 32194 transitions. [2019-11-28 18:05:31,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-28 18:05:31,341 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:05:31,341 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:05:31,341 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:05:31,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:05:31,342 INFO L82 PathProgramCache]: Analyzing trace with hash 2114044473, now seen corresponding path program 1 times [2019-11-28 18:05:31,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:05:31,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941393965] [2019-11-28 18:05:31,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:05:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:05:31,688 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:05:31,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941393965] [2019-11-28 18:05:31,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:05:31,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 18:05:31,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063014602] [2019-11-28 18:05:31,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 18:05:31,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:05:31,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 18:05:31,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-11-28 18:05:31,691 INFO L87 Difference]: Start difference. First operand 10654 states and 32194 transitions. Second operand 13 states. [2019-11-28 18:05:33,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:05:33,043 INFO L93 Difference]: Finished difference Result 21793 states and 61253 transitions. [2019-11-28 18:05:33,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-28 18:05:33,043 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2019-11-28 18:05:33,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:05:33,071 INFO L225 Difference]: With dead ends: 21793 [2019-11-28 18:05:33,071 INFO L226 Difference]: Without dead ends: 18319 [2019-11-28 18:05:33,072 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2019-11-28 18:05:33,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18319 states. [2019-11-28 18:05:33,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18319 to 11538. [2019-11-28 18:05:33,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11538 states. [2019-11-28 18:05:33,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11538 states to 11538 states and 34352 transitions. [2019-11-28 18:05:33,294 INFO L78 Accepts]: Start accepts. Automaton has 11538 states and 34352 transitions. Word has length 62 [2019-11-28 18:05:33,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:05:33,295 INFO L462 AbstractCegarLoop]: Abstraction has 11538 states and 34352 transitions. [2019-11-28 18:05:33,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 18:05:33,295 INFO L276 IsEmpty]: Start isEmpty. Operand 11538 states and 34352 transitions. [2019-11-28 18:05:33,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-28 18:05:33,315 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:05:33,315 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:05:33,315 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:05:33,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:05:33,315 INFO L82 PathProgramCache]: Analyzing trace with hash 200439113, now seen corresponding path program 2 times [2019-11-28 18:05:33,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:05:33,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633948678] [2019-11-28 18:05:33,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:05:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:05:33,451 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:05:33,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633948678] [2019-11-28 18:05:33,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:05:33,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:05:33,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132003629] [2019-11-28 18:05:33,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:05:33,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:05:33,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:05:33,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:05:33,454 INFO L87 Difference]: Start difference. First operand 11538 states and 34352 transitions. Second operand 5 states. [2019-11-28 18:05:33,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:05:33,576 INFO L93 Difference]: Finished difference Result 16524 states and 47052 transitions. [2019-11-28 18:05:33,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:05:33,577 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-11-28 18:05:33,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:05:33,585 INFO L225 Difference]: With dead ends: 16524 [2019-11-28 18:05:33,585 INFO L226 Difference]: Without dead ends: 5265 [2019-11-28 18:05:33,586 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:05:33,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5265 states. [2019-11-28 18:05:33,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5265 to 5265. [2019-11-28 18:05:33,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5265 states. [2019-11-28 18:05:33,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5265 states to 5265 states and 13314 transitions. [2019-11-28 18:05:33,645 INFO L78 Accepts]: Start accepts. Automaton has 5265 states and 13314 transitions. Word has length 62 [2019-11-28 18:05:33,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:05:33,645 INFO L462 AbstractCegarLoop]: Abstraction has 5265 states and 13314 transitions. [2019-11-28 18:05:33,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:05:33,646 INFO L276 IsEmpty]: Start isEmpty. Operand 5265 states and 13314 transitions. [2019-11-28 18:05:33,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-28 18:05:33,653 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:05:33,653 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:05:33,653 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:05:33,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:05:33,654 INFO L82 PathProgramCache]: Analyzing trace with hash 711270615, now seen corresponding path program 3 times [2019-11-28 18:05:33,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:05:33,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258564703] [2019-11-28 18:05:33,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:05:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:05:33,763 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:05:33,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258564703] [2019-11-28 18:05:33,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:05:33,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:05:33,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077747521] [2019-11-28 18:05:33,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:05:33,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:05:33,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:05:33,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:05:33,766 INFO L87 Difference]: Start difference. First operand 5265 states and 13314 transitions. Second operand 6 states. [2019-11-28 18:05:34,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:05:34,301 INFO L93 Difference]: Finished difference Result 7140 states and 17952 transitions. [2019-11-28 18:05:34,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 18:05:34,302 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-11-28 18:05:34,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:05:34,313 INFO L225 Difference]: With dead ends: 7140 [2019-11-28 18:05:34,313 INFO L226 Difference]: Without dead ends: 7140 [2019-11-28 18:05:34,313 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:05:34,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7140 states. [2019-11-28 18:05:34,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7140 to 5647. [2019-11-28 18:05:34,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5647 states. [2019-11-28 18:05:34,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5647 states to 5647 states and 14290 transitions. [2019-11-28 18:05:34,392 INFO L78 Accepts]: Start accepts. Automaton has 5647 states and 14290 transitions. Word has length 62 [2019-11-28 18:05:34,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:05:34,393 INFO L462 AbstractCegarLoop]: Abstraction has 5647 states and 14290 transitions. [2019-11-28 18:05:34,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:05:34,393 INFO L276 IsEmpty]: Start isEmpty. Operand 5647 states and 14290 transitions. [2019-11-28 18:05:34,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-28 18:05:34,402 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:05:34,402 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:05:34,402 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:05:34,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:05:34,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1202334745, now seen corresponding path program 4 times [2019-11-28 18:05:34,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:05:34,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303965008] [2019-11-28 18:05:34,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:05:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:05:34,496 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:05:34,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303965008] [2019-11-28 18:05:34,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:05:34,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:05:34,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972044948] [2019-11-28 18:05:34,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:05:34,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:05:34,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:05:34,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:05:34,499 INFO L87 Difference]: Start difference. First operand 5647 states and 14290 transitions. Second operand 4 states. [2019-11-28 18:05:34,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:05:34,560 INFO L93 Difference]: Finished difference Result 6434 states and 16082 transitions. [2019-11-28 18:05:34,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:05:34,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-28 18:05:34,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:05:34,571 INFO L225 Difference]: With dead ends: 6434 [2019-11-28 18:05:34,572 INFO L226 Difference]: Without dead ends: 6045 [2019-11-28 18:05:34,573 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:05:34,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6045 states. [2019-11-28 18:05:34,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6045 to 5308. [2019-11-28 18:05:34,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5308 states. [2019-11-28 18:05:34,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5308 states to 5308 states and 13302 transitions. [2019-11-28 18:05:34,677 INFO L78 Accepts]: Start accepts. Automaton has 5308 states and 13302 transitions. Word has length 62 [2019-11-28 18:05:34,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:05:34,677 INFO L462 AbstractCegarLoop]: Abstraction has 5308 states and 13302 transitions. [2019-11-28 18:05:34,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:05:34,678 INFO L276 IsEmpty]: Start isEmpty. Operand 5308 states and 13302 transitions. [2019-11-28 18:05:34,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-28 18:05:34,686 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:05:34,687 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:05:34,687 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:05:34,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:05:34,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1951374103, now seen corresponding path program 5 times [2019-11-28 18:05:34,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:05:34,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278895961] [2019-11-28 18:05:34,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:05:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:05:35,093 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:05:35,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278895961] [2019-11-28 18:05:35,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:05:35,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 18:05:35,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106535540] [2019-11-28 18:05:35,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 18:05:35,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:05:35,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 18:05:35,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-28 18:05:35,096 INFO L87 Difference]: Start difference. First operand 5308 states and 13302 transitions. Second operand 13 states. [2019-11-28 18:05:36,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:05:36,437 INFO L93 Difference]: Finished difference Result 10088 states and 25387 transitions. [2019-11-28 18:05:36,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 18:05:36,438 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2019-11-28 18:05:36,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:05:36,452 INFO L225 Difference]: With dead ends: 10088 [2019-11-28 18:05:36,452 INFO L226 Difference]: Without dead ends: 9790 [2019-11-28 18:05:36,453 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2019-11-28 18:05:36,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9790 states. [2019-11-28 18:05:36,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9790 to 6140. [2019-11-28 18:05:36,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6140 states. [2019-11-28 18:05:36,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6140 states to 6140 states and 15471 transitions. [2019-11-28 18:05:36,569 INFO L78 Accepts]: Start accepts. Automaton has 6140 states and 15471 transitions. Word has length 62 [2019-11-28 18:05:36,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:05:36,570 INFO L462 AbstractCegarLoop]: Abstraction has 6140 states and 15471 transitions. [2019-11-28 18:05:36,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 18:05:36,570 INFO L276 IsEmpty]: Start isEmpty. Operand 6140 states and 15471 transitions. [2019-11-28 18:05:36,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-28 18:05:36,578 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:05:36,578 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:05:36,579 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:05:36,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:05:36,579 INFO L82 PathProgramCache]: Analyzing trace with hash 545668213, now seen corresponding path program 1 times [2019-11-28 18:05:36,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:05:36,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011648637] [2019-11-28 18:05:36,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:05:36,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:05:36,850 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:05:36,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011648637] [2019-11-28 18:05:36,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:05:36,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:05:36,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743906491] [2019-11-28 18:05:36,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:05:36,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:05:36,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:05:36,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:05:36,852 INFO L87 Difference]: Start difference. First operand 6140 states and 15471 transitions. Second operand 5 states. [2019-11-28 18:05:36,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:05:36,917 INFO L93 Difference]: Finished difference Result 6924 states and 17258 transitions. [2019-11-28 18:05:36,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:05:36,918 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-11-28 18:05:36,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:05:36,920 INFO L225 Difference]: With dead ends: 6924 [2019-11-28 18:05:36,921 INFO L226 Difference]: Without dead ends: 916 [2019-11-28 18:05:36,921 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:05:36,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2019-11-28 18:05:36,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 916. [2019-11-28 18:05:36,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-11-28 18:05:36,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1977 transitions. [2019-11-28 18:05:36,943 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1977 transitions. Word has length 63 [2019-11-28 18:05:36,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:05:36,943 INFO L462 AbstractCegarLoop]: Abstraction has 916 states and 1977 transitions. [2019-11-28 18:05:36,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:05:36,944 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1977 transitions. [2019-11-28 18:05:36,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-28 18:05:36,946 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:05:36,946 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:05:36,947 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:05:36,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:05:36,947 INFO L82 PathProgramCache]: Analyzing trace with hash -692797329, now seen corresponding path program 2 times [2019-11-28 18:05:36,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:05:36,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900934491] [2019-11-28 18:05:36,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:05:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:05:37,117 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:05:37,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900934491] [2019-11-28 18:05:37,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:05:37,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 18:05:37,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332134783] [2019-11-28 18:05:37,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 18:05:37,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:05:37,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 18:05:37,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 18:05:37,123 INFO L87 Difference]: Start difference. First operand 916 states and 1977 transitions. Second operand 8 states. [2019-11-28 18:05:37,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:05:37,375 INFO L93 Difference]: Finished difference Result 1505 states and 3208 transitions. [2019-11-28 18:05:37,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 18:05:37,376 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-11-28 18:05:37,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:05:37,378 INFO L225 Difference]: With dead ends: 1505 [2019-11-28 18:05:37,378 INFO L226 Difference]: Without dead ends: 1137 [2019-11-28 18:05:37,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-11-28 18:05:37,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2019-11-28 18:05:37,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 925. [2019-11-28 18:05:37,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 925 states. [2019-11-28 18:05:37,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1992 transitions. [2019-11-28 18:05:37,393 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1992 transitions. Word has length 63 [2019-11-28 18:05:37,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:05:37,394 INFO L462 AbstractCegarLoop]: Abstraction has 925 states and 1992 transitions. [2019-11-28 18:05:37,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 18:05:37,394 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1992 transitions. [2019-11-28 18:05:37,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-28 18:05:37,396 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:05:37,396 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:05:37,396 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:05:37,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:05:37,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1081093091, now seen corresponding path program 3 times [2019-11-28 18:05:37,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:05:37,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979715902] [2019-11-28 18:05:37,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:05:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:05:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:05:37,530 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:05:37,531 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:05:37,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_148| 0 0))) (and (= v_~z$r_buff0_thd1~0_163 0) (= v_~z$r_buff1_thd1~0_231 0) (= 0 v_~__unbuffered_p2_EAX~0_94) (= v_~weak$$choice2~0_336 0) (= v_~z$r_buff1_thd2~0_450 0) (= v_~main$tmp_guard0~0_29 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t406~0.base_114|) (= v_~z$w_buff0~0_389 0) (= v_~main$tmp_guard1~0_78 0) (= v_~y~0_48 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t406~0.base_114| 4) |v_#length_25|) (< 0 |v_#StackHeapBarrier_17|) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~__unbuffered_p0_EBX~0_85 0) (= v_~z$w_buff1~0_275 0) (= 0 v_~z$r_buff0_thd3~0_641) (= 0 v_~__unbuffered_p1_EAX~0_94) (= v_~__unbuffered_cnt~0_142 0) (= v_~z$w_buff1_used~0_552 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t406~0.base_114| 1) |v_#valid_146|) (= v_~z$r_buff1_thd0~0_338 0) (= 0 v_~__unbuffered_p0_EAX~0_85) (= v_~z$r_buff0_thd0~0_222 0) (= 0 v_~weak$$choice0~0_260) (= |v_#NULL.offset_5| 0) (= v_~z~0_393 0) (= 0 v_~z$r_buff1_thd3~0_405) (= 0 |v_ULTIMATE.start_main_~#t406~0.offset_64|) (= v_~__unbuffered_p2_EBX~0_87 0) (= v_~z$r_buff0_thd2~0_459 0) (= v_~a~0_33 0) (= 0 v_~z$flush_delayed~0_341) (= 0 v_~z$mem_tmp~0_277) (= v_~x~0_19 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t406~0.base_114|) 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t406~0.base_114| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t406~0.base_114|) |v_ULTIMATE.start_main_~#t406~0.offset_64| 0))) (= 0 |v_#NULL.base_5|) (= v_~z$w_buff0_used~0_978 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_16|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ULTIMATE.start_main_~#t408~0.base=|v_ULTIMATE.start_main_~#t408~0.base_63|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_450, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t408~0.offset=|v_ULTIMATE.start_main_~#t408~0.offset_38|, ~a~0=v_~a~0_33, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_222, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_94, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_94, ~z$mem_tmp~0=v_~z$mem_tmp~0_277, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_87, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_85, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_57|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_552, ~z$flush_delayed~0=v_~z$flush_delayed~0_341, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_159|, ~weak$$choice0~0=v_~weak$$choice0~0_260, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_33|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_231, ~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_641, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_142, ULTIMATE.start_main_~#t407~0.offset=|v_ULTIMATE.start_main_~#t407~0.offset_38|, ~x~0=v_~x~0_19, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_10|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_275, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_78, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t406~0.offset=|v_ULTIMATE.start_main_~#t406~0.offset_64|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_338, ~y~0=v_~y~0_48, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_459, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_978, ~z$w_buff0~0=v_~z$w_buff0~0_389, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_405, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_88|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t407~0.base=|v_ULTIMATE.start_main_~#t407~0.base_87|, ULTIMATE.start_main_~#t406~0.base=|v_ULTIMATE.start_main_~#t406~0.base_114|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_29|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_371|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_63|, #valid=|v_#valid_146|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_393, ~weak$$choice2~0=v_~weak$$choice2~0_336, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_163} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t408~0.base, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t408~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~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_~#t407~0.offset, ~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_~#t406~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t407~0.base, ULTIMATE.start_main_~#t406~0.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:05:37,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L840-1-->L842: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t407~0.base_11|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t407~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t407~0.offset_10|) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t407~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t407~0.base_11|) |v_ULTIMATE.start_main_~#t407~0.offset_10| 1))) (not (= |v_ULTIMATE.start_main_~#t407~0.base_11| 0)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t407~0.base_11| 4) |v_#length_15|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t407~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t407~0.offset=|v_ULTIMATE.start_main_~#t407~0.offset_10|, ULTIMATE.start_main_~#t407~0.base=|v_ULTIMATE.start_main_~#t407~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t407~0.offset, ULTIMATE.start_main_~#t407~0.base] because there is no mapped edge [2019-11-28 18:05:37,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1005] [1005] L842-1-->L844: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t408~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t408~0.base_11|) |v_ULTIMATE.start_main_~#t408~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t408~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t408~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t408~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t408~0.offset_10|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t408~0.base_11| 4)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t408~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t408~0.base=|v_ULTIMATE.start_main_~#t408~0.base_11|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t408~0.offset=|v_ULTIMATE.start_main_~#t408~0.offset_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t408~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t408~0.offset, #length] because there is no mapped edge [2019-11-28 18:05:37,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] P2ENTRY-->L4-3: Formula: (and (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69)) (= v_~z$w_buff0_used~0_347 1) (= |v_P2Thread1of1ForFork0_#in~arg.offset_69| v_P2Thread1of1ForFork0_~arg.offset_67) (= (ite (not (and (not (= (mod v_~z$w_buff1_used~0_200 256) 0)) (not (= (mod v_~z$w_buff0_used~0_347 256) 0)))) 1 0) |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|) (= v_~z$w_buff0_used~0_348 v_~z$w_buff1_used~0_200) (= v_~z$w_buff0~0_158 v_~z$w_buff1~0_95) (= v_~z$w_buff0~0_157 1) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|) (= |v_P2Thread1of1ForFork0_#in~arg.base_69| v_P2Thread1of1ForFork0_~arg.base_67)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_69|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_348, ~z$w_buff0~0=v_~z$w_buff0~0_158, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_69|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_67, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_69|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_347, ~z$w_buff0~0=v_~z$w_buff0~0_157, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_67, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_200, ~z$w_buff1~0=v_~z$w_buff1~0_95, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_69|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69} 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:05:37,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [967] [967] L802-2-->L802-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1243349630 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1243349630 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out-1243349630| ~z$w_buff0~0_In-1243349630)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out-1243349630| ~z$w_buff1~0_In-1243349630)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1243349630, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1243349630, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1243349630, ~z$w_buff1~0=~z$w_buff1~0_In-1243349630} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-1243349630|, ~z$w_buff0~0=~z$w_buff0~0_In-1243349630, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1243349630, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1243349630, ~z$w_buff1~0=~z$w_buff1~0_In-1243349630} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-11-28 18:05:37,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L802-4-->L803: Formula: (= v_~z~0_26 |v_P2Thread1of1ForFork0_#t~ite28_6|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_6|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_5|, ~z~0=v_~z~0_26, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, ~z~0, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-11-28 18:05:37,545 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L807-->L808: Formula: (and (not (= (mod v_~weak$$choice2~0_43 256) 0)) (= v_~z$r_buff0_thd3~0_66 v_~z$r_buff0_thd3~0_65)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_43} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_5|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_65, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_5|, ~weak$$choice2~0=v_~weak$$choice2~0_43} 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:05:37,547 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-1752612072 256)))) (or (and (not .cse0) (= ~z$mem_tmp~0_In-1752612072 |P2Thread1of1ForFork0_#t~ite48_Out-1752612072|)) (and .cse0 (= ~z~0_In-1752612072 |P2Thread1of1ForFork0_#t~ite48_Out-1752612072|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1752612072, ~z$flush_delayed~0=~z$flush_delayed~0_In-1752612072, ~z~0=~z~0_In-1752612072} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-1752612072|, ~z$mem_tmp~0=~z$mem_tmp~0_In-1752612072, ~z$flush_delayed~0=~z$flush_delayed~0_In-1752612072, ~z~0=~z~0_In-1752612072} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-11-28 18:05:37,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_10 |v_P0Thread1of1ForFork1_#in~arg.offset_12|) (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= |v_P0Thread1of1ForFork1_#in~arg.base_12| v_P0Thread1of1ForFork1_~arg.base_10) (= v_~__unbuffered_p0_EBX~0_19 v_~y~0_40) (= v_~x~0_13 v_~__unbuffered_p0_EAX~0_19) (= v_~x~0_13 1) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|) (= v_~__unbuffered_cnt~0_119 (+ v_~__unbuffered_cnt~0_120 1)) (= v_~a~0_17 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_120, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_12|, ~y~0=v_~y~0_40} OutVars{~a~0=v_~a~0_17, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_19, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_19, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_12|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_10, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_12|, ~y~0=v_~y~0_40, ~x~0=v_~x~0_13, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_10} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~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:05:37,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-913355646 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-913355646 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out-913355646|)) (and (= ~z$w_buff0_used~0_In-913355646 |P2Thread1of1ForFork0_#t~ite51_Out-913355646|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-913355646, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-913355646} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-913355646, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-913355646, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out-913355646|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-11-28 18:05:37,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L819-->L819-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In296420117 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In296420117 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In296420117 256))) (.cse3 (= (mod ~z$r_buff0_thd3~0_In296420117 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite52_Out296420117| 0)) (and (= ~z$w_buff1_used~0_In296420117 |P2Thread1of1ForFork0_#t~ite52_Out296420117|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In296420117, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In296420117, ~z$w_buff1_used~0=~z$w_buff1_used~0_In296420117, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In296420117} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In296420117, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In296420117, ~z$w_buff1_used~0=~z$w_buff1_used~0_In296420117, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out296420117|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In296420117} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-11-28 18:05:37,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L820-->L821: Formula: (let ((.cse1 (= ~z$r_buff0_thd3~0_In780821749 ~z$r_buff0_thd3~0_Out780821749)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In780821749 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In780821749 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= ~z$r_buff0_thd3~0_Out780821749 0) (not .cse0) (not .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In780821749, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In780821749} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In780821749, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out780821749, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out780821749|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-11-28 18:05:37,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [963] [963] L821-->L821-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-1981013350 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-1981013350 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1981013350 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-1981013350 256) 0))) (or (and (= ~z$r_buff1_thd3~0_In-1981013350 |P2Thread1of1ForFork0_#t~ite54_Out-1981013350|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork0_#t~ite54_Out-1981013350|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1981013350, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1981013350, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1981013350, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1981013350} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1981013350, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out-1981013350|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1981013350, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1981013350, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1981013350} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-11-28 18:05:37,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L821-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0) (= v_~__unbuffered_cnt~0_90 (+ v_~__unbuffered_cnt~0_91 1)) (= v_~z$r_buff1_thd3~0_201 |v_P2Thread1of1ForFork0_#t~ite54_36|)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_35|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_201, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, 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:05:37,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In165287154 256)))) (or (and (= ~z~0_In165287154 |P1Thread1of1ForFork2_#t~ite25_Out165287154|) .cse0) (and (= ~z$mem_tmp~0_In165287154 |P1Thread1of1ForFork2_#t~ite25_Out165287154|) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In165287154, ~z$flush_delayed~0=~z$flush_delayed~0_In165287154, ~z~0=~z~0_In165287154} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In165287154, ~z$flush_delayed~0=~z$flush_delayed~0_In165287154, ~z~0=~z~0_In165287154, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out165287154|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-11-28 18:05:37,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~z~0_239 |v_P1Thread1of1ForFork2_#t~ite25_92|) (= 0 v_~z$flush_delayed~0_267) (= v_~__unbuffered_cnt~0_117 (+ v_~__unbuffered_cnt~0_118 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_118, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_92|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_117, ~z$flush_delayed~0=v_~z$flush_delayed~0_267, ~z~0=v_~z~0_239, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_91|} 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:05:37,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [897] [897] L848-->L850-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= (mod v_~z$r_buff0_thd0~0_30 256) 0) (= 0 (mod v_~z$w_buff0_used~0_165 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_30, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_165, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_30, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_165, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:05:37,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L850-2-->L850-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite59_Out1335989813| |ULTIMATE.start_main_#t~ite58_Out1335989813|)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1335989813 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1335989813 256)))) (or (and .cse0 (not .cse1) (= ~z$w_buff1~0_In1335989813 |ULTIMATE.start_main_#t~ite58_Out1335989813|) (not .cse2)) (and .cse0 (or .cse2 .cse1) (= ~z~0_In1335989813 |ULTIMATE.start_main_#t~ite58_Out1335989813|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1335989813, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1335989813, ~z$w_buff1~0=~z$w_buff1~0_In1335989813, ~z~0=~z~0_In1335989813} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1335989813, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out1335989813|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1335989813, ~z$w_buff1~0=~z$w_buff1~0_In1335989813, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1335989813|, ~z~0=~z~0_In1335989813} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-11-28 18:05:37,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L851-->L851-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1451352744 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1451352744 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1451352744 |ULTIMATE.start_main_#t~ite60_Out-1451352744|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite60_Out-1451352744|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1451352744, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1451352744} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1451352744|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1451352744, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1451352744} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-11-28 18:05:37,566 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L852-->L852-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-406844606 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-406844606 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-406844606 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-406844606 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite61_Out-406844606| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite61_Out-406844606| ~z$w_buff1_used~0_In-406844606)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-406844606, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-406844606, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-406844606, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-406844606} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-406844606, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-406844606|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-406844606, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-406844606, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-406844606} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-11-28 18:05:37,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L853-->L853-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1804249739 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1804249739 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite62_Out1804249739| 0)) (and (= |ULTIMATE.start_main_#t~ite62_Out1804249739| ~z$r_buff0_thd0~0_In1804249739) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1804249739, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1804249739} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1804249739|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1804249739, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1804249739} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-11-28 18:05:37,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L854-->L854-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd0~0_In-1412559978 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1412559978 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1412559978 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1412559978 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In-1412559978 |ULTIMATE.start_main_#t~ite63_Out-1412559978|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite63_Out-1412559978|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1412559978, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1412559978, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1412559978, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1412559978} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1412559978|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1412559978, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1412559978, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1412559978, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1412559978} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-11-28 18:05:37,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_22 256)) (= v_~z$r_buff1_thd0~0_254 |v_ULTIMATE.start_main_#t~ite63_47|) (= v_~main$tmp_guard1~0_22 (ite (= (ite (not (and (= v_~__unbuffered_p0_EBX~0_30 0) (= 1 v_~__unbuffered_p0_EAX~0_30) (= v_~__unbuffered_p2_EBX~0_26 0) (= 0 v_~__unbuffered_p1_EAX~0_29) (= 1 v_~__unbuffered_p2_EAX~0_22))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_47|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_46|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_254, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} 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:05:37,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:05:37 BasicIcfg [2019-11-28 18:05:37,682 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:05:37,683 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:05:37,683 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:05:37,683 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:05:37,684 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:05:07" (3/4) ... [2019-11-28 18:05:37,686 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:05:37,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_148| 0 0))) (and (= v_~z$r_buff0_thd1~0_163 0) (= v_~z$r_buff1_thd1~0_231 0) (= 0 v_~__unbuffered_p2_EAX~0_94) (= v_~weak$$choice2~0_336 0) (= v_~z$r_buff1_thd2~0_450 0) (= v_~main$tmp_guard0~0_29 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t406~0.base_114|) (= v_~z$w_buff0~0_389 0) (= v_~main$tmp_guard1~0_78 0) (= v_~y~0_48 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t406~0.base_114| 4) |v_#length_25|) (< 0 |v_#StackHeapBarrier_17|) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~__unbuffered_p0_EBX~0_85 0) (= v_~z$w_buff1~0_275 0) (= 0 v_~z$r_buff0_thd3~0_641) (= 0 v_~__unbuffered_p1_EAX~0_94) (= v_~__unbuffered_cnt~0_142 0) (= v_~z$w_buff1_used~0_552 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t406~0.base_114| 1) |v_#valid_146|) (= v_~z$r_buff1_thd0~0_338 0) (= 0 v_~__unbuffered_p0_EAX~0_85) (= v_~z$r_buff0_thd0~0_222 0) (= 0 v_~weak$$choice0~0_260) (= |v_#NULL.offset_5| 0) (= v_~z~0_393 0) (= 0 v_~z$r_buff1_thd3~0_405) (= 0 |v_ULTIMATE.start_main_~#t406~0.offset_64|) (= v_~__unbuffered_p2_EBX~0_87 0) (= v_~z$r_buff0_thd2~0_459 0) (= v_~a~0_33 0) (= 0 v_~z$flush_delayed~0_341) (= 0 v_~z$mem_tmp~0_277) (= v_~x~0_19 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t406~0.base_114|) 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t406~0.base_114| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t406~0.base_114|) |v_ULTIMATE.start_main_~#t406~0.offset_64| 0))) (= 0 |v_#NULL.base_5|) (= v_~z$w_buff0_used~0_978 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_16|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ULTIMATE.start_main_~#t408~0.base=|v_ULTIMATE.start_main_~#t408~0.base_63|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_450, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t408~0.offset=|v_ULTIMATE.start_main_~#t408~0.offset_38|, ~a~0=v_~a~0_33, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_222, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_94, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_94, ~z$mem_tmp~0=v_~z$mem_tmp~0_277, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_87, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_85, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_57|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_552, ~z$flush_delayed~0=v_~z$flush_delayed~0_341, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_159|, ~weak$$choice0~0=v_~weak$$choice0~0_260, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_33|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_231, ~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_641, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_142, ULTIMATE.start_main_~#t407~0.offset=|v_ULTIMATE.start_main_~#t407~0.offset_38|, ~x~0=v_~x~0_19, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_10|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_275, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_78, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t406~0.offset=|v_ULTIMATE.start_main_~#t406~0.offset_64|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_338, ~y~0=v_~y~0_48, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_459, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_978, ~z$w_buff0~0=v_~z$w_buff0~0_389, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_405, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_88|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t407~0.base=|v_ULTIMATE.start_main_~#t407~0.base_87|, ULTIMATE.start_main_~#t406~0.base=|v_ULTIMATE.start_main_~#t406~0.base_114|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_29|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_371|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_63|, #valid=|v_#valid_146|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_393, ~weak$$choice2~0=v_~weak$$choice2~0_336, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_163} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t408~0.base, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t408~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~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_~#t407~0.offset, ~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_~#t406~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t407~0.base, ULTIMATE.start_main_~#t406~0.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:05:37,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L840-1-->L842: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t407~0.base_11|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t407~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t407~0.offset_10|) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t407~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t407~0.base_11|) |v_ULTIMATE.start_main_~#t407~0.offset_10| 1))) (not (= |v_ULTIMATE.start_main_~#t407~0.base_11| 0)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t407~0.base_11| 4) |v_#length_15|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t407~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t407~0.offset=|v_ULTIMATE.start_main_~#t407~0.offset_10|, ULTIMATE.start_main_~#t407~0.base=|v_ULTIMATE.start_main_~#t407~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t407~0.offset, ULTIMATE.start_main_~#t407~0.base] because there is no mapped edge [2019-11-28 18:05:37,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1005] [1005] L842-1-->L844: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t408~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t408~0.base_11|) |v_ULTIMATE.start_main_~#t408~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t408~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t408~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t408~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t408~0.offset_10|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t408~0.base_11| 4)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t408~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t408~0.base=|v_ULTIMATE.start_main_~#t408~0.base_11|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t408~0.offset=|v_ULTIMATE.start_main_~#t408~0.offset_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t408~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t408~0.offset, #length] because there is no mapped edge [2019-11-28 18:05:37,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] P2ENTRY-->L4-3: Formula: (and (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69)) (= v_~z$w_buff0_used~0_347 1) (= |v_P2Thread1of1ForFork0_#in~arg.offset_69| v_P2Thread1of1ForFork0_~arg.offset_67) (= (ite (not (and (not (= (mod v_~z$w_buff1_used~0_200 256) 0)) (not (= (mod v_~z$w_buff0_used~0_347 256) 0)))) 1 0) |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|) (= v_~z$w_buff0_used~0_348 v_~z$w_buff1_used~0_200) (= v_~z$w_buff0~0_158 v_~z$w_buff1~0_95) (= v_~z$w_buff0~0_157 1) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|) (= |v_P2Thread1of1ForFork0_#in~arg.base_69| v_P2Thread1of1ForFork0_~arg.base_67)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_69|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_348, ~z$w_buff0~0=v_~z$w_buff0~0_158, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_69|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_67, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_69|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_347, ~z$w_buff0~0=v_~z$w_buff0~0_157, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_67, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_200, ~z$w_buff1~0=v_~z$w_buff1~0_95, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_69|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69} 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:05:37,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [967] [967] L802-2-->L802-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1243349630 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1243349630 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out-1243349630| ~z$w_buff0~0_In-1243349630)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out-1243349630| ~z$w_buff1~0_In-1243349630)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1243349630, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1243349630, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1243349630, ~z$w_buff1~0=~z$w_buff1~0_In-1243349630} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-1243349630|, ~z$w_buff0~0=~z$w_buff0~0_In-1243349630, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1243349630, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1243349630, ~z$w_buff1~0=~z$w_buff1~0_In-1243349630} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-11-28 18:05:37,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L802-4-->L803: Formula: (= v_~z~0_26 |v_P2Thread1of1ForFork0_#t~ite28_6|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_6|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_5|, ~z~0=v_~z~0_26, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, ~z~0, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-11-28 18:05:37,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L807-->L808: Formula: (and (not (= (mod v_~weak$$choice2~0_43 256) 0)) (= v_~z$r_buff0_thd3~0_66 v_~z$r_buff0_thd3~0_65)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_43} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_5|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_65, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_5|, ~weak$$choice2~0=v_~weak$$choice2~0_43} 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:05:37,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-1752612072 256)))) (or (and (not .cse0) (= ~z$mem_tmp~0_In-1752612072 |P2Thread1of1ForFork0_#t~ite48_Out-1752612072|)) (and .cse0 (= ~z~0_In-1752612072 |P2Thread1of1ForFork0_#t~ite48_Out-1752612072|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1752612072, ~z$flush_delayed~0=~z$flush_delayed~0_In-1752612072, ~z~0=~z~0_In-1752612072} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-1752612072|, ~z$mem_tmp~0=~z$mem_tmp~0_In-1752612072, ~z$flush_delayed~0=~z$flush_delayed~0_In-1752612072, ~z~0=~z~0_In-1752612072} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-11-28 18:05:37,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_10 |v_P0Thread1of1ForFork1_#in~arg.offset_12|) (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= |v_P0Thread1of1ForFork1_#in~arg.base_12| v_P0Thread1of1ForFork1_~arg.base_10) (= v_~__unbuffered_p0_EBX~0_19 v_~y~0_40) (= v_~x~0_13 v_~__unbuffered_p0_EAX~0_19) (= v_~x~0_13 1) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|) (= v_~__unbuffered_cnt~0_119 (+ v_~__unbuffered_cnt~0_120 1)) (= v_~a~0_17 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_120, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_12|, ~y~0=v_~y~0_40} OutVars{~a~0=v_~a~0_17, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_19, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_19, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_12|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_10, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_12|, ~y~0=v_~y~0_40, ~x~0=v_~x~0_13, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_10} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~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:05:37,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-913355646 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-913355646 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out-913355646|)) (and (= ~z$w_buff0_used~0_In-913355646 |P2Thread1of1ForFork0_#t~ite51_Out-913355646|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-913355646, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-913355646} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-913355646, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-913355646, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out-913355646|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-11-28 18:05:37,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L819-->L819-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In296420117 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In296420117 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In296420117 256))) (.cse3 (= (mod ~z$r_buff0_thd3~0_In296420117 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite52_Out296420117| 0)) (and (= ~z$w_buff1_used~0_In296420117 |P2Thread1of1ForFork0_#t~ite52_Out296420117|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In296420117, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In296420117, ~z$w_buff1_used~0=~z$w_buff1_used~0_In296420117, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In296420117} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In296420117, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In296420117, ~z$w_buff1_used~0=~z$w_buff1_used~0_In296420117, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out296420117|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In296420117} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-11-28 18:05:37,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L820-->L821: Formula: (let ((.cse1 (= ~z$r_buff0_thd3~0_In780821749 ~z$r_buff0_thd3~0_Out780821749)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In780821749 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In780821749 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= ~z$r_buff0_thd3~0_Out780821749 0) (not .cse0) (not .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In780821749, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In780821749} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In780821749, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out780821749, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out780821749|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-11-28 18:05:37,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [963] [963] L821-->L821-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-1981013350 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-1981013350 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1981013350 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-1981013350 256) 0))) (or (and (= ~z$r_buff1_thd3~0_In-1981013350 |P2Thread1of1ForFork0_#t~ite54_Out-1981013350|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork0_#t~ite54_Out-1981013350|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1981013350, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1981013350, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1981013350, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1981013350} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1981013350, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out-1981013350|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1981013350, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1981013350, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1981013350} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-11-28 18:05:37,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L821-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0) (= v_~__unbuffered_cnt~0_90 (+ v_~__unbuffered_cnt~0_91 1)) (= v_~z$r_buff1_thd3~0_201 |v_P2Thread1of1ForFork0_#t~ite54_36|)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_35|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_201, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, 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:05:37,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In165287154 256)))) (or (and (= ~z~0_In165287154 |P1Thread1of1ForFork2_#t~ite25_Out165287154|) .cse0) (and (= ~z$mem_tmp~0_In165287154 |P1Thread1of1ForFork2_#t~ite25_Out165287154|) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In165287154, ~z$flush_delayed~0=~z$flush_delayed~0_In165287154, ~z~0=~z~0_In165287154} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In165287154, ~z$flush_delayed~0=~z$flush_delayed~0_In165287154, ~z~0=~z~0_In165287154, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out165287154|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-11-28 18:05:37,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~z~0_239 |v_P1Thread1of1ForFork2_#t~ite25_92|) (= 0 v_~z$flush_delayed~0_267) (= v_~__unbuffered_cnt~0_117 (+ v_~__unbuffered_cnt~0_118 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_118, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_92|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_117, ~z$flush_delayed~0=v_~z$flush_delayed~0_267, ~z~0=v_~z~0_239, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_91|} 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:05:37,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [897] [897] L848-->L850-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= (mod v_~z$r_buff0_thd0~0_30 256) 0) (= 0 (mod v_~z$w_buff0_used~0_165 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_30, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_165, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_30, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_165, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:05:37,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L850-2-->L850-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite59_Out1335989813| |ULTIMATE.start_main_#t~ite58_Out1335989813|)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1335989813 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1335989813 256)))) (or (and .cse0 (not .cse1) (= ~z$w_buff1~0_In1335989813 |ULTIMATE.start_main_#t~ite58_Out1335989813|) (not .cse2)) (and .cse0 (or .cse2 .cse1) (= ~z~0_In1335989813 |ULTIMATE.start_main_#t~ite58_Out1335989813|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1335989813, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1335989813, ~z$w_buff1~0=~z$w_buff1~0_In1335989813, ~z~0=~z~0_In1335989813} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1335989813, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out1335989813|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1335989813, ~z$w_buff1~0=~z$w_buff1~0_In1335989813, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1335989813|, ~z~0=~z~0_In1335989813} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-11-28 18:05:37,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L851-->L851-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1451352744 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1451352744 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1451352744 |ULTIMATE.start_main_#t~ite60_Out-1451352744|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite60_Out-1451352744|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1451352744, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1451352744} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1451352744|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1451352744, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1451352744} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-11-28 18:05:37,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L852-->L852-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-406844606 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-406844606 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-406844606 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-406844606 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite61_Out-406844606| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite61_Out-406844606| ~z$w_buff1_used~0_In-406844606)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-406844606, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-406844606, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-406844606, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-406844606} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-406844606, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-406844606|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-406844606, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-406844606, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-406844606} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-11-28 18:05:37,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L853-->L853-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1804249739 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1804249739 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite62_Out1804249739| 0)) (and (= |ULTIMATE.start_main_#t~ite62_Out1804249739| ~z$r_buff0_thd0~0_In1804249739) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1804249739, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1804249739} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1804249739|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1804249739, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1804249739} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-11-28 18:05:37,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L854-->L854-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd0~0_In-1412559978 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1412559978 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1412559978 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1412559978 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In-1412559978 |ULTIMATE.start_main_#t~ite63_Out-1412559978|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite63_Out-1412559978|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1412559978, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1412559978, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1412559978, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1412559978} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1412559978|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1412559978, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1412559978, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1412559978, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1412559978} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-11-28 18:05:37,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_22 256)) (= v_~z$r_buff1_thd0~0_254 |v_ULTIMATE.start_main_#t~ite63_47|) (= v_~main$tmp_guard1~0_22 (ite (= (ite (not (and (= v_~__unbuffered_p0_EBX~0_30 0) (= 1 v_~__unbuffered_p0_EAX~0_30) (= v_~__unbuffered_p2_EBX~0_26 0) (= 0 v_~__unbuffered_p1_EAX~0_29) (= 1 v_~__unbuffered_p2_EAX~0_22))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_47|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_46|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_254, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} 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:05:37,846 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:05:37,846 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:05:37,848 INFO L168 Benchmark]: Toolchain (without parser) took 32318.46 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 952.3 MB in the beginning and 1.8 GB in the end (delta: -807.8 MB). Peak memory consumption was 439.4 MB. Max. memory is 11.5 GB. [2019-11-28 18:05:37,849 INFO L168 Benchmark]: CDTParser took 0.29 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:05:37,849 INFO L168 Benchmark]: CACSL2BoogieTranslator took 773.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -159.5 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:05:37,852 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:05:37,852 INFO L168 Benchmark]: Boogie Preprocessor took 48.64 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:05:37,853 INFO L168 Benchmark]: RCFGBuilder took 872.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 11.5 GB. [2019-11-28 18:05:37,854 INFO L168 Benchmark]: TraceAbstraction took 30374.05 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -737.9 MB). Peak memory consumption was 365.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:05:37,854 INFO L168 Benchmark]: Witness Printer took 163.98 ms. Allocated memory is still 2.3 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. [2019-11-28 18:05:37,857 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 773.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -159.5 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 79.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.64 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 872.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30374.05 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -737.9 MB). Peak memory consumption was 365.7 MB. Max. memory is 11.5 GB. * Witness Printer took 163.98 ms. Allocated memory is still 2.3 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.8s, 197 ProgramPointsBefore, 108 ProgramPointsAfterwards, 243 TransitionsBefore, 130 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 53 ConcurrentYvCompositions, 28 ChoiceCompositions, 9454 VarBasedMoverChecksPositive, 317 VarBasedMoverChecksNegative, 92 SemBasedMoverChecksPositive, 331 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.3s, 0 MoverChecksTotal, 124397 CheckedPairsTotal, 127 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L840] FCALL, FORK 0 pthread_create(&t406, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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(&t407, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L844] FCALL, FORK 0 pthread_create(&t408, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L791] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L792] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L793] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L794] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L795] 3 z$r_buff0_thd3 = (_Bool)1 [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 z$flush_delayed = weak$$choice2 [L801] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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] [L802] 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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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] [L803] 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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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 = 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)) [L804] 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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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 = 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)) [L805] 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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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] [L805] 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)) [L806] 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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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$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)) [L808] 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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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$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)) [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=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=2, 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] [L810] 3 z = z$flush_delayed ? z$mem_tmp : z [L811] 3 z$flush_delayed = (_Bool)0 [L814] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=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=2, 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] [L817] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=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=2, 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] [L758] 2 y = 1 [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 z$flush_delayed = weak$$choice2 [L764] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, 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] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, 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] [L817] 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) [L818] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L819] 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 [L765] 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) [L766] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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=1, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L766] 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)) [L767] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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=1, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L767] 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)) [L768] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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))=0, x=1, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 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)) [L769] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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=1, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L769] 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)) [L770] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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=1, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 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)) [L771] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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=1, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 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)) [L772] 2 __unbuffered_p1_EAX = z VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, 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] [L850] 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) [L851] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L852] 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 [L853] 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, 188 locations, 2 error locations. Result: UNSAFE, OverallTime: 29.9s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3653 SDtfs, 5747 SDslu, 11381 SDs, 0 SdLazy, 4433 SolverSat, 195 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 191 GetRequests, 45 SyntacticMatches, 11 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44886occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 19351 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 825 NumberOfCodeBlocks, 825 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 746 ConstructedInterpolants, 0 QuantifiedInterpolants, 326306 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...