./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe017_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9529f26a-4db6-4c77-919a-b293003354e8/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9529f26a-4db6-4c77-919a-b293003354e8/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9529f26a-4db6-4c77-919a-b293003354e8/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9529f26a-4db6-4c77-919a-b293003354e8/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe017_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_9529f26a-4db6-4c77-919a-b293003354e8/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9529f26a-4db6-4c77-919a-b293003354e8/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 81741595bd22809a5ff0880eed45049d732bca16 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-12-07 13:25:20,391 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:25:20,392 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:25:20,399 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:25:20,400 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:25:20,400 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:25:20,401 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:25:20,403 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:25:20,404 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:25:20,405 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:25:20,406 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:25:20,407 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:25:20,407 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:25:20,407 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:25:20,408 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:25:20,409 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:25:20,410 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:25:20,411 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:25:20,412 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:25:20,413 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:25:20,415 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:25:20,416 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:25:20,417 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:25:20,417 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:25:20,419 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:25:20,419 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:25:20,419 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:25:20,420 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:25:20,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:25:20,421 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:25:20,421 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:25:20,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:25:20,422 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:25:20,423 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:25:20,423 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:25:20,424 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:25:20,424 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:25:20,424 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:25:20,424 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:25:20,425 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:25:20,425 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:25:20,426 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9529f26a-4db6-4c77-919a-b293003354e8/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 13:25:20,439 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:25:20,439 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:25:20,440 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 13:25:20,440 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 13:25:20,440 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 13:25:20,440 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 13:25:20,440 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 13:25:20,440 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 13:25:20,441 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 13:25:20,441 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 13:25:20,441 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 13:25:20,441 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 13:25:20,441 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 13:25:20,441 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 13:25:20,442 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 13:25:20,442 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:25:20,442 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:25:20,442 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:25:20,443 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:25:20,443 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:25:20,443 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:25:20,443 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:25:20,443 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:25:20,443 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 13:25:20,443 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:25:20,443 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:25:20,443 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:25:20,444 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:25:20,444 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:25:20,444 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:25:20,444 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:25:20,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:25:20,444 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:25:20,444 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:25:20,444 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:25:20,444 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 13:25:20,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:25:20,445 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:25:20,445 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:25:20,445 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 13:25:20,445 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_9529f26a-4db6-4c77-919a-b293003354e8/bin/utaipan 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 -> Taipan 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 -> 81741595bd22809a5ff0880eed45049d732bca16 [2019-12-07 13:25:20,553 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:25:20,563 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:25:20,566 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:25:20,568 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:25:20,568 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:25:20,569 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9529f26a-4db6-4c77-919a-b293003354e8/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/safe017_power.opt.i [2019-12-07 13:25:20,610 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9529f26a-4db6-4c77-919a-b293003354e8/bin/utaipan/data/a5d64db30/c485789dcdc54a12bb1ecda5e44c561a/FLAG45fe05524 [2019-12-07 13:25:21,059 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:25:21,059 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9529f26a-4db6-4c77-919a-b293003354e8/sv-benchmarks/c/pthread-wmm/safe017_power.opt.i [2019-12-07 13:25:21,069 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9529f26a-4db6-4c77-919a-b293003354e8/bin/utaipan/data/a5d64db30/c485789dcdc54a12bb1ecda5e44c561a/FLAG45fe05524 [2019-12-07 13:25:21,078 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9529f26a-4db6-4c77-919a-b293003354e8/bin/utaipan/data/a5d64db30/c485789dcdc54a12bb1ecda5e44c561a [2019-12-07 13:25:21,080 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:25:21,081 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:25:21,082 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:25:21,082 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:25:21,084 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:25:21,085 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:25:21" (1/1) ... [2019-12-07 13:25:21,086 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551fb3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:25:21, skipping insertion in model container [2019-12-07 13:25:21,086 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:25:21" (1/1) ... [2019-12-07 13:25:21,091 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:25:21,118 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:25:21,391 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:25:21,398 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:25:21,439 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:25:21,486 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:25:21,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:25:21 WrapperNode [2019-12-07 13:25:21,486 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:25:21,487 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:25:21,487 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:25:21,487 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:25:21,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:25:21" (1/1) ... [2019-12-07 13:25:21,505 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:25:21" (1/1) ... [2019-12-07 13:25:21,525 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:25:21,526 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:25:21,526 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:25:21,526 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:25:21,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:25:21" (1/1) ... [2019-12-07 13:25:21,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:25:21" (1/1) ... [2019-12-07 13:25:21,535 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:25:21" (1/1) ... [2019-12-07 13:25:21,536 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:25:21" (1/1) ... [2019-12-07 13:25:21,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:25:21" (1/1) ... [2019-12-07 13:25:21,545 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:25:21" (1/1) ... [2019-12-07 13:25:21,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:25:21" (1/1) ... [2019-12-07 13:25:21,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:25:21,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:25:21,551 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:25:21,551 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:25:21,552 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:25:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9529f26a-4db6-4c77-919a-b293003354e8/bin/utaipan/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-12-07 13:25:21,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:25:21,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 13:25:21,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:25:21,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:25:21,595 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 13:25:21,595 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 13:25:21,595 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 13:25:21,596 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 13:25:21,596 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 13:25:21,596 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 13:25:21,596 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 13:25:21,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:25:21,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:25:21,597 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 13:25:21,965 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:25:21,965 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 13:25:21,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:25:21 BoogieIcfgContainer [2019-12-07 13:25:21,966 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:25:21,967 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:25:21,967 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:25:21,969 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:25:21,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:25:21" (1/3) ... [2019-12-07 13:25:21,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42d18a1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:25:21, skipping insertion in model container [2019-12-07 13:25:21,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:25:21" (2/3) ... [2019-12-07 13:25:21,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42d18a1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:25:21, skipping insertion in model container [2019-12-07 13:25:21,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:25:21" (3/3) ... [2019-12-07 13:25:21,971 INFO L109 eAbstractionObserver]: Analyzing ICFG safe017_power.opt.i [2019-12-07 13:25:21,977 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 13:25:21,977 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:25:21,982 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 13:25:21,983 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 13:25:22,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,007 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,007 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,007 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,008 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,008 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,014 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,014 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,019 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,019 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:25:22,038 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 13:25:22,052 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:25:22,052 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:25:22,052 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:25:22,052 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:25:22,052 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:25:22,052 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:25:22,052 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:25:22,052 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:25:22,063 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 210 transitions [2019-12-07 13:25:22,064 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-07 13:25:22,131 INFO L134 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-07 13:25:22,131 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:25:22,139 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 585 event pairs. 9/167 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 13:25:22,153 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-07 13:25:22,180 INFO L134 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-07 13:25:22,180 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:25:22,186 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 585 event pairs. 9/167 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 13:25:22,201 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-07 13:25:22,202 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 13:25:25,026 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-07 13:25:25,108 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78185 [2019-12-07 13:25:25,109 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-07 13:25:25,111 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 104 transitions [2019-12-07 13:25:38,555 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 112926 states. [2019-12-07 13:25:38,557 INFO L276 IsEmpty]: Start isEmpty. Operand 112926 states. [2019-12-07 13:25:38,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 13:25:38,561 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:25:38,561 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 13:25:38,562 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:25:38,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:25:38,566 INFO L82 PathProgramCache]: Analyzing trace with hash 844394, now seen corresponding path program 1 times [2019-12-07 13:25:38,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:25:38,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320615960] [2019-12-07 13:25:38,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:25:38,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:25:38,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:25:38,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320615960] [2019-12-07 13:25:38,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:25:38,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:25:38,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977062467] [2019-12-07 13:25:38,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:25:38,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:25:38,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:25:38,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:25:38,719 INFO L87 Difference]: Start difference. First operand 112926 states. Second operand 3 states. [2019-12-07 13:25:39,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:25:39,586 INFO L93 Difference]: Finished difference Result 112536 states and 479624 transitions. [2019-12-07 13:25:39,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:25:39,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 13:25:39,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:25:40,130 INFO L225 Difference]: With dead ends: 112536 [2019-12-07 13:25:40,130 INFO L226 Difference]: Without dead ends: 110184 [2019-12-07 13:25:40,131 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-12-07 13:25:43,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110184 states. [2019-12-07 13:25:45,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110184 to 110184. [2019-12-07 13:25:45,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110184 states. [2019-12-07 13:25:45,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110184 states to 110184 states and 470020 transitions. [2019-12-07 13:25:45,490 INFO L78 Accepts]: Start accepts. Automaton has 110184 states and 470020 transitions. Word has length 3 [2019-12-07 13:25:45,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:25:45,490 INFO L462 AbstractCegarLoop]: Abstraction has 110184 states and 470020 transitions. [2019-12-07 13:25:45,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:25:45,490 INFO L276 IsEmpty]: Start isEmpty. Operand 110184 states and 470020 transitions. [2019-12-07 13:25:45,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 13:25:45,494 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:25:45,494 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:25:45,494 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:25:45,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:25:45,494 INFO L82 PathProgramCache]: Analyzing trace with hash -418531443, now seen corresponding path program 1 times [2019-12-07 13:25:45,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:25:45,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336920792] [2019-12-07 13:25:45,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:25:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:25:45,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:25:45,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336920792] [2019-12-07 13:25:45,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:25:45,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:25:45,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560237743] [2019-12-07 13:25:45,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:25:45,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:25:45,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:25:45,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:25:45,573 INFO L87 Difference]: Start difference. First operand 110184 states and 470020 transitions. Second operand 4 states. [2019-12-07 13:25:48,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:25:48,351 INFO L93 Difference]: Finished difference Result 172298 states and 706272 transitions. [2019-12-07 13:25:48,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:25:48,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 13:25:48,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:25:48,806 INFO L225 Difference]: With dead ends: 172298 [2019-12-07 13:25:48,807 INFO L226 Difference]: Without dead ends: 172249 [2019-12-07 13:25:48,807 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-12-07 13:25:53,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172249 states. [2019-12-07 13:25:55,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172249 to 156321. [2019-12-07 13:25:55,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156321 states. [2019-12-07 13:25:55,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156321 states to 156321 states and 647667 transitions. [2019-12-07 13:25:55,667 INFO L78 Accepts]: Start accepts. Automaton has 156321 states and 647667 transitions. Word has length 11 [2019-12-07 13:25:55,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:25:55,667 INFO L462 AbstractCegarLoop]: Abstraction has 156321 states and 647667 transitions. [2019-12-07 13:25:55,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:25:55,667 INFO L276 IsEmpty]: Start isEmpty. Operand 156321 states and 647667 transitions. [2019-12-07 13:25:55,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 13:25:55,671 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:25:55,672 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:25:55,672 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:25:55,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:25:55,672 INFO L82 PathProgramCache]: Analyzing trace with hash -986312255, now seen corresponding path program 1 times [2019-12-07 13:25:55,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:25:55,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461296548] [2019-12-07 13:25:55,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:25:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:25:55,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:25:55,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461296548] [2019-12-07 13:25:55,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:25:55,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:25:55,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214350831] [2019-12-07 13:25:55,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:25:55,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:25:55,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:25:55,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:25:55,712 INFO L87 Difference]: Start difference. First operand 156321 states and 647667 transitions. Second operand 3 states. [2019-12-07 13:25:55,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:25:55,805 INFO L93 Difference]: Finished difference Result 32129 states and 104196 transitions. [2019-12-07 13:25:55,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:25:55,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-07 13:25:55,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:25:55,854 INFO L225 Difference]: With dead ends: 32129 [2019-12-07 13:25:55,854 INFO L226 Difference]: Without dead ends: 32129 [2019-12-07 13:25:55,854 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:25:56,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32129 states. [2019-12-07 13:25:56,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32129 to 32129. [2019-12-07 13:25:56,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32129 states. [2019-12-07 13:25:56,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32129 states to 32129 states and 104196 transitions. [2019-12-07 13:25:56,375 INFO L78 Accepts]: Start accepts. Automaton has 32129 states and 104196 transitions. Word has length 13 [2019-12-07 13:25:56,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:25:56,375 INFO L462 AbstractCegarLoop]: Abstraction has 32129 states and 104196 transitions. [2019-12-07 13:25:56,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:25:56,375 INFO L276 IsEmpty]: Start isEmpty. Operand 32129 states and 104196 transitions. [2019-12-07 13:25:56,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 13:25:56,377 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:25:56,377 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:25:56,377 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:25:56,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:25:56,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1176456771, now seen corresponding path program 1 times [2019-12-07 13:25:56,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:25:56,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891287962] [2019-12-07 13:25:56,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:25:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:25:56,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:25:56,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891287962] [2019-12-07 13:25:56,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:25:56,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:25:56,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714817303] [2019-12-07 13:25:56,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:25:56,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:25:56,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:25:56,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:25:56,440 INFO L87 Difference]: Start difference. First operand 32129 states and 104196 transitions. Second operand 4 states. [2019-12-07 13:25:57,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:25:57,080 INFO L93 Difference]: Finished difference Result 43159 states and 136814 transitions. [2019-12-07 13:25:57,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:25:57,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 13:25:57,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:25:57,140 INFO L225 Difference]: With dead ends: 43159 [2019-12-07 13:25:57,141 INFO L226 Difference]: Without dead ends: 43152 [2019-12-07 13:25:57,141 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-12-07 13:25:57,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43152 states. [2019-12-07 13:25:57,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43152 to 37631. [2019-12-07 13:25:57,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37631 states. [2019-12-07 13:25:57,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37631 states to 37631 states and 121166 transitions. [2019-12-07 13:25:57,783 INFO L78 Accepts]: Start accepts. Automaton has 37631 states and 121166 transitions. Word has length 13 [2019-12-07 13:25:57,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:25:57,784 INFO L462 AbstractCegarLoop]: Abstraction has 37631 states and 121166 transitions. [2019-12-07 13:25:57,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:25:57,784 INFO L276 IsEmpty]: Start isEmpty. Operand 37631 states and 121166 transitions. [2019-12-07 13:25:57,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 13:25:57,787 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:25:57,787 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:25:57,788 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:25:57,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:25:57,788 INFO L82 PathProgramCache]: Analyzing trace with hash -2012510844, now seen corresponding path program 1 times [2019-12-07 13:25:57,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:25:57,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717430825] [2019-12-07 13:25:57,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:25:57,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:25:57,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:25:57,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717430825] [2019-12-07 13:25:57,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:25:57,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:25:57,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321493326] [2019-12-07 13:25:57,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:25:57,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:25:57,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:25:57,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:25:57,857 INFO L87 Difference]: Start difference. First operand 37631 states and 121166 transitions. Second operand 5 states. [2019-12-07 13:25:58,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:25:58,388 INFO L93 Difference]: Finished difference Result 50788 states and 160280 transitions. [2019-12-07 13:25:58,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 13:25:58,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-07 13:25:58,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:25:58,464 INFO L225 Difference]: With dead ends: 50788 [2019-12-07 13:25:58,464 INFO L226 Difference]: Without dead ends: 50775 [2019-12-07 13:25:58,465 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:25:58,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50775 states. [2019-12-07 13:25:59,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50775 to 38059. [2019-12-07 13:25:59,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38059 states. [2019-12-07 13:25:59,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38059 states to 38059 states and 122380 transitions. [2019-12-07 13:25:59,171 INFO L78 Accepts]: Start accepts. Automaton has 38059 states and 122380 transitions. Word has length 19 [2019-12-07 13:25:59,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:25:59,172 INFO L462 AbstractCegarLoop]: Abstraction has 38059 states and 122380 transitions. [2019-12-07 13:25:59,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:25:59,172 INFO L276 IsEmpty]: Start isEmpty. Operand 38059 states and 122380 transitions. [2019-12-07 13:25:59,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 13:25:59,181 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:25:59,181 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] [2019-12-07 13:25:59,181 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:25:59,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:25:59,182 INFO L82 PathProgramCache]: Analyzing trace with hash -394195806, now seen corresponding path program 1 times [2019-12-07 13:25:59,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:25:59,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381332212] [2019-12-07 13:25:59,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:25:59,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:25:59,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:25:59,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381332212] [2019-12-07 13:25:59,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:25:59,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:25:59,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014306172] [2019-12-07 13:25:59,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:25:59,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:25:59,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:25:59,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:25:59,222 INFO L87 Difference]: Start difference. First operand 38059 states and 122380 transitions. Second operand 4 states. [2019-12-07 13:25:59,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:25:59,252 INFO L93 Difference]: Finished difference Result 7382 states and 20162 transitions. [2019-12-07 13:25:59,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:25:59,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-07 13:25:59,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:25:59,259 INFO L225 Difference]: With dead ends: 7382 [2019-12-07 13:25:59,260 INFO L226 Difference]: Without dead ends: 7382 [2019-12-07 13:25:59,260 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:25:59,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2019-12-07 13:25:59,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7270. [2019-12-07 13:25:59,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7270 states. [2019-12-07 13:25:59,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7270 states to 7270 states and 19842 transitions. [2019-12-07 13:25:59,345 INFO L78 Accepts]: Start accepts. Automaton has 7270 states and 19842 transitions. Word has length 25 [2019-12-07 13:25:59,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:25:59,345 INFO L462 AbstractCegarLoop]: Abstraction has 7270 states and 19842 transitions. [2019-12-07 13:25:59,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:25:59,345 INFO L276 IsEmpty]: Start isEmpty. Operand 7270 states and 19842 transitions. [2019-12-07 13:25:59,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 13:25:59,353 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:25:59,353 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] [2019-12-07 13:25:59,353 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:25:59,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:25:59,354 INFO L82 PathProgramCache]: Analyzing trace with hash 56145512, now seen corresponding path program 1 times [2019-12-07 13:25:59,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:25:59,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613169054] [2019-12-07 13:25:59,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:25:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:25:59,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:25:59,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613169054] [2019-12-07 13:25:59,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:25:59,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:25:59,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664866917] [2019-12-07 13:25:59,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:25:59,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:25:59,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:25:59,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:25:59,400 INFO L87 Difference]: Start difference. First operand 7270 states and 19842 transitions. Second operand 5 states. [2019-12-07 13:25:59,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:25:59,427 INFO L93 Difference]: Finished difference Result 5311 states and 15265 transitions. [2019-12-07 13:25:59,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:25:59,428 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-07 13:25:59,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:25:59,434 INFO L225 Difference]: With dead ends: 5311 [2019-12-07 13:25:59,434 INFO L226 Difference]: Without dead ends: 5311 [2019-12-07 13:25:59,435 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:25:59,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5311 states. [2019-12-07 13:25:59,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5311 to 4947. [2019-12-07 13:25:59,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4947 states. [2019-12-07 13:25:59,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4947 states to 4947 states and 14281 transitions. [2019-12-07 13:25:59,508 INFO L78 Accepts]: Start accepts. Automaton has 4947 states and 14281 transitions. Word has length 37 [2019-12-07 13:25:59,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:25:59,508 INFO L462 AbstractCegarLoop]: Abstraction has 4947 states and 14281 transitions. [2019-12-07 13:25:59,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:25:59,508 INFO L276 IsEmpty]: Start isEmpty. Operand 4947 states and 14281 transitions. [2019-12-07 13:25:59,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 13:25:59,516 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:25:59,516 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, 1, 1] [2019-12-07 13:25:59,516 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:25:59,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:25:59,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1380306829, now seen corresponding path program 1 times [2019-12-07 13:25:59,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:25:59,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150429693] [2019-12-07 13:25:59,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:25:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:25:59,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:25:59,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150429693] [2019-12-07 13:25:59,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:25:59,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:25:59,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352115404] [2019-12-07 13:25:59,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:25:59,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:25:59,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:25:59,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:25:59,560 INFO L87 Difference]: Start difference. First operand 4947 states and 14281 transitions. Second operand 3 states. [2019-12-07 13:25:59,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:25:59,597 INFO L93 Difference]: Finished difference Result 4958 states and 14296 transitions. [2019-12-07 13:25:59,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:25:59,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-07 13:25:59,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:25:59,604 INFO L225 Difference]: With dead ends: 4958 [2019-12-07 13:25:59,604 INFO L226 Difference]: Without dead ends: 4958 [2019-12-07 13:25:59,605 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:25:59,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4958 states. [2019-12-07 13:25:59,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4958 to 4954. [2019-12-07 13:25:59,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4954 states. [2019-12-07 13:25:59,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4954 states to 4954 states and 14292 transitions. [2019-12-07 13:25:59,670 INFO L78 Accepts]: Start accepts. Automaton has 4954 states and 14292 transitions. Word has length 65 [2019-12-07 13:25:59,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:25:59,671 INFO L462 AbstractCegarLoop]: Abstraction has 4954 states and 14292 transitions. [2019-12-07 13:25:59,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:25:59,671 INFO L276 IsEmpty]: Start isEmpty. Operand 4954 states and 14292 transitions. [2019-12-07 13:25:59,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 13:25:59,677 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:25:59,677 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, 1, 1] [2019-12-07 13:25:59,677 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:25:59,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:25:59,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1838424094, now seen corresponding path program 1 times [2019-12-07 13:25:59,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:25:59,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714940506] [2019-12-07 13:25:59,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:25:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:25:59,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:25:59,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714940506] [2019-12-07 13:25:59,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:25:59,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:25:59,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359259059] [2019-12-07 13:25:59,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:25:59,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:25:59,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:25:59,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:25:59,751 INFO L87 Difference]: Start difference. First operand 4954 states and 14292 transitions. Second operand 3 states. [2019-12-07 13:25:59,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:25:59,773 INFO L93 Difference]: Finished difference Result 4666 states and 13243 transitions. [2019-12-07 13:25:59,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:25:59,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-07 13:25:59,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:25:59,779 INFO L225 Difference]: With dead ends: 4666 [2019-12-07 13:25:59,779 INFO L226 Difference]: Without dead ends: 4666 [2019-12-07 13:25:59,779 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-12-07 13:25:59,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4666 states. [2019-12-07 13:25:59,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4666 to 4666. [2019-12-07 13:25:59,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4666 states. [2019-12-07 13:25:59,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 13243 transitions. [2019-12-07 13:25:59,839 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 13243 transitions. Word has length 65 [2019-12-07 13:25:59,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:25:59,839 INFO L462 AbstractCegarLoop]: Abstraction has 4666 states and 13243 transitions. [2019-12-07 13:25:59,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:25:59,839 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 13243 transitions. [2019-12-07 13:25:59,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:25:59,844 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:25:59,844 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, 1, 1, 1] [2019-12-07 13:25:59,844 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:25:59,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:25:59,844 INFO L82 PathProgramCache]: Analyzing trace with hash -707320023, now seen corresponding path program 1 times [2019-12-07 13:25:59,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:25:59,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037620728] [2019-12-07 13:25:59,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:25:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:25:59,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:25:59,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037620728] [2019-12-07 13:25:59,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:25:59,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:25:59,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708860799] [2019-12-07 13:25:59,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:25:59,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:25:59,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:25:59,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:25:59,920 INFO L87 Difference]: Start difference. First operand 4666 states and 13243 transitions. Second operand 5 states. [2019-12-07 13:26:00,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:26:00,097 INFO L93 Difference]: Finished difference Result 7090 states and 19974 transitions. [2019-12-07 13:26:00,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:26:00,098 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-07 13:26:00,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:26:00,103 INFO L225 Difference]: With dead ends: 7090 [2019-12-07 13:26:00,103 INFO L226 Difference]: Without dead ends: 7090 [2019-12-07 13:26:00,104 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:26:00,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7090 states. [2019-12-07 13:26:00,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7090 to 5825. [2019-12-07 13:26:00,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5825 states. [2019-12-07 13:26:00,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5825 states to 5825 states and 16556 transitions. [2019-12-07 13:26:00,177 INFO L78 Accepts]: Start accepts. Automaton has 5825 states and 16556 transitions. Word has length 66 [2019-12-07 13:26:00,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:26:00,177 INFO L462 AbstractCegarLoop]: Abstraction has 5825 states and 16556 transitions. [2019-12-07 13:26:00,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:26:00,177 INFO L276 IsEmpty]: Start isEmpty. Operand 5825 states and 16556 transitions. [2019-12-07 13:26:00,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:26:00,184 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:26:00,184 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, 1, 1, 1] [2019-12-07 13:26:00,184 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:26:00,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:26:00,184 INFO L82 PathProgramCache]: Analyzing trace with hash 429063715, now seen corresponding path program 2 times [2019-12-07 13:26:00,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:26:00,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452230708] [2019-12-07 13:26:00,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:26:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:26:00,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:26:00,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452230708] [2019-12-07 13:26:00,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:26:00,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:26:00,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620121847] [2019-12-07 13:26:00,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:26:00,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:26:00,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:26:00,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:26:00,773 INFO L87 Difference]: Start difference. First operand 5825 states and 16556 transitions. Second operand 5 states. [2019-12-07 13:26:00,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:26:00,960 INFO L93 Difference]: Finished difference Result 8400 states and 23631 transitions. [2019-12-07 13:26:00,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:26:00,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-07 13:26:00,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:26:00,967 INFO L225 Difference]: With dead ends: 8400 [2019-12-07 13:26:00,967 INFO L226 Difference]: Without dead ends: 8400 [2019-12-07 13:26:00,967 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:26:00,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8400 states. [2019-12-07 13:26:01,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8400 to 6173. [2019-12-07 13:26:01,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6173 states. [2019-12-07 13:26:01,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6173 states to 6173 states and 17589 transitions. [2019-12-07 13:26:01,049 INFO L78 Accepts]: Start accepts. Automaton has 6173 states and 17589 transitions. Word has length 66 [2019-12-07 13:26:01,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:26:01,049 INFO L462 AbstractCegarLoop]: Abstraction has 6173 states and 17589 transitions. [2019-12-07 13:26:01,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:26:01,049 INFO L276 IsEmpty]: Start isEmpty. Operand 6173 states and 17589 transitions. [2019-12-07 13:26:01,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:26:01,056 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:26:01,056 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, 1, 1, 1] [2019-12-07 13:26:01,056 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:26:01,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:26:01,057 INFO L82 PathProgramCache]: Analyzing trace with hash -2071652769, now seen corresponding path program 3 times [2019-12-07 13:26:01,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:26:01,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777651956] [2019-12-07 13:26:01,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:26:01,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:26:01,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:26:01,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777651956] [2019-12-07 13:26:01,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:26:01,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:26:01,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080318218] [2019-12-07 13:26:01,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:26:01,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:26:01,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:26:01,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:26:01,123 INFO L87 Difference]: Start difference. First operand 6173 states and 17589 transitions. Second operand 6 states. [2019-12-07 13:26:01,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:26:01,423 INFO L93 Difference]: Finished difference Result 8757 states and 24595 transitions. [2019-12-07 13:26:01,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 13:26:01,423 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-07 13:26:01,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:26:01,433 INFO L225 Difference]: With dead ends: 8757 [2019-12-07 13:26:01,433 INFO L226 Difference]: Without dead ends: 8757 [2019-12-07 13:26:01,434 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-07 13:26:01,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8757 states. [2019-12-07 13:26:01,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8757 to 6362. [2019-12-07 13:26:01,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6362 states. [2019-12-07 13:26:01,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6362 states to 6362 states and 18145 transitions. [2019-12-07 13:26:01,533 INFO L78 Accepts]: Start accepts. Automaton has 6362 states and 18145 transitions. Word has length 66 [2019-12-07 13:26:01,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:26:01,533 INFO L462 AbstractCegarLoop]: Abstraction has 6362 states and 18145 transitions. [2019-12-07 13:26:01,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:26:01,533 INFO L276 IsEmpty]: Start isEmpty. Operand 6362 states and 18145 transitions. [2019-12-07 13:26:01,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:26:01,541 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:26:01,541 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, 1, 1, 1] [2019-12-07 13:26:01,541 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:26:01,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:26:01,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1231010579, now seen corresponding path program 4 times [2019-12-07 13:26:01,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:26:01,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986268579] [2019-12-07 13:26:01,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:26:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:26:01,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-12-07 13:26:01,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986268579] [2019-12-07 13:26:01,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:26:01,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 13:26:01,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973796753] [2019-12-07 13:26:01,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 13:26:01,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:26:01,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 13:26:01,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:26:01,726 INFO L87 Difference]: Start difference. First operand 6362 states and 18145 transitions. Second operand 11 states. [2019-12-07 13:26:02,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:26:02,527 INFO L93 Difference]: Finished difference Result 13199 states and 37746 transitions. [2019-12-07 13:26:02,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 13:26:02,527 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-07 13:26:02,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:26:02,538 INFO L225 Difference]: With dead ends: 13199 [2019-12-07 13:26:02,538 INFO L226 Difference]: Without dead ends: 13199 [2019-12-07 13:26:02,539 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-12-07 13:26:02,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13199 states. [2019-12-07 13:26:02,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13199 to 6626. [2019-12-07 13:26:02,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6626 states. [2019-12-07 13:26:02,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6626 states to 6626 states and 18995 transitions. [2019-12-07 13:26:02,655 INFO L78 Accepts]: Start accepts. Automaton has 6626 states and 18995 transitions. Word has length 66 [2019-12-07 13:26:02,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:26:02,655 INFO L462 AbstractCegarLoop]: Abstraction has 6626 states and 18995 transitions. [2019-12-07 13:26:02,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 13:26:02,655 INFO L276 IsEmpty]: Start isEmpty. Operand 6626 states and 18995 transitions. [2019-12-07 13:26:02,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:26:02,663 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:26:02,663 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, 1, 1, 1] [2019-12-07 13:26:02,664 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:26:02,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:26:02,664 INFO L82 PathProgramCache]: Analyzing trace with hash -2078646397, now seen corresponding path program 5 times [2019-12-07 13:26:02,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:26:02,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900289768] [2019-12-07 13:26:02,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:26:02,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:26:02,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:26:02,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900289768] [2019-12-07 13:26:02,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:26:02,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:26:02,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98254397] [2019-12-07 13:26:02,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:26:02,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:26:02,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:26:02,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:26:02,716 INFO L87 Difference]: Start difference. First operand 6626 states and 18995 transitions. Second operand 3 states. [2019-12-07 13:26:02,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:26:02,760 INFO L93 Difference]: Finished difference Result 6626 states and 18994 transitions. [2019-12-07 13:26:02,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:26:02,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 13:26:02,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:26:02,769 INFO L225 Difference]: With dead ends: 6626 [2019-12-07 13:26:02,769 INFO L226 Difference]: Without dead ends: 6626 [2019-12-07 13:26:02,769 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-12-07 13:26:02,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6626 states. [2019-12-07 13:26:02,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6626 to 4033. [2019-12-07 13:26:02,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4033 states. [2019-12-07 13:26:02,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4033 states to 4033 states and 11698 transitions. [2019-12-07 13:26:02,834 INFO L78 Accepts]: Start accepts. Automaton has 4033 states and 11698 transitions. Word has length 66 [2019-12-07 13:26:02,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:26:02,834 INFO L462 AbstractCegarLoop]: Abstraction has 4033 states and 11698 transitions. [2019-12-07 13:26:02,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:26:02,834 INFO L276 IsEmpty]: Start isEmpty. Operand 4033 states and 11698 transitions. [2019-12-07 13:26:02,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 13:26:02,838 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:26:02,839 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, 1, 1, 1, 1] [2019-12-07 13:26:02,839 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:26:02,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:26:02,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1492386830, now seen corresponding path program 1 times [2019-12-07 13:26:02,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:26:02,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173802506] [2019-12-07 13:26:02,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:26:02,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:26:02,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:26:02,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173802506] [2019-12-07 13:26:02,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:26:02,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:26:02,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199419054] [2019-12-07 13:26:02,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:26:02,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:26:02,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:26:02,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:26:02,878 INFO L87 Difference]: Start difference. First operand 4033 states and 11698 transitions. Second operand 3 states. [2019-12-07 13:26:02,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:26:02,896 INFO L93 Difference]: Finished difference Result 3723 states and 10543 transitions. [2019-12-07 13:26:02,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:26:02,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-07 13:26:02,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:26:02,899 INFO L225 Difference]: With dead ends: 3723 [2019-12-07 13:26:02,899 INFO L226 Difference]: Without dead ends: 3723 [2019-12-07 13:26:02,899 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-12-07 13:26:02,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2019-12-07 13:26:02,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 2989. [2019-12-07 13:26:02,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2989 states. [2019-12-07 13:26:02,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2989 states and 8461 transitions. [2019-12-07 13:26:02,938 INFO L78 Accepts]: Start accepts. Automaton has 2989 states and 8461 transitions. Word has length 67 [2019-12-07 13:26:02,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:26:02,939 INFO L462 AbstractCegarLoop]: Abstraction has 2989 states and 8461 transitions. [2019-12-07 13:26:02,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:26:02,939 INFO L276 IsEmpty]: Start isEmpty. Operand 2989 states and 8461 transitions. [2019-12-07 13:26:02,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 13:26:02,942 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:26:02,942 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, 1, 1, 1, 1, 1] [2019-12-07 13:26:02,942 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:26:02,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:26:02,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1149441136, now seen corresponding path program 1 times [2019-12-07 13:26:02,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:26:02,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043198649] [2019-12-07 13:26:02,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:26:02,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:26:03,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:26:03,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043198649] [2019-12-07 13:26:03,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:26:03,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 13:26:03,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138069292] [2019-12-07 13:26:03,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 13:26:03,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:26:03,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 13:26:03,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-12-07 13:26:03,134 INFO L87 Difference]: Start difference. First operand 2989 states and 8461 transitions. Second operand 15 states. [2019-12-07 13:26:03,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:26:03,576 INFO L93 Difference]: Finished difference Result 5797 states and 16474 transitions. [2019-12-07 13:26:03,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 13:26:03,577 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 68 [2019-12-07 13:26:03,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:26:03,582 INFO L225 Difference]: With dead ends: 5797 [2019-12-07 13:26:03,583 INFO L226 Difference]: Without dead ends: 5765 [2019-12-07 13:26:03,583 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=735, Unknown=0, NotChecked=0, Total=930 [2019-12-07 13:26:03,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5765 states. [2019-12-07 13:26:03,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5765 to 4144. [2019-12-07 13:26:03,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4144 states. [2019-12-07 13:26:03,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 11624 transitions. [2019-12-07 13:26:03,645 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 11624 transitions. Word has length 68 [2019-12-07 13:26:03,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:26:03,645 INFO L462 AbstractCegarLoop]: Abstraction has 4144 states and 11624 transitions. [2019-12-07 13:26:03,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 13:26:03,646 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 11624 transitions. [2019-12-07 13:26:03,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 13:26:03,649 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:26:03,649 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, 1, 1, 1, 1, 1] [2019-12-07 13:26:03,650 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:26:03,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:26:03,650 INFO L82 PathProgramCache]: Analyzing trace with hash 15770806, now seen corresponding path program 2 times [2019-12-07 13:26:03,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:26:03,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795261875] [2019-12-07 13:26:03,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:26:03,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:26:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:26:03,728 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 13:26:03,728 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:26:03,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~y$mem_tmp~0_39 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 v_~y$r_buff0_thd3~0_110) (= v_~main$tmp_guard0~0_18 0) (= v_~weak$$choice2~0_126 0) (= 0 v_~x~0_147) (= v_~y$r_buff0_thd0~0_348 0) (= v_~y$read_delayed~0_7 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2180~0.base_27|)) (= v_~y$w_buff1~0_200 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2180~0.base_27|) (= 0 v_~y$w_buff0~0_179) (= (store .cse0 |v_ULTIMATE.start_main_~#t2180~0.base_27| 1) |v_#valid_63|) (= 0 |v_ULTIMATE.start_main_~#t2180~0.offset_20|) (= v_~y~0_170 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2180~0.base_27| 4)) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2180~0.base_27| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2180~0.base_27|) |v_ULTIMATE.start_main_~#t2180~0.offset_20| 0)) |v_#memory_int_21|) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$r_buff1_thd0~0_299 0) (= 0 v_~y$r_buff1_thd2~0_193) (= v_~y$r_buff0_thd1~0_223 0) (= 0 v_~__unbuffered_p2_EAX~0_33) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$flush_delayed~0_56) (= |v_#NULL.offset_5| 0) (= v_~y$w_buff1_used~0_482 0) (= 0 v_~y$r_buff1_thd3~0_211) (= 0 v_~y$r_buff0_thd2~0_114) (= v_~__unbuffered_cnt~0_132 0) (= v_~y$w_buff0_used~0_741 0) (= 0 v_~weak$$choice0~0_34) (= 0 |v_#NULL.base_5|) (= v_~y$r_buff1_thd1~0_185 0) (= v_~main$tmp_guard1~0_22 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_61|, ULTIMATE.start_main_~#t2182~0.base=|v_ULTIMATE.start_main_~#t2182~0.base_19|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_27|, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_27|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_45|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_141|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_41|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_76|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_62|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_36|, ~y$mem_tmp~0=v_~y$mem_tmp~0_39, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_211, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_223, ~y$flush_delayed~0=v_~y$flush_delayed~0_56, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ULTIMATE.start_main_~#t2180~0.offset=|v_ULTIMATE.start_main_~#t2180~0.offset_20|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_82|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_54|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_64|, ULTIMATE.start_main_~#t2181~0.base=|v_ULTIMATE.start_main_~#t2181~0.base_23|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_31|, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~y$w_buff1~0=v_~y$w_buff1~0_200, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_114, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_132, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_299, ~x~0=v_~x~0_147, ULTIMATE.start_main_~#t2182~0.offset=|v_ULTIMATE.start_main_~#t2182~0.offset_16|, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_61|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_741, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_73|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_31|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_27|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_161|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_30|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_76|, ULTIMATE.start_main_~#t2181~0.offset=|v_ULTIMATE.start_main_~#t2181~0.offset_18|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_185, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ~y$w_buff0~0=v_~y$w_buff0~0_179, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_110, ULTIMATE.start_main_~#t2180~0.base=|v_ULTIMATE.start_main_~#t2180~0.base_27|, ~y~0=v_~y~0_170, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_21|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_43|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_70|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_25|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_50|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_193, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_75|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_348, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_482} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_~#t2182~0.base, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2180~0.offset, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t2181~0.base, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t2182~0.offset, ULTIMATE.start_main_#t~nondet31, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t2181~0.offset, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite51, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t2180~0.base, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 13:26:03,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P0ENTRY-->L4-3: Formula: (and (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8 0)) (= v_~y$w_buff0_used~0_135 1) (= 2 v_~y$w_buff0~0_28) (= v_~y$w_buff0~0_29 v_~y$w_buff1~0_20) (= v_P0Thread1of1ForFork0_~arg.offset_6 |v_P0Thread1of1ForFork0_#in~arg.offset_8|) (= v_~y$w_buff1_used~0_63 v_~y$w_buff0_used~0_136) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_63 256) 0)) (not (= (mod v_~y$w_buff0_used~0_135 256) 0)))) 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= v_P0Thread1of1ForFork0_~arg.base_6 |v_P0Thread1of1ForFork0_#in~arg.base_8|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff0~0=v_~y$w_buff0~0_29, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_28, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_6, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_6, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_63} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 13:26:03,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L800-1-->L802: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2181~0.offset_10|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2181~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2181~0.base_11|) |v_ULTIMATE.start_main_~#t2181~0.offset_10| 1)) |v_#memory_int_11|) (not (= |v_ULTIMATE.start_main_~#t2181~0.base_11| 0)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2181~0.base_11| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2181~0.base_11|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t2181~0.base_11|)) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t2181~0.base_11| 1) |v_#valid_37|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2181~0.base=|v_ULTIMATE.start_main_~#t2181~0.base_11|, ULTIMATE.start_main_~#t2181~0.offset=|v_ULTIMATE.start_main_~#t2181~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2181~0.base, ULTIMATE.start_main_~#t2181~0.offset] because there is no mapped edge [2019-12-07 13:26:03,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L802-1-->L804: Formula: (and (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t2182~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t2182~0.offset_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2182~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2182~0.base_13|) |v_ULTIMATE.start_main_~#t2182~0.offset_11| 2)) |v_#memory_int_13|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2182~0.base_13| 4) |v_#length_17|) (= (select |v_#valid_40| |v_ULTIMATE.start_main_~#t2182~0.base_13|) 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2182~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t2182~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2182~0.base=|v_ULTIMATE.start_main_~#t2182~0.base_13|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2182~0.offset=|v_ULTIMATE.start_main_~#t2182~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2182~0.base, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2182~0.offset] because there is no mapped edge [2019-12-07 13:26:03,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L741-->L741-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In82620846 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In82620846 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out82620846| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out82620846| ~y$w_buff0_used~0_In82620846)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In82620846, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In82620846} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out82620846|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In82620846, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In82620846} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 13:26:03,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L757-2-->L757-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-764506060 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-764506060 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out-764506060| ~y~0_In-764506060)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out-764506060| ~y$w_buff1~0_In-764506060) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-764506060, ~y$w_buff1~0=~y$w_buff1~0_In-764506060, ~y~0=~y~0_In-764506060, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-764506060} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-764506060, ~y$w_buff1~0=~y$w_buff1~0_In-764506060, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-764506060|, ~y~0=~y~0_In-764506060, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-764506060} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-07 13:26:03,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd1~0_In-1408423343 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1408423343 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1408423343 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In-1408423343 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out-1408423343| ~y$w_buff1_used~0_In-1408423343)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1408423343| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1408423343, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1408423343, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1408423343, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1408423343} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1408423343|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1408423343, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1408423343, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1408423343, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1408423343} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 13:26:03,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L743-->L744: Formula: (let ((.cse1 (= ~y$r_buff0_thd1~0_Out372210973 ~y$r_buff0_thd1~0_In372210973)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In372210973 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In372210973 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (= ~y$r_buff0_thd1~0_Out372210973 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In372210973, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In372210973} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In372210973, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out372210973|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out372210973} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:26:03,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L744-->L744-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-805590635 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-805590635 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-805590635 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-805590635 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-805590635| 0)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-805590635| ~y$r_buff1_thd1~0_In-805590635) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-805590635, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-805590635, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-805590635, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-805590635} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-805590635, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-805590635, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-805590635|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-805590635, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-805590635} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 13:26:03,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L744-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~y$r_buff1_thd1~0_50 |v_P0Thread1of1ForFork0_#t~ite8_26|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_50, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 13:26:03,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L777-2-->L777-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1301354833 256))) (.cse0 (= (mod ~y$r_buff1_thd3~0_In1301354833 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite15_Out1301354833| ~y~0_In1301354833) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out1301354833| ~y$w_buff1~0_In1301354833)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1301354833, ~y$w_buff1~0=~y$w_buff1~0_In1301354833, ~y~0=~y~0_In1301354833, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1301354833} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1301354833, P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out1301354833|, ~y$w_buff1~0=~y$w_buff1~0_In1301354833, ~y~0=~y~0_In1301354833, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1301354833} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-07 13:26:03,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-4-->L778: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_6| v_~y~0_34) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_6|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_5|, ~y~0=v_~y~0_34, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~y~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-07 13:26:03,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L757-4-->L758: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_6| v_~y~0_38) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_6|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_5|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_5|, ~y~0=v_~y~0_38} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-07 13:26:03,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L758-->L758-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2036552914 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-2036552914 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out-2036552914| ~y$w_buff0_used~0_In-2036552914) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out-2036552914| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2036552914, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2036552914} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2036552914, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2036552914, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-2036552914|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 13:26:03,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L759-->L759-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1854838895 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In1854838895 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In1854838895 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1854838895 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out1854838895|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1854838895 |P1Thread1of1ForFork1_#t~ite12_Out1854838895|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1854838895, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1854838895, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1854838895, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1854838895} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1854838895, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1854838895, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1854838895, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1854838895|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1854838895} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 13:26:03,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L760-->L760-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In497075491 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In497075491 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out497075491| ~y$r_buff0_thd2~0_In497075491)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out497075491|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In497075491, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In497075491} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In497075491, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In497075491, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out497075491|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-07 13:26:03,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L761-->L761-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In347412408 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In347412408 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In347412408 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In347412408 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out347412408| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite14_Out347412408| ~y$r_buff1_thd2~0_In347412408)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In347412408, ~y$w_buff0_used~0=~y$w_buff0_used~0_In347412408, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In347412408, ~y$w_buff1_used~0=~y$w_buff1_used~0_In347412408} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In347412408, ~y$w_buff0_used~0=~y$w_buff0_used~0_In347412408, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In347412408, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out347412408|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In347412408} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 13:26:03,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-1223627905 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1223627905 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out-1223627905| ~y$w_buff0_used~0_In-1223627905)) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite17_Out-1223627905| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1223627905, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1223627905} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1223627905, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1223627905, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-1223627905|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 13:26:03,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L779-->L779-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-270388453 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-270388453 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In-270388453 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-270388453 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite18_Out-270388453| ~y$w_buff1_used~0_In-270388453) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork2_#t~ite18_Out-270388453| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-270388453, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-270388453, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-270388453, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-270388453} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-270388453, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-270388453, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-270388453, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-270388453|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-270388453} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-07 13:26:03,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L761-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~y$r_buff1_thd2~0_135 |v_P1Thread1of1ForFork1_#t~ite14_40|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_40|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_135, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_39|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 13:26:03,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-2067880151 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-2067880151 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite19_Out-2067880151| 0) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd3~0_In-2067880151 |P2Thread1of1ForFork2_#t~ite19_Out-2067880151|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2067880151, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2067880151} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2067880151, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2067880151, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-2067880151|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-07 13:26:03,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L781-->L781-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd3~0_In-120236232 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-120236232 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-120236232 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-120236232 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd3~0_In-120236232 |P2Thread1of1ForFork2_#t~ite20_Out-120236232|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork2_#t~ite20_Out-120236232|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-120236232, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-120236232, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-120236232, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-120236232} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-120236232, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-120236232, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-120236232|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-120236232, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-120236232} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-07 13:26:03,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L781-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite20_34| v_~y$r_buff1_thd3~0_132)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_132, P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_33|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite20, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 13:26:03,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L804-1-->L810: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 13:26:03,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L810-2-->L810-5: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In380081319 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In380081319 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite25_Out380081319| |ULTIMATE.start_main_#t~ite24_Out380081319|))) (or (and (not .cse0) (not .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite24_Out380081319| ~y$w_buff1~0_In380081319)) (and (= |ULTIMATE.start_main_#t~ite24_Out380081319| ~y~0_In380081319) (or .cse1 .cse0) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In380081319, ~y~0=~y~0_In380081319, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In380081319, ~y$w_buff1_used~0=~y$w_buff1_used~0_In380081319} OutVars{~y$w_buff1~0=~y$w_buff1~0_In380081319, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out380081319|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out380081319|, ~y~0=~y~0_In380081319, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In380081319, ~y$w_buff1_used~0=~y$w_buff1_used~0_In380081319} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-07 13:26:03,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1433425545 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1433425545 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite26_Out-1433425545| 0) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-1433425545 |ULTIMATE.start_main_#t~ite26_Out-1433425545|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1433425545, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1433425545} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1433425545, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1433425545, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1433425545|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-07 13:26:03,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1735473836 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1735473836 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In1735473836 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1735473836 256)))) (or (and (= |ULTIMATE.start_main_#t~ite27_Out1735473836| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite27_Out1735473836| ~y$w_buff1_used~0_In1735473836)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1735473836, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1735473836, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1735473836, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1735473836} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1735473836, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1735473836, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out1735473836|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1735473836, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1735473836} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-07 13:26:03,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1969937336 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1969937336 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite28_Out1969937336|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In1969937336 |ULTIMATE.start_main_#t~ite28_Out1969937336|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1969937336, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1969937336} OutVars{ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1969937336|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1969937336, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1969937336} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-07 13:26:03,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In315783400 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In315783400 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In315783400 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In315783400 256)))) (or (and (= |ULTIMATE.start_main_#t~ite29_Out315783400| ~y$r_buff1_thd0~0_In315783400) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite29_Out315783400| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In315783400, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In315783400, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In315783400, ~y$w_buff1_used~0=~y$w_buff1_used~0_In315783400} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In315783400, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out315783400|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In315783400, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In315783400, ~y$w_buff1_used~0=~y$w_buff1_used~0_In315783400} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-07 13:26:03,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L823-->L823-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In451553011 256)))) (or (and .cse0 (= ~y$w_buff1~0_In451553011 |ULTIMATE.start_main_#t~ite38_Out451553011|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In451553011 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In451553011 256))) (and (= (mod ~y$w_buff1_used~0_In451553011 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In451553011 256) 0))) (= |ULTIMATE.start_main_#t~ite39_Out451553011| |ULTIMATE.start_main_#t~ite38_Out451553011|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite38_In451553011| |ULTIMATE.start_main_#t~ite38_Out451553011|) (= ~y$w_buff1~0_In451553011 |ULTIMATE.start_main_#t~ite39_Out451553011|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In451553011, ~y$w_buff0_used~0=~y$w_buff0_used~0_In451553011, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In451553011, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In451553011|, ~weak$$choice2~0=~weak$$choice2~0_In451553011, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In451553011, ~y$w_buff1_used~0=~y$w_buff1_used~0_In451553011} OutVars{~y$w_buff1~0=~y$w_buff1~0_In451553011, ~y$w_buff0_used~0=~y$w_buff0_used~0_In451553011, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out451553011|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In451553011, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out451553011|, ~weak$$choice2~0=~weak$$choice2~0_In451553011, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In451553011, ~y$w_buff1_used~0=~y$w_buff1_used~0_In451553011} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 13:26:03,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [809] [809] L824-->L824-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1827442122 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite41_In1827442122| |ULTIMATE.start_main_#t~ite41_Out1827442122|) (= ~y$w_buff0_used~0_In1827442122 |ULTIMATE.start_main_#t~ite42_Out1827442122|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1827442122 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In1827442122 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In1827442122 256) 0)) (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1827442122 256))))) .cse0 (= |ULTIMATE.start_main_#t~ite41_Out1827442122| ~y$w_buff0_used~0_In1827442122) (= |ULTIMATE.start_main_#t~ite41_Out1827442122| |ULTIMATE.start_main_#t~ite42_Out1827442122|)))) InVars {ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_In1827442122|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1827442122, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1827442122, ~weak$$choice2~0=~weak$$choice2~0_In1827442122, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1827442122, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1827442122} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1827442122|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1827442122, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1827442122, ~weak$$choice2~0=~weak$$choice2~0_In1827442122, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1827442122|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1827442122, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1827442122} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 13:26:03,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L826-->L827: Formula: (and (= v_~y$r_buff0_thd0~0_133 v_~y$r_buff0_thd0~0_132) (not (= 0 (mod v_~weak$$choice2~0_33 256)))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_133, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_132, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_22|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_13|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_33} AuxVars[] AssignedVars[~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 13:26:03,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L829-->L832-1: Formula: (and (not (= (mod v_~y$flush_delayed~0_45 256) 0)) (= 0 v_~y$flush_delayed~0_44) (= v_~y~0_135 v_~y$mem_tmp~0_33) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_33, ~y$flush_delayed~0=v_~y$flush_delayed~0_45, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~y$mem_tmp~0=v_~y$mem_tmp~0_33, ~y$flush_delayed~0=v_~y$flush_delayed~0_44, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y~0=v_~y~0_135, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:26:03,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L832-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 13:26:03,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:26:03 BasicIcfg [2019-12-07 13:26:03,796 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:26:03,797 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:26:03,797 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:26:03,797 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:26:03,797 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:25:21" (3/4) ... [2019-12-07 13:26:03,799 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 13:26:03,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~y$mem_tmp~0_39 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 v_~y$r_buff0_thd3~0_110) (= v_~main$tmp_guard0~0_18 0) (= v_~weak$$choice2~0_126 0) (= 0 v_~x~0_147) (= v_~y$r_buff0_thd0~0_348 0) (= v_~y$read_delayed~0_7 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2180~0.base_27|)) (= v_~y$w_buff1~0_200 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2180~0.base_27|) (= 0 v_~y$w_buff0~0_179) (= (store .cse0 |v_ULTIMATE.start_main_~#t2180~0.base_27| 1) |v_#valid_63|) (= 0 |v_ULTIMATE.start_main_~#t2180~0.offset_20|) (= v_~y~0_170 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2180~0.base_27| 4)) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2180~0.base_27| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2180~0.base_27|) |v_ULTIMATE.start_main_~#t2180~0.offset_20| 0)) |v_#memory_int_21|) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$r_buff1_thd0~0_299 0) (= 0 v_~y$r_buff1_thd2~0_193) (= v_~y$r_buff0_thd1~0_223 0) (= 0 v_~__unbuffered_p2_EAX~0_33) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$flush_delayed~0_56) (= |v_#NULL.offset_5| 0) (= v_~y$w_buff1_used~0_482 0) (= 0 v_~y$r_buff1_thd3~0_211) (= 0 v_~y$r_buff0_thd2~0_114) (= v_~__unbuffered_cnt~0_132 0) (= v_~y$w_buff0_used~0_741 0) (= 0 v_~weak$$choice0~0_34) (= 0 |v_#NULL.base_5|) (= v_~y$r_buff1_thd1~0_185 0) (= v_~main$tmp_guard1~0_22 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_61|, ULTIMATE.start_main_~#t2182~0.base=|v_ULTIMATE.start_main_~#t2182~0.base_19|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_27|, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_27|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_45|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_141|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_41|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_76|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_62|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_36|, ~y$mem_tmp~0=v_~y$mem_tmp~0_39, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_211, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_223, ~y$flush_delayed~0=v_~y$flush_delayed~0_56, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ULTIMATE.start_main_~#t2180~0.offset=|v_ULTIMATE.start_main_~#t2180~0.offset_20|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_82|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_54|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_64|, ULTIMATE.start_main_~#t2181~0.base=|v_ULTIMATE.start_main_~#t2181~0.base_23|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_31|, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~y$w_buff1~0=v_~y$w_buff1~0_200, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_114, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_132, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_299, ~x~0=v_~x~0_147, ULTIMATE.start_main_~#t2182~0.offset=|v_ULTIMATE.start_main_~#t2182~0.offset_16|, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_61|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_741, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_73|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_31|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_27|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_161|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_30|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_76|, ULTIMATE.start_main_~#t2181~0.offset=|v_ULTIMATE.start_main_~#t2181~0.offset_18|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_185, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ~y$w_buff0~0=v_~y$w_buff0~0_179, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_110, ULTIMATE.start_main_~#t2180~0.base=|v_ULTIMATE.start_main_~#t2180~0.base_27|, ~y~0=v_~y~0_170, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_21|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_43|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_70|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_25|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_50|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_193, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_75|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_348, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_482} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_~#t2182~0.base, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2180~0.offset, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t2181~0.base, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t2182~0.offset, ULTIMATE.start_main_#t~nondet31, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t2181~0.offset, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite51, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t2180~0.base, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 13:26:03,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P0ENTRY-->L4-3: Formula: (and (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8 0)) (= v_~y$w_buff0_used~0_135 1) (= 2 v_~y$w_buff0~0_28) (= v_~y$w_buff0~0_29 v_~y$w_buff1~0_20) (= v_P0Thread1of1ForFork0_~arg.offset_6 |v_P0Thread1of1ForFork0_#in~arg.offset_8|) (= v_~y$w_buff1_used~0_63 v_~y$w_buff0_used~0_136) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_63 256) 0)) (not (= (mod v_~y$w_buff0_used~0_135 256) 0)))) 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= v_P0Thread1of1ForFork0_~arg.base_6 |v_P0Thread1of1ForFork0_#in~arg.base_8|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff0~0=v_~y$w_buff0~0_29, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_28, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_6, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_6, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_63} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 13:26:03,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L800-1-->L802: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2181~0.offset_10|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2181~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2181~0.base_11|) |v_ULTIMATE.start_main_~#t2181~0.offset_10| 1)) |v_#memory_int_11|) (not (= |v_ULTIMATE.start_main_~#t2181~0.base_11| 0)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2181~0.base_11| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2181~0.base_11|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t2181~0.base_11|)) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t2181~0.base_11| 1) |v_#valid_37|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2181~0.base=|v_ULTIMATE.start_main_~#t2181~0.base_11|, ULTIMATE.start_main_~#t2181~0.offset=|v_ULTIMATE.start_main_~#t2181~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2181~0.base, ULTIMATE.start_main_~#t2181~0.offset] because there is no mapped edge [2019-12-07 13:26:03,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L802-1-->L804: Formula: (and (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t2182~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t2182~0.offset_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2182~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2182~0.base_13|) |v_ULTIMATE.start_main_~#t2182~0.offset_11| 2)) |v_#memory_int_13|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2182~0.base_13| 4) |v_#length_17|) (= (select |v_#valid_40| |v_ULTIMATE.start_main_~#t2182~0.base_13|) 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2182~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t2182~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2182~0.base=|v_ULTIMATE.start_main_~#t2182~0.base_13|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2182~0.offset=|v_ULTIMATE.start_main_~#t2182~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2182~0.base, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2182~0.offset] because there is no mapped edge [2019-12-07 13:26:03,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L741-->L741-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In82620846 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In82620846 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out82620846| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out82620846| ~y$w_buff0_used~0_In82620846)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In82620846, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In82620846} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out82620846|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In82620846, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In82620846} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 13:26:03,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L757-2-->L757-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-764506060 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-764506060 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out-764506060| ~y~0_In-764506060)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out-764506060| ~y$w_buff1~0_In-764506060) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-764506060, ~y$w_buff1~0=~y$w_buff1~0_In-764506060, ~y~0=~y~0_In-764506060, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-764506060} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-764506060, ~y$w_buff1~0=~y$w_buff1~0_In-764506060, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-764506060|, ~y~0=~y~0_In-764506060, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-764506060} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-07 13:26:03,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd1~0_In-1408423343 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1408423343 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1408423343 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In-1408423343 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out-1408423343| ~y$w_buff1_used~0_In-1408423343)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1408423343| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1408423343, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1408423343, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1408423343, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1408423343} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1408423343|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1408423343, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1408423343, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1408423343, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1408423343} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 13:26:03,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L743-->L744: Formula: (let ((.cse1 (= ~y$r_buff0_thd1~0_Out372210973 ~y$r_buff0_thd1~0_In372210973)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In372210973 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In372210973 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (= ~y$r_buff0_thd1~0_Out372210973 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In372210973, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In372210973} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In372210973, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out372210973|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out372210973} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:26:03,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L744-->L744-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-805590635 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-805590635 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-805590635 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-805590635 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-805590635| 0)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-805590635| ~y$r_buff1_thd1~0_In-805590635) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-805590635, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-805590635, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-805590635, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-805590635} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-805590635, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-805590635, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-805590635|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-805590635, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-805590635} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 13:26:03,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L744-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~y$r_buff1_thd1~0_50 |v_P0Thread1of1ForFork0_#t~ite8_26|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_50, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 13:26:03,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L777-2-->L777-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1301354833 256))) (.cse0 (= (mod ~y$r_buff1_thd3~0_In1301354833 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite15_Out1301354833| ~y~0_In1301354833) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out1301354833| ~y$w_buff1~0_In1301354833)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1301354833, ~y$w_buff1~0=~y$w_buff1~0_In1301354833, ~y~0=~y~0_In1301354833, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1301354833} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1301354833, P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out1301354833|, ~y$w_buff1~0=~y$w_buff1~0_In1301354833, ~y~0=~y~0_In1301354833, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1301354833} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-07 13:26:03,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-4-->L778: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_6| v_~y~0_34) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_6|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_5|, ~y~0=v_~y~0_34, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~y~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-07 13:26:03,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L757-4-->L758: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_6| v_~y~0_38) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_6|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_5|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_5|, ~y~0=v_~y~0_38} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-07 13:26:03,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L758-->L758-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2036552914 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-2036552914 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out-2036552914| ~y$w_buff0_used~0_In-2036552914) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out-2036552914| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2036552914, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2036552914} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2036552914, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2036552914, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-2036552914|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 13:26:03,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L759-->L759-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1854838895 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In1854838895 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In1854838895 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1854838895 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out1854838895|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1854838895 |P1Thread1of1ForFork1_#t~ite12_Out1854838895|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1854838895, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1854838895, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1854838895, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1854838895} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1854838895, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1854838895, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1854838895, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1854838895|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1854838895} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 13:26:03,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L760-->L760-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In497075491 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In497075491 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out497075491| ~y$r_buff0_thd2~0_In497075491)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out497075491|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In497075491, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In497075491} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In497075491, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In497075491, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out497075491|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-07 13:26:03,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L761-->L761-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In347412408 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In347412408 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In347412408 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In347412408 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out347412408| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite14_Out347412408| ~y$r_buff1_thd2~0_In347412408)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In347412408, ~y$w_buff0_used~0=~y$w_buff0_used~0_In347412408, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In347412408, ~y$w_buff1_used~0=~y$w_buff1_used~0_In347412408} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In347412408, ~y$w_buff0_used~0=~y$w_buff0_used~0_In347412408, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In347412408, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out347412408|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In347412408} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 13:26:03,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-1223627905 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1223627905 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out-1223627905| ~y$w_buff0_used~0_In-1223627905)) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite17_Out-1223627905| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1223627905, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1223627905} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1223627905, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1223627905, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-1223627905|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 13:26:03,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L779-->L779-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-270388453 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-270388453 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In-270388453 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-270388453 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite18_Out-270388453| ~y$w_buff1_used~0_In-270388453) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork2_#t~ite18_Out-270388453| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-270388453, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-270388453, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-270388453, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-270388453} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-270388453, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-270388453, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-270388453, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-270388453|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-270388453} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-07 13:26:03,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L761-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~y$r_buff1_thd2~0_135 |v_P1Thread1of1ForFork1_#t~ite14_40|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_40|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_135, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_39|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 13:26:03,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-2067880151 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-2067880151 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite19_Out-2067880151| 0) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd3~0_In-2067880151 |P2Thread1of1ForFork2_#t~ite19_Out-2067880151|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2067880151, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2067880151} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2067880151, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2067880151, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-2067880151|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-07 13:26:03,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L781-->L781-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd3~0_In-120236232 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-120236232 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-120236232 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-120236232 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd3~0_In-120236232 |P2Thread1of1ForFork2_#t~ite20_Out-120236232|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork2_#t~ite20_Out-120236232|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-120236232, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-120236232, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-120236232, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-120236232} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-120236232, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-120236232, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-120236232|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-120236232, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-120236232} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-07 13:26:03,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L781-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite20_34| v_~y$r_buff1_thd3~0_132)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_132, P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_33|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite20, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 13:26:03,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L804-1-->L810: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 13:26:03,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L810-2-->L810-5: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In380081319 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In380081319 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite25_Out380081319| |ULTIMATE.start_main_#t~ite24_Out380081319|))) (or (and (not .cse0) (not .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite24_Out380081319| ~y$w_buff1~0_In380081319)) (and (= |ULTIMATE.start_main_#t~ite24_Out380081319| ~y~0_In380081319) (or .cse1 .cse0) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In380081319, ~y~0=~y~0_In380081319, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In380081319, ~y$w_buff1_used~0=~y$w_buff1_used~0_In380081319} OutVars{~y$w_buff1~0=~y$w_buff1~0_In380081319, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out380081319|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out380081319|, ~y~0=~y~0_In380081319, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In380081319, ~y$w_buff1_used~0=~y$w_buff1_used~0_In380081319} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-07 13:26:03,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1433425545 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1433425545 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite26_Out-1433425545| 0) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-1433425545 |ULTIMATE.start_main_#t~ite26_Out-1433425545|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1433425545, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1433425545} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1433425545, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1433425545, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1433425545|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-07 13:26:03,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1735473836 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1735473836 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In1735473836 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1735473836 256)))) (or (and (= |ULTIMATE.start_main_#t~ite27_Out1735473836| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite27_Out1735473836| ~y$w_buff1_used~0_In1735473836)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1735473836, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1735473836, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1735473836, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1735473836} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1735473836, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1735473836, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out1735473836|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1735473836, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1735473836} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-07 13:26:03,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1969937336 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1969937336 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite28_Out1969937336|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In1969937336 |ULTIMATE.start_main_#t~ite28_Out1969937336|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1969937336, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1969937336} OutVars{ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1969937336|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1969937336, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1969937336} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-07 13:26:03,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In315783400 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In315783400 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In315783400 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In315783400 256)))) (or (and (= |ULTIMATE.start_main_#t~ite29_Out315783400| ~y$r_buff1_thd0~0_In315783400) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite29_Out315783400| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In315783400, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In315783400, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In315783400, ~y$w_buff1_used~0=~y$w_buff1_used~0_In315783400} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In315783400, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out315783400|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In315783400, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In315783400, ~y$w_buff1_used~0=~y$w_buff1_used~0_In315783400} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-07 13:26:03,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L823-->L823-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In451553011 256)))) (or (and .cse0 (= ~y$w_buff1~0_In451553011 |ULTIMATE.start_main_#t~ite38_Out451553011|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In451553011 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In451553011 256))) (and (= (mod ~y$w_buff1_used~0_In451553011 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In451553011 256) 0))) (= |ULTIMATE.start_main_#t~ite39_Out451553011| |ULTIMATE.start_main_#t~ite38_Out451553011|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite38_In451553011| |ULTIMATE.start_main_#t~ite38_Out451553011|) (= ~y$w_buff1~0_In451553011 |ULTIMATE.start_main_#t~ite39_Out451553011|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In451553011, ~y$w_buff0_used~0=~y$w_buff0_used~0_In451553011, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In451553011, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In451553011|, ~weak$$choice2~0=~weak$$choice2~0_In451553011, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In451553011, ~y$w_buff1_used~0=~y$w_buff1_used~0_In451553011} OutVars{~y$w_buff1~0=~y$w_buff1~0_In451553011, ~y$w_buff0_used~0=~y$w_buff0_used~0_In451553011, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out451553011|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In451553011, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out451553011|, ~weak$$choice2~0=~weak$$choice2~0_In451553011, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In451553011, ~y$w_buff1_used~0=~y$w_buff1_used~0_In451553011} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 13:26:03,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [809] [809] L824-->L824-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1827442122 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite41_In1827442122| |ULTIMATE.start_main_#t~ite41_Out1827442122|) (= ~y$w_buff0_used~0_In1827442122 |ULTIMATE.start_main_#t~ite42_Out1827442122|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1827442122 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In1827442122 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In1827442122 256) 0)) (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1827442122 256))))) .cse0 (= |ULTIMATE.start_main_#t~ite41_Out1827442122| ~y$w_buff0_used~0_In1827442122) (= |ULTIMATE.start_main_#t~ite41_Out1827442122| |ULTIMATE.start_main_#t~ite42_Out1827442122|)))) InVars {ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_In1827442122|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1827442122, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1827442122, ~weak$$choice2~0=~weak$$choice2~0_In1827442122, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1827442122, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1827442122} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1827442122|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1827442122, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1827442122, ~weak$$choice2~0=~weak$$choice2~0_In1827442122, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1827442122|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1827442122, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1827442122} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 13:26:03,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L826-->L827: Formula: (and (= v_~y$r_buff0_thd0~0_133 v_~y$r_buff0_thd0~0_132) (not (= 0 (mod v_~weak$$choice2~0_33 256)))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_133, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_132, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_22|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_13|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_33} AuxVars[] AssignedVars[~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 13:26:03,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L829-->L832-1: Formula: (and (not (= (mod v_~y$flush_delayed~0_45 256) 0)) (= 0 v_~y$flush_delayed~0_44) (= v_~y~0_135 v_~y$mem_tmp~0_33) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_33, ~y$flush_delayed~0=v_~y$flush_delayed~0_45, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~y$mem_tmp~0=v_~y$mem_tmp~0_33, ~y$flush_delayed~0=v_~y$flush_delayed~0_44, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y~0=v_~y~0_135, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:26:03,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L832-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 13:26:03,862 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9529f26a-4db6-4c77-919a-b293003354e8/bin/utaipan/witness.graphml [2019-12-07 13:26:03,862 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:26:03,863 INFO L168 Benchmark]: Toolchain (without parser) took 42782.29 ms. Allocated memory was 1.0 GB in the beginning and 4.8 GB in the end (delta: 3.8 GB). Free memory was 935.5 MB in the beginning and 3.3 GB in the end (delta: -2.4 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-12-07 13:26:03,863 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:26:03,864 INFO L168 Benchmark]: CACSL2BoogieTranslator took 404.79 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.8 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -124.0 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 13:26:03,864 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:26:03,864 INFO L168 Benchmark]: Boogie Preprocessor took 24.96 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:26:03,864 INFO L168 Benchmark]: RCFGBuilder took 415.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 997.8 MB in the end (delta: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 11.5 GB. [2019-12-07 13:26:03,865 INFO L168 Benchmark]: TraceAbstraction took 41829.46 ms. Allocated memory was 1.1 GB in the beginning and 4.8 GB in the end (delta: 3.7 GB). Free memory was 997.8 MB in the beginning and 3.4 GB in the end (delta: -2.4 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-12-07 13:26:03,865 INFO L168 Benchmark]: Witness Printer took 65.74 ms. Allocated memory is still 4.8 GB. Free memory was 3.4 GB in the beginning and 3.3 GB in the end (delta: 59.4 MB). Peak memory consumption was 59.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:26:03,866 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 404.79 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.8 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -124.0 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.96 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 415.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 997.8 MB in the end (delta: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 41829.46 ms. Allocated memory was 1.1 GB in the beginning and 4.8 GB in the end (delta: 3.7 GB). Free memory was 997.8 MB in the beginning and 3.4 GB in the end (delta: -2.4 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 65.74 ms. Allocated memory is still 4.8 GB. Free memory was 3.4 GB in the beginning and 3.3 GB in the end (delta: 59.4 MB). Peak memory consumption was 59.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.0s, 173 ProgramPointsBefore, 94 ProgramPointsAfterwards, 210 TransitionsBefore, 104 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 39 ConcurrentYvCompositions, 31 ChoiceCompositions, 5882 VarBasedMoverChecksPositive, 246 VarBasedMoverChecksNegative, 66 SemBasedMoverChecksPositive, 253 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.7s, 0 MoverChecksTotal, 78185 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t2180, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L730] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L731] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L732] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L733] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L734] 1 y$r_buff0_thd1 = (_Bool)1 [L737] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L802] FCALL, FORK 0 pthread_create(&t2181, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L804] FCALL, FORK 0 pthread_create(&t2182, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L771] 3 __unbuffered_p2_EAX = x [L774] 3 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L777] 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L758] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L759] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L760] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L778] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L780] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L810] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 0 y$flush_delayed = weak$$choice2 [L820] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L825] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L827] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 164 locations, 2 error locations. Result: UNSAFE, OverallTime: 41.6s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2413 SDtfs, 2259 SDslu, 4716 SDs, 0 SdLazy, 3202 SolverSat, 135 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 25 SyntacticMatches, 12 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156321occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 52053 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 784 NumberOfCodeBlocks, 784 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 700 ConstructedInterpolants, 0 QuantifiedInterpolants, 153790 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...