./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix001_rmo.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_f0e34b8d-9436-44d2-ac35-127efbbb9bfe/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f0e34b8d-9436-44d2-ac35-127efbbb9bfe/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f0e34b8d-9436-44d2-ac35-127efbbb9bfe/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f0e34b8d-9436-44d2-ac35-127efbbb9bfe/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix001_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_f0e34b8d-9436-44d2-ac35-127efbbb9bfe/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f0e34b8d-9436-44d2-ac35-127efbbb9bfe/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 4c5f679b7e8fc4c8a3eee2d19582cfef2a8ce3cf ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 20:47:55,371 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:47:55,372 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:47:55,380 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:47:55,380 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:47:55,381 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:47:55,382 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:47:55,383 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:47:55,385 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:47:55,385 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:47:55,386 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:47:55,387 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:47:55,387 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:47:55,388 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:47:55,388 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:47:55,389 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:47:55,390 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:47:55,391 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:47:55,392 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:47:55,393 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:47:55,394 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:47:55,395 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:47:55,396 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:47:55,397 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:47:55,398 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:47:55,399 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:47:55,399 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:47:55,399 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:47:55,400 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:47:55,400 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:47:55,400 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:47:55,401 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:47:55,401 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:47:55,402 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:47:55,402 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:47:55,403 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:47:55,403 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:47:55,403 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:47:55,403 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:47:55,404 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:47:55,404 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:47:55,405 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f0e34b8d-9436-44d2-ac35-127efbbb9bfe/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 20:47:55,414 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:47:55,415 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:47:55,415 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:47:55,415 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:47:55,415 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:47:55,415 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:47:55,416 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 20:47:55,416 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:47:55,416 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:47:55,416 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 20:47:55,416 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 20:47:55,416 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:47:55,416 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 20:47:55,416 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 20:47:55,417 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 20:47:55,417 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:47:55,417 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:47:55,417 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:47:55,418 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:47:55,418 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:47:55,418 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 20:47:55,418 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:47:55,418 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 20:47:55,418 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:47:55,418 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:47:55,419 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 20:47:55,419 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:47:55,419 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 20:47:55,419 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:47:55,419 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:47:55,419 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:47:55,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:47:55,420 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:47:55,420 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:47:55,420 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 20:47:55,420 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 20:47:55,420 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 20:47:55,420 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 20:47:55,420 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:47:55,421 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:47:55,421 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_f0e34b8d-9436-44d2-ac35-127efbbb9bfe/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 -> 4c5f679b7e8fc4c8a3eee2d19582cfef2a8ce3cf [2019-12-07 20:47:55,523 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:47:55,533 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:47:55,536 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:47:55,537 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:47:55,537 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:47:55,538 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f0e34b8d-9436-44d2-ac35-127efbbb9bfe/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix001_rmo.opt.i [2019-12-07 20:47:55,587 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f0e34b8d-9436-44d2-ac35-127efbbb9bfe/bin/utaipan/data/89cfa998c/98a517ff81c24f4699b8be142b7916ce/FLAG6de280a6c [2019-12-07 20:47:56,027 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:47:56,028 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f0e34b8d-9436-44d2-ac35-127efbbb9bfe/sv-benchmarks/c/pthread-wmm/mix001_rmo.opt.i [2019-12-07 20:47:56,041 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f0e34b8d-9436-44d2-ac35-127efbbb9bfe/bin/utaipan/data/89cfa998c/98a517ff81c24f4699b8be142b7916ce/FLAG6de280a6c [2019-12-07 20:47:56,363 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f0e34b8d-9436-44d2-ac35-127efbbb9bfe/bin/utaipan/data/89cfa998c/98a517ff81c24f4699b8be142b7916ce [2019-12-07 20:47:56,367 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:47:56,367 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:47:56,368 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:47:56,368 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:47:56,371 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:47:56,372 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:47:56" (1/1) ... [2019-12-07 20:47:56,374 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eea8eb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:47:56, skipping insertion in model container [2019-12-07 20:47:56,374 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:47:56" (1/1) ... [2019-12-07 20:47:56,381 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:47:56,419 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:47:56,674 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:47:56,683 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:47:56,731 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:47:56,776 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:47:56,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:47:56 WrapperNode [2019-12-07 20:47:56,777 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:47:56,777 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:47:56,777 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:47:56,777 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:47:56,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:47:56" (1/1) ... [2019-12-07 20:47:56,797 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:47:56" (1/1) ... [2019-12-07 20:47:56,818 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:47:56,819 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:47:56,819 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:47:56,819 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:47:56,825 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:47:56" (1/1) ... [2019-12-07 20:47:56,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:47:56" (1/1) ... [2019-12-07 20:47:56,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:47:56" (1/1) ... [2019-12-07 20:47:56,830 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:47:56" (1/1) ... [2019-12-07 20:47:56,838 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:47:56" (1/1) ... [2019-12-07 20:47:56,841 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:47:56" (1/1) ... [2019-12-07 20:47:56,844 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:47:56" (1/1) ... [2019-12-07 20:47:56,847 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:47:56,847 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:47:56,847 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:47:56,847 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:47:56,848 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:47:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f0e34b8d-9436-44d2-ac35-127efbbb9bfe/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 20:47:56,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 20:47:56,888 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 20:47:56,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 20:47:56,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 20:47:56,888 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 20:47:56,888 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 20:47:56,888 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 20:47:56,888 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 20:47:56,888 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 20:47:56,889 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 20:47:56,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 20:47:56,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:47:56,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:47:56,890 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 20:47:57,282 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:47:57,283 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 20:47:57,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:47:57 BoogieIcfgContainer [2019-12-07 20:47:57,284 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:47:57,284 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:47:57,284 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:47:57,286 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:47:57,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:47:56" (1/3) ... [2019-12-07 20:47:57,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4213c7c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:47:57, skipping insertion in model container [2019-12-07 20:47:57,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:47:56" (2/3) ... [2019-12-07 20:47:57,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4213c7c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:47:57, skipping insertion in model container [2019-12-07 20:47:57,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:47:57" (3/3) ... [2019-12-07 20:47:57,288 INFO L109 eAbstractionObserver]: Analyzing ICFG mix001_rmo.opt.i [2019-12-07 20:47:57,295 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 20:47:57,295 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:47:57,300 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 20:47:57,301 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 20:47:57,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,334 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,334 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,336 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,336 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,350 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,350 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,351 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,351 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,351 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:57,379 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 20:47:57,395 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:47:57,395 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 20:47:57,395 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:47:57,395 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:47:57,395 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:47:57,396 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:47:57,396 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:47:57,396 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:47:57,406 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 243 transitions [2019-12-07 20:47:57,408 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-07 20:47:57,472 INFO L134 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-07 20:47:57,472 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 20:47:57,483 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 910 event pairs. 9/191 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 20:47:57,504 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-07 20:47:57,543 INFO L134 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-07 20:47:57,543 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 20:47:57,551 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 910 event pairs. 9/191 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 20:47:57,575 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-07 20:47:57,575 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 20:48:00,983 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-12-07 20:48:01,284 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-07 20:48:01,399 INFO L206 etLargeBlockEncoding]: Checked pairs total: 124432 [2019-12-07 20:48:01,400 INFO L214 etLargeBlockEncoding]: Total number of compositions: 127 [2019-12-07 20:48:01,402 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 108 places, 130 transitions [2019-12-07 20:48:04,187 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44886 states. [2019-12-07 20:48:04,189 INFO L276 IsEmpty]: Start isEmpty. Operand 44886 states. [2019-12-07 20:48:04,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 20:48:04,195 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:48:04,195 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:48:04,195 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:48:04,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:48:04,199 INFO L82 PathProgramCache]: Analyzing trace with hash -614729650, now seen corresponding path program 1 times [2019-12-07 20:48:04,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:48:04,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225135860] [2019-12-07 20:48:04,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:48:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:48:04,357 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 20:48:04,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225135860] [2019-12-07 20:48:04,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:48:04,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 20:48:04,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52872073] [2019-12-07 20:48:04,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:48:04,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:48:04,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:48:04,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:48:04,372 INFO L87 Difference]: Start difference. First operand 44886 states. Second operand 3 states. [2019-12-07 20:48:04,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:48:04,770 INFO L93 Difference]: Finished difference Result 44562 states and 182514 transitions. [2019-12-07 20:48:04,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:48:04,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 20:48:04,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:48:05,019 INFO L225 Difference]: With dead ends: 44562 [2019-12-07 20:48:05,020 INFO L226 Difference]: Without dead ends: 41502 [2019-12-07 20:48:05,020 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:48:05,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41502 states. [2019-12-07 20:48:06,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41502 to 41502. [2019-12-07 20:48:06,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41502 states. [2019-12-07 20:48:06,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41502 states to 41502 states and 169862 transitions. [2019-12-07 20:48:06,450 INFO L78 Accepts]: Start accepts. Automaton has 41502 states and 169862 transitions. Word has length 7 [2019-12-07 20:48:06,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:48:06,451 INFO L462 AbstractCegarLoop]: Abstraction has 41502 states and 169862 transitions. [2019-12-07 20:48:06,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:48:06,451 INFO L276 IsEmpty]: Start isEmpty. Operand 41502 states and 169862 transitions. [2019-12-07 20:48:06,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 20:48:06,455 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:48:06,455 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:48:06,455 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:48:06,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:48:06,456 INFO L82 PathProgramCache]: Analyzing trace with hash 652997656, now seen corresponding path program 1 times [2019-12-07 20:48:06,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:48:06,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507026506] [2019-12-07 20:48:06,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:48:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:48:06,511 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 20:48:06,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507026506] [2019-12-07 20:48:06,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:48:06,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:48:06,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254600580] [2019-12-07 20:48:06,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:48:06,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:48:06,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:48:06,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:48:06,514 INFO L87 Difference]: Start difference. First operand 41502 states and 169862 transitions. Second operand 4 states. [2019-12-07 20:48:07,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:48:07,174 INFO L93 Difference]: Finished difference Result 66122 states and 260012 transitions. [2019-12-07 20:48:07,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:48:07,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 20:48:07,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:48:07,457 INFO L225 Difference]: With dead ends: 66122 [2019-12-07 20:48:07,457 INFO L226 Difference]: Without dead ends: 66092 [2019-12-07 20:48:07,458 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 20:48:08,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66092 states. [2019-12-07 20:48:09,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66092 to 64446. [2019-12-07 20:48:09,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64446 states. [2019-12-07 20:48:09,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64446 states to 64446 states and 254822 transitions. [2019-12-07 20:48:09,173 INFO L78 Accepts]: Start accepts. Automaton has 64446 states and 254822 transitions. Word has length 13 [2019-12-07 20:48:09,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:48:09,173 INFO L462 AbstractCegarLoop]: Abstraction has 64446 states and 254822 transitions. [2019-12-07 20:48:09,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:48:09,173 INFO L276 IsEmpty]: Start isEmpty. Operand 64446 states and 254822 transitions. [2019-12-07 20:48:09,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 20:48:09,179 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:48:09,179 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:48:09,179 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:48:09,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:48:09,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1079576864, now seen corresponding path program 1 times [2019-12-07 20:48:09,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:48:09,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890115648] [2019-12-07 20:48:09,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:48:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:48:09,241 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 20:48:09,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890115648] [2019-12-07 20:48:09,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:48:09,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:48:09,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579226827] [2019-12-07 20:48:09,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:48:09,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:48:09,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:48:09,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:48:09,242 INFO L87 Difference]: Start difference. First operand 64446 states and 254822 transitions. Second operand 4 states. [2019-12-07 20:48:09,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:48:09,884 INFO L93 Difference]: Finished difference Result 82254 states and 320688 transitions. [2019-12-07 20:48:09,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:48:09,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 20:48:09,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:48:10,070 INFO L225 Difference]: With dead ends: 82254 [2019-12-07 20:48:10,070 INFO L226 Difference]: Without dead ends: 82226 [2019-12-07 20:48:10,070 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 20:48:10,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82226 states. [2019-12-07 20:48:12,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82226 to 73414. [2019-12-07 20:48:12,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73414 states. [2019-12-07 20:48:13,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73414 states to 73414 states and 288912 transitions. [2019-12-07 20:48:13,005 INFO L78 Accepts]: Start accepts. Automaton has 73414 states and 288912 transitions. Word has length 16 [2019-12-07 20:48:13,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:48:13,005 INFO L462 AbstractCegarLoop]: Abstraction has 73414 states and 288912 transitions. [2019-12-07 20:48:13,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:48:13,005 INFO L276 IsEmpty]: Start isEmpty. Operand 73414 states and 288912 transitions. [2019-12-07 20:48:13,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 20:48:13,012 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:48:13,012 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:48:13,012 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:48:13,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:48:13,012 INFO L82 PathProgramCache]: Analyzing trace with hash -624278653, now seen corresponding path program 1 times [2019-12-07 20:48:13,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:48:13,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27740853] [2019-12-07 20:48:13,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:48:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:48:13,075 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 20:48:13,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27740853] [2019-12-07 20:48:13,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:48:13,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 20:48:13,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742789932] [2019-12-07 20:48:13,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:48:13,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:48:13,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:48:13,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:48:13,076 INFO L87 Difference]: Start difference. First operand 73414 states and 288912 transitions. Second operand 3 states. [2019-12-07 20:48:13,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:48:13,369 INFO L93 Difference]: Finished difference Result 73434 states and 288812 transitions. [2019-12-07 20:48:13,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:48:13,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 20:48:13,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:48:13,532 INFO L225 Difference]: With dead ends: 73434 [2019-12-07 20:48:13,532 INFO L226 Difference]: Without dead ends: 73434 [2019-12-07 20:48:13,532 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 20:48:14,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73434 states. [2019-12-07 20:48:15,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73434 to 73349. [2019-12-07 20:48:15,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73349 states. [2019-12-07 20:48:15,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73349 states to 73349 states and 288633 transitions. [2019-12-07 20:48:15,329 INFO L78 Accepts]: Start accepts. Automaton has 73349 states and 288633 transitions. Word has length 18 [2019-12-07 20:48:15,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:48:15,329 INFO L462 AbstractCegarLoop]: Abstraction has 73349 states and 288633 transitions. [2019-12-07 20:48:15,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:48:15,330 INFO L276 IsEmpty]: Start isEmpty. Operand 73349 states and 288633 transitions. [2019-12-07 20:48:15,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 20:48:15,336 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:48:15,336 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 20:48:15,336 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:48:15,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:48:15,336 INFO L82 PathProgramCache]: Analyzing trace with hash 152584349, now seen corresponding path program 1 times [2019-12-07 20:48:15,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:48:15,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350493499] [2019-12-07 20:48:15,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:48:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:48:15,394 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 20:48:15,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350493499] [2019-12-07 20:48:15,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:48:15,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:48:15,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595220476] [2019-12-07 20:48:15,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:48:15,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:48:15,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:48:15,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:48:15,395 INFO L87 Difference]: Start difference. First operand 73349 states and 288633 transitions. Second operand 4 states. [2019-12-07 20:48:15,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:48:15,997 INFO L93 Difference]: Finished difference Result 73316 states and 288417 transitions. [2019-12-07 20:48:15,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:48:15,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 20:48:15,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:48:16,149 INFO L225 Difference]: With dead ends: 73316 [2019-12-07 20:48:16,149 INFO L226 Difference]: Without dead ends: 73316 [2019-12-07 20:48:16,150 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:48:16,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73316 states. [2019-12-07 20:48:17,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73316 to 73232. [2019-12-07 20:48:17,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73232 states. [2019-12-07 20:48:17,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73232 states to 73232 states and 288239 transitions. [2019-12-07 20:48:17,856 INFO L78 Accepts]: Start accepts. Automaton has 73232 states and 288239 transitions. Word has length 19 [2019-12-07 20:48:17,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:48:17,856 INFO L462 AbstractCegarLoop]: Abstraction has 73232 states and 288239 transitions. [2019-12-07 20:48:17,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:48:17,856 INFO L276 IsEmpty]: Start isEmpty. Operand 73232 states and 288239 transitions. [2019-12-07 20:48:17,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 20:48:17,862 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:48:17,862 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 20:48:17,862 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:48:17,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:48:17,863 INFO L82 PathProgramCache]: Analyzing trace with hash -594281886, now seen corresponding path program 1 times [2019-12-07 20:48:17,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:48:17,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44641014] [2019-12-07 20:48:17,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:48:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:48:17,902 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 20:48:17,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44641014] [2019-12-07 20:48:17,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:48:17,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:48:17,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930262152] [2019-12-07 20:48:17,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:48:17,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:48:17,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:48:17,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:48:17,903 INFO L87 Difference]: Start difference. First operand 73232 states and 288239 transitions. Second operand 4 states. [2019-12-07 20:48:18,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:48:18,171 INFO L93 Difference]: Finished difference Result 44481 states and 153096 transitions. [2019-12-07 20:48:18,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:48:18,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 20:48:18,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:48:18,242 INFO L225 Difference]: With dead ends: 44481 [2019-12-07 20:48:18,243 INFO L226 Difference]: Without dead ends: 40109 [2019-12-07 20:48:18,243 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 20:48:18,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40109 states. [2019-12-07 20:48:18,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40109 to 40109. [2019-12-07 20:48:18,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40109 states. [2019-12-07 20:48:19,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40109 states to 40109 states and 137897 transitions. [2019-12-07 20:48:19,049 INFO L78 Accepts]: Start accepts. Automaton has 40109 states and 137897 transitions. Word has length 19 [2019-12-07 20:48:19,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:48:19,049 INFO L462 AbstractCegarLoop]: Abstraction has 40109 states and 137897 transitions. [2019-12-07 20:48:19,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:48:19,049 INFO L276 IsEmpty]: Start isEmpty. Operand 40109 states and 137897 transitions. [2019-12-07 20:48:19,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 20:48:19,053 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:48:19,053 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:48:19,053 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:48:19,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:48:19,053 INFO L82 PathProgramCache]: Analyzing trace with hash 2013634696, now seen corresponding path program 1 times [2019-12-07 20:48:19,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:48:19,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133344329] [2019-12-07 20:48:19,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:48:19,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:48:19,092 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 20:48:19,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133344329] [2019-12-07 20:48:19,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:48:19,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 20:48:19,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038318064] [2019-12-07 20:48:19,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:48:19,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:48:19,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:48:19,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:48:19,094 INFO L87 Difference]: Start difference. First operand 40109 states and 137897 transitions. Second operand 3 states. [2019-12-07 20:48:19,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:48:19,225 INFO L93 Difference]: Finished difference Result 37870 states and 129993 transitions. [2019-12-07 20:48:19,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:48:19,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 20:48:19,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:48:19,286 INFO L225 Difference]: With dead ends: 37870 [2019-12-07 20:48:19,286 INFO L226 Difference]: Without dead ends: 37870 [2019-12-07 20:48:19,287 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 20:48:19,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37870 states. [2019-12-07 20:48:19,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37870 to 37870. [2019-12-07 20:48:19,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37870 states. [2019-12-07 20:48:20,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37870 states to 37870 states and 129993 transitions. [2019-12-07 20:48:20,058 INFO L78 Accepts]: Start accepts. Automaton has 37870 states and 129993 transitions. Word has length 20 [2019-12-07 20:48:20,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:48:20,059 INFO L462 AbstractCegarLoop]: Abstraction has 37870 states and 129993 transitions. [2019-12-07 20:48:20,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:48:20,059 INFO L276 IsEmpty]: Start isEmpty. Operand 37870 states and 129993 transitions. [2019-12-07 20:48:20,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 20:48:20,065 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:48:20,065 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] [2019-12-07 20:48:20,065 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:48:20,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:48:20,066 INFO L82 PathProgramCache]: Analyzing trace with hash 296966724, now seen corresponding path program 1 times [2019-12-07 20:48:20,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:48:20,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217789067] [2019-12-07 20:48:20,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:48:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:48:20,099 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 20:48:20,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217789067] [2019-12-07 20:48:20,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:48:20,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:48:20,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800559908] [2019-12-07 20:48:20,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:48:20,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:48:20,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:48:20,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:48:20,100 INFO L87 Difference]: Start difference. First operand 37870 states and 129993 transitions. Second operand 5 states. [2019-12-07 20:48:20,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:48:20,597 INFO L93 Difference]: Finished difference Result 44876 states and 151715 transitions. [2019-12-07 20:48:20,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 20:48:20,597 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-07 20:48:20,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:48:20,665 INFO L225 Difference]: With dead ends: 44876 [2019-12-07 20:48:20,665 INFO L226 Difference]: Without dead ends: 44849 [2019-12-07 20:48:20,665 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 20:48:21,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44849 states. [2019-12-07 20:48:21,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44849 to 37904. [2019-12-07 20:48:21,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37904 states. [2019-12-07 20:48:21,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37904 states to 37904 states and 130107 transitions. [2019-12-07 20:48:21,526 INFO L78 Accepts]: Start accepts. Automaton has 37904 states and 130107 transitions. Word has length 23 [2019-12-07 20:48:21,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:48:21,526 INFO L462 AbstractCegarLoop]: Abstraction has 37904 states and 130107 transitions. [2019-12-07 20:48:21,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:48:21,527 INFO L276 IsEmpty]: Start isEmpty. Operand 37904 states and 130107 transitions. [2019-12-07 20:48:21,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 20:48:21,559 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:48:21,559 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] [2019-12-07 20:48:21,559 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:48:21,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:48:21,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1150044330, now seen corresponding path program 1 times [2019-12-07 20:48:21,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:48:21,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5523436] [2019-12-07 20:48:21,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:48:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:48:21,602 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 20:48:21,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5523436] [2019-12-07 20:48:21,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:48:21,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:48:21,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682006910] [2019-12-07 20:48:21,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:48:21,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:48:21,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:48:21,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:48:21,603 INFO L87 Difference]: Start difference. First operand 37904 states and 130107 transitions. Second operand 3 states. [2019-12-07 20:48:21,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:48:21,719 INFO L93 Difference]: Finished difference Result 37904 states and 128453 transitions. [2019-12-07 20:48:21,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:48:21,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-07 20:48:21,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:48:21,782 INFO L225 Difference]: With dead ends: 37904 [2019-12-07 20:48:21,782 INFO L226 Difference]: Without dead ends: 37904 [2019-12-07 20:48:21,782 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 20:48:22,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37904 states. [2019-12-07 20:48:22,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37904 to 37771. [2019-12-07 20:48:22,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37771 states. [2019-12-07 20:48:22,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37771 states to 37771 states and 128084 transitions. [2019-12-07 20:48:22,532 INFO L78 Accepts]: Start accepts. Automaton has 37771 states and 128084 transitions. Word has length 34 [2019-12-07 20:48:22,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:48:22,532 INFO L462 AbstractCegarLoop]: Abstraction has 37771 states and 128084 transitions. [2019-12-07 20:48:22,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:48:22,533 INFO L276 IsEmpty]: Start isEmpty. Operand 37771 states and 128084 transitions. [2019-12-07 20:48:22,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 20:48:22,566 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:48:22,566 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] [2019-12-07 20:48:22,566 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:48:22,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:48:22,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1580907386, now seen corresponding path program 1 times [2019-12-07 20:48:22,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:48:22,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663061986] [2019-12-07 20:48:22,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:48:22,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:48:22,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:48:22,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663061986] [2019-12-07 20:48:22,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:48:22,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:48:22,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884065444] [2019-12-07 20:48:22,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:48:22,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:48:22,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:48:22,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:48:22,606 INFO L87 Difference]: Start difference. First operand 37771 states and 128084 transitions. Second operand 5 states. [2019-12-07 20:48:22,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:48:22,834 INFO L93 Difference]: Finished difference Result 57538 states and 197625 transitions. [2019-12-07 20:48:22,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:48:22,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-12-07 20:48:22,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:48:22,921 INFO L225 Difference]: With dead ends: 57538 [2019-12-07 20:48:22,921 INFO L226 Difference]: Without dead ends: 49982 [2019-12-07 20:48:22,921 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:48:23,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49982 states. [2019-12-07 20:48:23,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49982 to 49982. [2019-12-07 20:48:23,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49982 states. [2019-12-07 20:48:24,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49982 states to 49982 states and 172404 transitions. [2019-12-07 20:48:24,061 INFO L78 Accepts]: Start accepts. Automaton has 49982 states and 172404 transitions. Word has length 35 [2019-12-07 20:48:24,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:48:24,061 INFO L462 AbstractCegarLoop]: Abstraction has 49982 states and 172404 transitions. [2019-12-07 20:48:24,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:48:24,061 INFO L276 IsEmpty]: Start isEmpty. Operand 49982 states and 172404 transitions. [2019-12-07 20:48:24,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 20:48:24,115 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:48:24,115 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] [2019-12-07 20:48:24,115 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:48:24,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:48:24,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1505027812, now seen corresponding path program 2 times [2019-12-07 20:48:24,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:48:24,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54065765] [2019-12-07 20:48:24,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:48:24,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:48:24,163 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 20:48:24,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54065765] [2019-12-07 20:48:24,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:48:24,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:48:24,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150861865] [2019-12-07 20:48:24,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:48:24,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:48:24,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:48:24,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:48:24,164 INFO L87 Difference]: Start difference. First operand 49982 states and 172404 transitions. Second operand 5 states. [2019-12-07 20:48:24,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:48:24,219 INFO L93 Difference]: Finished difference Result 11082 states and 34240 transitions. [2019-12-07 20:48:24,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:48:24,220 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-12-07 20:48:24,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:48:24,229 INFO L225 Difference]: With dead ends: 11082 [2019-12-07 20:48:24,229 INFO L226 Difference]: Without dead ends: 7837 [2019-12-07 20:48:24,229 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:48:24,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7837 states. [2019-12-07 20:48:24,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7837 to 7837. [2019-12-07 20:48:24,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7837 states. [2019-12-07 20:48:24,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7837 states to 7837 states and 22843 transitions. [2019-12-07 20:48:24,318 INFO L78 Accepts]: Start accepts. Automaton has 7837 states and 22843 transitions. Word has length 35 [2019-12-07 20:48:24,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:48:24,318 INFO L462 AbstractCegarLoop]: Abstraction has 7837 states and 22843 transitions. [2019-12-07 20:48:24,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:48:24,318 INFO L276 IsEmpty]: Start isEmpty. Operand 7837 states and 22843 transitions. [2019-12-07 20:48:24,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 20:48:24,325 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:48:24,325 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] [2019-12-07 20:48:24,325 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:48:24,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:48:24,325 INFO L82 PathProgramCache]: Analyzing trace with hash -492468280, now seen corresponding path program 1 times [2019-12-07 20:48:24,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:48:24,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121664506] [2019-12-07 20:48:24,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:48:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:48:24,545 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 20:48:24,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121664506] [2019-12-07 20:48:24,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:48:24,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 20:48:24,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787812720] [2019-12-07 20:48:24,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 20:48:24,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:48:24,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 20:48:24,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:48:24,546 INFO L87 Difference]: Start difference. First operand 7837 states and 22843 transitions. Second operand 9 states. [2019-12-07 20:48:25,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:48:25,327 INFO L93 Difference]: Finished difference Result 15636 states and 41390 transitions. [2019-12-07 20:48:25,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 20:48:25,328 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2019-12-07 20:48:25,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:48:25,342 INFO L225 Difference]: With dead ends: 15636 [2019-12-07 20:48:25,343 INFO L226 Difference]: Without dead ends: 15004 [2019-12-07 20:48:25,343 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2019-12-07 20:48:25,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15004 states. [2019-12-07 20:48:25,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15004 to 10507. [2019-12-07 20:48:25,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10507 states. [2019-12-07 20:48:25,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10507 states to 10507 states and 29608 transitions. [2019-12-07 20:48:25,483 INFO L78 Accepts]: Start accepts. Automaton has 10507 states and 29608 transitions. Word has length 47 [2019-12-07 20:48:25,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:48:25,483 INFO L462 AbstractCegarLoop]: Abstraction has 10507 states and 29608 transitions. [2019-12-07 20:48:25,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 20:48:25,483 INFO L276 IsEmpty]: Start isEmpty. Operand 10507 states and 29608 transitions. [2019-12-07 20:48:25,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 20:48:25,491 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:48:25,491 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] [2019-12-07 20:48:25,491 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:48:25,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:48:25,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1618395182, now seen corresponding path program 2 times [2019-12-07 20:48:25,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:48:25,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666159588] [2019-12-07 20:48:25,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:48:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:48:25,618 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 20:48:25,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666159588] [2019-12-07 20:48:25,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:48:25,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 20:48:25,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556119462] [2019-12-07 20:48:25,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 20:48:25,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:48:25,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 20:48:25,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-07 20:48:25,620 INFO L87 Difference]: Start difference. First operand 10507 states and 29608 transitions. Second operand 10 states. [2019-12-07 20:48:26,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:48:26,153 INFO L93 Difference]: Finished difference Result 14362 states and 39376 transitions. [2019-12-07 20:48:26,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 20:48:26,154 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2019-12-07 20:48:26,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:48:26,165 INFO L225 Difference]: With dead ends: 14362 [2019-12-07 20:48:26,165 INFO L226 Difference]: Without dead ends: 11245 [2019-12-07 20:48:26,165 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-07 20:48:26,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11245 states. [2019-12-07 20:48:26,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11245 to 7892. [2019-12-07 20:48:26,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7892 states. [2019-12-07 20:48:26,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7892 states to 7892 states and 22920 transitions. [2019-12-07 20:48:26,266 INFO L78 Accepts]: Start accepts. Automaton has 7892 states and 22920 transitions. Word has length 47 [2019-12-07 20:48:26,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:48:26,266 INFO L462 AbstractCegarLoop]: Abstraction has 7892 states and 22920 transitions. [2019-12-07 20:48:26,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 20:48:26,266 INFO L276 IsEmpty]: Start isEmpty. Operand 7892 states and 22920 transitions. [2019-12-07 20:48:26,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 20:48:26,272 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:48:26,272 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] [2019-12-07 20:48:26,272 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:48:26,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:48:26,272 INFO L82 PathProgramCache]: Analyzing trace with hash -109708298, now seen corresponding path program 3 times [2019-12-07 20:48:26,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:48:26,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774551478] [2019-12-07 20:48:26,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:48:26,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:48:26,324 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 20:48:26,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774551478] [2019-12-07 20:48:26,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:48:26,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:48:26,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319169072] [2019-12-07 20:48:26,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:48:26,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:48:26,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:48:26,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:48:26,326 INFO L87 Difference]: Start difference. First operand 7892 states and 22920 transitions. Second operand 6 states. [2019-12-07 20:48:26,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:48:26,387 INFO L93 Difference]: Finished difference Result 6521 states and 19764 transitions. [2019-12-07 20:48:26,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:48:26,388 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-07 20:48:26,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:48:26,392 INFO L225 Difference]: With dead ends: 6521 [2019-12-07 20:48:26,392 INFO L226 Difference]: Without dead ends: 3621 [2019-12-07 20:48:26,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:48:26,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3621 states. [2019-12-07 20:48:26,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3621 to 3609. [2019-12-07 20:48:26,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3609 states. [2019-12-07 20:48:26,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3609 states to 3609 states and 9635 transitions. [2019-12-07 20:48:26,431 INFO L78 Accepts]: Start accepts. Automaton has 3609 states and 9635 transitions. Word has length 47 [2019-12-07 20:48:26,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:48:26,431 INFO L462 AbstractCegarLoop]: Abstraction has 3609 states and 9635 transitions. [2019-12-07 20:48:26,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:48:26,431 INFO L276 IsEmpty]: Start isEmpty. Operand 3609 states and 9635 transitions. [2019-12-07 20:48:26,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 20:48:26,435 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:48:26,435 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:48:26,435 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:48:26,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:48:26,435 INFO L82 PathProgramCache]: Analyzing trace with hash 783248225, now seen corresponding path program 1 times [2019-12-07 20:48:26,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:48:26,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202446668] [2019-12-07 20:48:26,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:48:26,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:48:26,626 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 20:48:26,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202446668] [2019-12-07 20:48:26,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:48:26,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 20:48:26,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313833882] [2019-12-07 20:48:26,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 20:48:26,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:48:26,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 20:48:26,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-07 20:48:26,627 INFO L87 Difference]: Start difference. First operand 3609 states and 9635 transitions. Second operand 13 states. [2019-12-07 20:48:27,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:48:27,673 INFO L93 Difference]: Finished difference Result 9335 states and 25186 transitions. [2019-12-07 20:48:27,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 20:48:27,674 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2019-12-07 20:48:27,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:48:27,680 INFO L225 Difference]: With dead ends: 9335 [2019-12-07 20:48:27,680 INFO L226 Difference]: Without dead ends: 6538 [2019-12-07 20:48:27,680 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2019-12-07 20:48:27,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6538 states. [2019-12-07 20:48:27,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6538 to 4034. [2019-12-07 20:48:27,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4034 states. [2019-12-07 20:48:27,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4034 states to 4034 states and 10685 transitions. [2019-12-07 20:48:27,728 INFO L78 Accepts]: Start accepts. Automaton has 4034 states and 10685 transitions. Word has length 62 [2019-12-07 20:48:27,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:48:27,728 INFO L462 AbstractCegarLoop]: Abstraction has 4034 states and 10685 transitions. [2019-12-07 20:48:27,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 20:48:27,729 INFO L276 IsEmpty]: Start isEmpty. Operand 4034 states and 10685 transitions. [2019-12-07 20:48:27,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 20:48:27,731 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:48:27,731 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:48:27,731 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:48:27,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:48:27,731 INFO L82 PathProgramCache]: Analyzing trace with hash -379647347, now seen corresponding path program 2 times [2019-12-07 20:48:27,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:48:27,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547124517] [2019-12-07 20:48:27,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:48:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:48:27,806 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 20:48:27,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547124517] [2019-12-07 20:48:27,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:48:27,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:48:27,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448999211] [2019-12-07 20:48:27,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:48:27,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:48:27,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:48:27,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:48:27,807 INFO L87 Difference]: Start difference. First operand 4034 states and 10685 transitions. Second operand 4 states. [2019-12-07 20:48:27,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:48:27,844 INFO L93 Difference]: Finished difference Result 4411 states and 11548 transitions. [2019-12-07 20:48:27,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:48:27,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-07 20:48:27,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:48:27,847 INFO L225 Difference]: With dead ends: 4411 [2019-12-07 20:48:27,847 INFO L226 Difference]: Without dead ends: 2935 [2019-12-07 20:48:27,847 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 20:48:27,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2019-12-07 20:48:27,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 2605. [2019-12-07 20:48:27,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2605 states. [2019-12-07 20:48:27,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 6856 transitions. [2019-12-07 20:48:27,875 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 6856 transitions. Word has length 62 [2019-12-07 20:48:27,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:48:27,876 INFO L462 AbstractCegarLoop]: Abstraction has 2605 states and 6856 transitions. [2019-12-07 20:48:27,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:48:27,876 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 6856 transitions. [2019-12-07 20:48:27,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 20:48:27,877 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:48:27,878 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:48:27,878 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:48:27,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:48:27,878 INFO L82 PathProgramCache]: Analyzing trace with hash -956676094, now seen corresponding path program 1 times [2019-12-07 20:48:27,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:48:27,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024978821] [2019-12-07 20:48:27,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:48:27,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:48:27,952 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 20:48:27,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024978821] [2019-12-07 20:48:27,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:48:27,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:48:27,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315686905] [2019-12-07 20:48:27,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:48:27,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:48:27,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:48:27,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:48:27,953 INFO L87 Difference]: Start difference. First operand 2605 states and 6856 transitions. Second operand 5 states. [2019-12-07 20:48:27,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:48:27,983 INFO L93 Difference]: Finished difference Result 2979 states and 7714 transitions. [2019-12-07 20:48:27,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:48:27,983 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-12-07 20:48:27,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:48:27,984 INFO L225 Difference]: With dead ends: 2979 [2019-12-07 20:48:27,984 INFO L226 Difference]: Without dead ends: 437 [2019-12-07 20:48:27,984 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:48:27,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-12-07 20:48:27,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2019-12-07 20:48:27,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2019-12-07 20:48:27,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 955 transitions. [2019-12-07 20:48:27,990 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 955 transitions. Word has length 63 [2019-12-07 20:48:27,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:48:27,990 INFO L462 AbstractCegarLoop]: Abstraction has 437 states and 955 transitions. [2019-12-07 20:48:27,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:48:27,990 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 955 transitions. [2019-12-07 20:48:27,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 20:48:27,991 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:48:27,991 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:48:27,991 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:48:27,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:48:27,991 INFO L82 PathProgramCache]: Analyzing trace with hash -496292372, now seen corresponding path program 2 times [2019-12-07 20:48:27,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:48:27,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738223135] [2019-12-07 20:48:27,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:48:28,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:48:28,076 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 20:48:28,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738223135] [2019-12-07 20:48:28,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:48:28,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 20:48:28,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517753262] [2019-12-07 20:48:28,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 20:48:28,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:48:28,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 20:48:28,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:48:28,078 INFO L87 Difference]: Start difference. First operand 437 states and 955 transitions. Second operand 8 states. [2019-12-07 20:48:28,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:48:28,273 INFO L93 Difference]: Finished difference Result 943 states and 2025 transitions. [2019-12-07 20:48:28,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 20:48:28,273 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-07 20:48:28,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:48:28,274 INFO L225 Difference]: With dead ends: 943 [2019-12-07 20:48:28,274 INFO L226 Difference]: Without dead ends: 692 [2019-12-07 20:48:28,274 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-12-07 20:48:28,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2019-12-07 20:48:28,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 528. [2019-12-07 20:48:28,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-12-07 20:48:28,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 1120 transitions. [2019-12-07 20:48:28,279 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 1120 transitions. Word has length 63 [2019-12-07 20:48:28,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:48:28,279 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 1120 transitions. [2019-12-07 20:48:28,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 20:48:28,279 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 1120 transitions. [2019-12-07 20:48:28,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 20:48:28,280 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:48:28,280 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:48:28,280 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:48:28,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:48:28,280 INFO L82 PathProgramCache]: Analyzing trace with hash -2092088660, now seen corresponding path program 3 times [2019-12-07 20:48:28,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:48:28,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368601113] [2019-12-07 20:48:28,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:48:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 20:48:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 20:48:28,354 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 20:48:28,354 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 20:48:28,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_146| 0 0))) (and (= v_~y$w_buff0_used~0_977 0) (= v_~main$tmp_guard0~0_31 0) (= v_~__unbuffered_cnt~0_147 0) (= v_~y~0_394 0) (= 0 v_~y$read_delayed_var~0.offset_7) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t29~0.base_112|) (= v_~z~0_33 0) (= 0 v_~weak$$choice0~0_268) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t29~0.base_112|)) (= v_~y$w_buff1~0_277 0) (= 0 v_~y$r_buff1_thd3~0_407) (= v_~y$read_delayed~0_7 0) (= v_~x~0_53 0) (= v_~y$w_buff1_used~0_557 0) (= 0 v_~__unbuffered_p0_EAX~0_92) (= v_~y$r_buff1_thd0~0_349 0) (= v_~__unbuffered_p0_EBX~0_92 0) (= v_~y$mem_tmp~0_281 0) (= v_~weak$$choice2~0_344 0) (= v_~y$r_buff0_thd0~0_222 0) (= 0 |v_ULTIMATE.start_main_~#t29~0.offset_63|) (= 0 v_~y$r_buff1_thd2~0_454) (< 0 |v_#StackHeapBarrier_18|) (= v_~main$tmp_guard1~0_83 0) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$w_buff0~0_387) (= |v_#NULL.offset_5| 0) (= 0 v_~y$r_buff0_thd2~0_461) (= v_~y$r_buff0_thd1~0_167 0) (= 0 v_~__unbuffered_p1_EBX~0_100) (= 0 v_~y$r_buff0_thd3~0_651) (= v_~__unbuffered_p2_EBX~0_91 0) (= v_~__unbuffered_p1_EAX~0_110 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t29~0.base_112| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t29~0.base_112|) |v_ULTIMATE.start_main_~#t29~0.offset_63| 0)) |v_#memory_int_21|) (= v_~y$r_buff1_thd1~0_236 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t29~0.base_112| 4) |v_#length_25|) (= 0 |v_#NULL.base_5|) (= 0 v_~__unbuffered_p2_EAX~0_98) (= (store .cse0 |v_ULTIMATE.start_main_~#t29~0.base_112| 1) |v_#valid_144|) (= v_~y$flush_delayed~0_345 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_146|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_18|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ULTIMATE.start_main_~#t31~0.base=|v_ULTIMATE.start_main_~#t31~0.base_59|, #NULL.offset=|v_#NULL.offset_5|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_281, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_92, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_407, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_110, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_167, ~y$flush_delayed~0=v_~y$flush_delayed~0_345, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_91, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_92, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_57|, ULTIMATE.start_main_~#t30~0.offset=|v_ULTIMATE.start_main_~#t30~0.offset_36|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_167|, ~weak$$choice0~0=v_~weak$$choice0~0_268, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_33|, ~y$w_buff1~0=v_~y$w_buff1~0_277, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t29~0.base=|v_ULTIMATE.start_main_~#t29~0.base_112|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_461, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_147, ULTIMATE.start_main_~#t30~0.base=|v_ULTIMATE.start_main_~#t30~0.base_84|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_349, ~x~0=v_~x~0_53, ULTIMATE.start_main_~#t29~0.offset=|v_ULTIMATE.start_main_~#t29~0.offset_63|, ~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_977, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_83, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_236, ULTIMATE.start_main_~#t31~0.offset=|v_ULTIMATE.start_main_~#t31~0.offset_36|, ~y$w_buff0~0=v_~y$w_buff0~0_387, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_651, ~y~0=v_~y~0_394, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_100, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_84|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_29|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_454, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_375|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_67|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_222, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_33, ~weak$$choice2~0=v_~weak$$choice2~0_344, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_557} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t31~0.base, #NULL.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_~#t30~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t29~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t30~0.base, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t29~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t31~0.offset, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 20:48:28,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L840-1-->L842: Formula: (and (not (= |v_ULTIMATE.start_main_~#t30~0.base_11| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t30~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t30~0.base_11|) |v_ULTIMATE.start_main_~#t30~0.offset_10| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t30~0.base_11|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t30~0.base_11| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t30~0.base_11|) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t30~0.base_11| 1) |v_#valid_32|) (= |v_ULTIMATE.start_main_~#t30~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t30~0.offset=|v_ULTIMATE.start_main_~#t30~0.offset_10|, #length=|v_#length_15|, ULTIMATE.start_main_~#t30~0.base=|v_ULTIMATE.start_main_~#t30~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t30~0.offset, #length, ULTIMATE.start_main_~#t30~0.base] because there is no mapped edge [2019-12-07 20:48:28,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L842-1-->L844: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t31~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t31~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t31~0.base_11|) |v_ULTIMATE.start_main_~#t31~0.offset_10| 2)) |v_#memory_int_13|) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t31~0.base_11|) 0) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t31~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t31~0.base_11|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t31~0.base_11| 4) |v_#length_17|) (= |v_ULTIMATE.start_main_~#t31~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t31~0.base=|v_ULTIMATE.start_main_~#t31~0.base_11|, ULTIMATE.start_main_~#t31~0.offset=|v_ULTIMATE.start_main_~#t31~0.offset_10|, #valid=|v_#valid_34|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t31~0.base, ULTIMATE.start_main_~#t31~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-12-07 20:48:28,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [927] [927] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_346 v_~y$w_buff1_used~0_197) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69)) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_197 256) 0)) (not (= 0 (mod v_~y$w_buff0_used~0_345 256))))) 1 0) |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|) (= v_~y$w_buff1~0_94 v_~y$w_buff0~0_159) (= |v_P2Thread1of1ForFork0_#in~arg.offset_69| v_P2Thread1of1ForFork0_~arg.offset_67) (= v_~y$w_buff0_used~0_345 1) (= 1 v_~y$w_buff0~0_158) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|) (= |v_P2Thread1of1ForFork0_#in~arg.base_69| v_P2Thread1of1ForFork0_~arg.base_67)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_69|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_346, ~y$w_buff0~0=v_~y$w_buff0~0_159, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_69|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_67, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_69|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_345, ~y$w_buff1~0=v_~y$w_buff1~0_94, ~y$w_buff0~0=v_~y$w_buff0~0_158, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_67, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_69|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_197} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 20:48:28,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L802-2-->L802-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-140193650 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-140193650 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out-140193650| ~y$w_buff0~0_In-140193650)) (and (= |P2Thread1of1ForFork0_#t~ite28_Out-140193650| ~y$w_buff1~0_In-140193650) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-140193650, ~y$w_buff1~0=~y$w_buff1~0_In-140193650, ~y$w_buff0~0=~y$w_buff0~0_In-140193650, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-140193650} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-140193650|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-140193650, ~y$w_buff1~0=~y$w_buff1~0_In-140193650, ~y$w_buff0~0=~y$w_buff0~0_In-140193650, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-140193650} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 20:48:28,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L802-4-->L803: Formula: (= v_~y~0_30 |v_P2Thread1of1ForFork0_#t~ite28_6|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_6|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_5|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|, ~y~0=v_~y~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-07 20:48:28,362 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L807-->L808: Formula: (and (= v_~y$r_buff0_thd3~0_64 v_~y$r_buff0_thd3~0_63) (not (= (mod v_~weak$$choice2~0_41 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_64, ~weak$$choice2~0=v_~weak$$choice2~0_41} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_5|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_63, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_5|, ~weak$$choice2~0=v_~weak$$choice2~0_41} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 20:48:28,362 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-756435413 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite48_Out-756435413| ~y$mem_tmp~0_In-756435413)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite48_Out-756435413| ~y~0_In-756435413)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-756435413, ~y$flush_delayed~0=~y$flush_delayed~0_In-756435413, ~y~0=~y~0_In-756435413} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-756435413|, ~y$mem_tmp~0=~y$mem_tmp~0_In-756435413, ~y$flush_delayed~0=~y$flush_delayed~0_In-756435413, ~y~0=~y~0_In-756435413} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 20:48:28,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] P0ENTRY-->P0EXIT: Formula: (and (= v_~z~0_13 v_~__unbuffered_p0_EAX~0_17) (= (+ v_~__unbuffered_cnt~0_80 1) v_~__unbuffered_cnt~0_79) (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= |v_P0Thread1of1ForFork1_#in~arg.base_10| v_P0Thread1of1ForFork1_~arg.base_8) (= v_P0Thread1of1ForFork1_~arg.offset_8 |v_P0Thread1of1ForFork1_#in~arg.offset_10|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|) (= v_~__unbuffered_p0_EBX~0_17 v_~x~0_35) (= v_~z~0_13 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_10|, ~x~0=v_~x~0_35} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_17, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_10|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~z~0=v_~z~0_13, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_10|, ~x~0=v_~x~0_35, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_8} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 20:48:28,364 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L818-->L818-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1095393446 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1095393446 256) 0))) (or (and (= ~y$w_buff0_used~0_In1095393446 |P2Thread1of1ForFork0_#t~ite51_Out1095393446|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out1095393446|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1095393446, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1095393446} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1095393446, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1095393446, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out1095393446|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 20:48:28,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L819-->L819-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In1732543762 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In1732543762 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1732543762 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1732543762 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite52_Out1732543762| ~y$w_buff1_used~0_In1732543762)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork0_#t~ite52_Out1732543762| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1732543762, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1732543762, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1732543762, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1732543762} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1732543762, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1732543762, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1732543762, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out1732543762|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1732543762} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 20:48:28,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L820-->L821: Formula: (let ((.cse1 (= ~y$r_buff0_thd3~0_In-1349417870 ~y$r_buff0_thd3~0_Out-1349417870)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-1349417870 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1349417870 256)))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and (= 0 ~y$r_buff0_thd3~0_Out-1349417870) (not .cse0) (not .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1349417870, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1349417870} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1349417870, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1349417870, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-1349417870|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 20:48:28,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L821-->L821-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In865144819 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In865144819 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In865144819 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In865144819 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite54_Out865144819| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite54_Out865144819| ~y$r_buff1_thd3~0_In865144819) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In865144819, ~y$w_buff0_used~0=~y$w_buff0_used~0_In865144819, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In865144819, ~y$w_buff1_used~0=~y$w_buff1_used~0_In865144819} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In865144819, ~y$w_buff0_used~0=~y$w_buff0_used~0_In865144819, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out865144819|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In865144819, ~y$w_buff1_used~0=~y$w_buff1_used~0_In865144819} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 20:48:28,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L821-2-->P2EXIT: Formula: (and (= v_~y$r_buff1_thd3~0_196 |v_P2Thread1of1ForFork0_#t~ite54_36|) (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= (+ v_~__unbuffered_cnt~0_98 1) v_~__unbuffered_cnt~0_97) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_196, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 20:48:28,370 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-408622954 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite25_Out-408622954| ~y$mem_tmp~0_In-408622954)) (and .cse0 (= |P1Thread1of1ForFork2_#t~ite25_Out-408622954| ~y~0_In-408622954)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-408622954, ~y$flush_delayed~0=~y$flush_delayed~0_In-408622954, ~y~0=~y~0_In-408622954} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-408622954, ~y$flush_delayed~0=~y$flush_delayed~0_In-408622954, ~y~0=~y~0_In-408622954, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-408622954|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 20:48:28,370 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~y~0_233 |v_P1Thread1of1ForFork2_#t~ite25_92|) (= v_~y$flush_delayed~0_261 0) (= v_~__unbuffered_cnt~0_123 (+ v_~__unbuffered_cnt~0_124 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_124, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_92|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_261, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123, ~y~0=v_~y~0_233, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_91|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 20:48:28,370 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [898] [898] L848-->L850-2: Formula: (and (or (= (mod v_~y$r_buff0_thd0~0_26 256) 0) (= (mod v_~y$w_buff0_used~0_150 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_150, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_150, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 20:48:28,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L850-2-->L850-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite59_Out-1378200520| |ULTIMATE.start_main_#t~ite58_Out-1378200520|)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1378200520 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1378200520 256)))) (or (and (or .cse0 .cse1) .cse2 (= ~y~0_In-1378200520 |ULTIMATE.start_main_#t~ite58_Out-1378200520|)) (and .cse2 (= ~y$w_buff1~0_In-1378200520 |ULTIMATE.start_main_#t~ite58_Out-1378200520|) (not .cse1) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1378200520, ~y~0=~y~0_In-1378200520, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1378200520, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1378200520} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1378200520, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-1378200520|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1378200520|, ~y~0=~y~0_In-1378200520, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1378200520, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1378200520} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 20:48:28,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L851-->L851-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In920464421 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In920464421 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite60_Out920464421| 0)) (and (= ~y$w_buff0_used~0_In920464421 |ULTIMATE.start_main_#t~ite60_Out920464421|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In920464421, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In920464421} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out920464421|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In920464421, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In920464421} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 20:48:28,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L852-->L852-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd0~0_In-1071659972 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1071659972 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1071659972 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1071659972 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite61_Out-1071659972|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-1071659972 |ULTIMATE.start_main_#t~ite61_Out-1071659972|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1071659972, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1071659972, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1071659972, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1071659972} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1071659972|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1071659972, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1071659972, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1071659972, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1071659972} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 20:48:28,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L853-->L853-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In2136610479 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In2136610479 256) 0))) (or (and (= ~y$r_buff0_thd0~0_In2136610479 |ULTIMATE.start_main_#t~ite62_Out2136610479|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite62_Out2136610479|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2136610479, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2136610479} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out2136610479|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2136610479, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2136610479} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 20:48:28,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L854-->L854-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1297355272 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1297355272 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-1297355272 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1297355272 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite63_Out-1297355272|)) (and (or .cse1 .cse0) (= ~y$r_buff1_thd0~0_In-1297355272 |ULTIMATE.start_main_#t~ite63_Out-1297355272|) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1297355272, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1297355272, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1297355272, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1297355272} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1297355272|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1297355272, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1297355272, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1297355272, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1297355272} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 20:48:28,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~y$r_buff1_thd0~0_254 |v_ULTIMATE.start_main_#t~ite63_47|) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_29 0) (= 1 v_~__unbuffered_p0_EAX~0_29) (= 1 v_~__unbuffered_p1_EAX~0_47) (= v_~__unbuffered_p2_EBX~0_26 0) (= v_~__unbuffered_p0_EBX~0_29 0) (= 1 v_~__unbuffered_p2_EAX~0_23))) 1 0)) 0 1) v_~main$tmp_guard1~0_22) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_22 256))) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_47|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_29, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_46|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_29, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_254, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 20:48:28,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 08:48:28 BasicIcfg [2019-12-07 20:48:28,435 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 20:48:28,436 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 20:48:28,436 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 20:48:28,436 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 20:48:28,436 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:47:57" (3/4) ... [2019-12-07 20:48:28,438 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 20:48:28,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_146| 0 0))) (and (= v_~y$w_buff0_used~0_977 0) (= v_~main$tmp_guard0~0_31 0) (= v_~__unbuffered_cnt~0_147 0) (= v_~y~0_394 0) (= 0 v_~y$read_delayed_var~0.offset_7) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t29~0.base_112|) (= v_~z~0_33 0) (= 0 v_~weak$$choice0~0_268) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t29~0.base_112|)) (= v_~y$w_buff1~0_277 0) (= 0 v_~y$r_buff1_thd3~0_407) (= v_~y$read_delayed~0_7 0) (= v_~x~0_53 0) (= v_~y$w_buff1_used~0_557 0) (= 0 v_~__unbuffered_p0_EAX~0_92) (= v_~y$r_buff1_thd0~0_349 0) (= v_~__unbuffered_p0_EBX~0_92 0) (= v_~y$mem_tmp~0_281 0) (= v_~weak$$choice2~0_344 0) (= v_~y$r_buff0_thd0~0_222 0) (= 0 |v_ULTIMATE.start_main_~#t29~0.offset_63|) (= 0 v_~y$r_buff1_thd2~0_454) (< 0 |v_#StackHeapBarrier_18|) (= v_~main$tmp_guard1~0_83 0) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$w_buff0~0_387) (= |v_#NULL.offset_5| 0) (= 0 v_~y$r_buff0_thd2~0_461) (= v_~y$r_buff0_thd1~0_167 0) (= 0 v_~__unbuffered_p1_EBX~0_100) (= 0 v_~y$r_buff0_thd3~0_651) (= v_~__unbuffered_p2_EBX~0_91 0) (= v_~__unbuffered_p1_EAX~0_110 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t29~0.base_112| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t29~0.base_112|) |v_ULTIMATE.start_main_~#t29~0.offset_63| 0)) |v_#memory_int_21|) (= v_~y$r_buff1_thd1~0_236 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t29~0.base_112| 4) |v_#length_25|) (= 0 |v_#NULL.base_5|) (= 0 v_~__unbuffered_p2_EAX~0_98) (= (store .cse0 |v_ULTIMATE.start_main_~#t29~0.base_112| 1) |v_#valid_144|) (= v_~y$flush_delayed~0_345 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_146|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_18|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ULTIMATE.start_main_~#t31~0.base=|v_ULTIMATE.start_main_~#t31~0.base_59|, #NULL.offset=|v_#NULL.offset_5|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_281, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_92, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_407, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_110, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_167, ~y$flush_delayed~0=v_~y$flush_delayed~0_345, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_91, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_92, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_57|, ULTIMATE.start_main_~#t30~0.offset=|v_ULTIMATE.start_main_~#t30~0.offset_36|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_167|, ~weak$$choice0~0=v_~weak$$choice0~0_268, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_33|, ~y$w_buff1~0=v_~y$w_buff1~0_277, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t29~0.base=|v_ULTIMATE.start_main_~#t29~0.base_112|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_461, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_147, ULTIMATE.start_main_~#t30~0.base=|v_ULTIMATE.start_main_~#t30~0.base_84|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_349, ~x~0=v_~x~0_53, ULTIMATE.start_main_~#t29~0.offset=|v_ULTIMATE.start_main_~#t29~0.offset_63|, ~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_977, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_83, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_236, ULTIMATE.start_main_~#t31~0.offset=|v_ULTIMATE.start_main_~#t31~0.offset_36|, ~y$w_buff0~0=v_~y$w_buff0~0_387, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_651, ~y~0=v_~y~0_394, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_100, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_84|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_29|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_454, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_375|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_67|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_222, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_33, ~weak$$choice2~0=v_~weak$$choice2~0_344, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_557} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t31~0.base, #NULL.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_~#t30~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t29~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t30~0.base, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t29~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t31~0.offset, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 20:48:28,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L840-1-->L842: Formula: (and (not (= |v_ULTIMATE.start_main_~#t30~0.base_11| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t30~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t30~0.base_11|) |v_ULTIMATE.start_main_~#t30~0.offset_10| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t30~0.base_11|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t30~0.base_11| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t30~0.base_11|) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t30~0.base_11| 1) |v_#valid_32|) (= |v_ULTIMATE.start_main_~#t30~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t30~0.offset=|v_ULTIMATE.start_main_~#t30~0.offset_10|, #length=|v_#length_15|, ULTIMATE.start_main_~#t30~0.base=|v_ULTIMATE.start_main_~#t30~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t30~0.offset, #length, ULTIMATE.start_main_~#t30~0.base] because there is no mapped edge [2019-12-07 20:48:28,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L842-1-->L844: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t31~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t31~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t31~0.base_11|) |v_ULTIMATE.start_main_~#t31~0.offset_10| 2)) |v_#memory_int_13|) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t31~0.base_11|) 0) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t31~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t31~0.base_11|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t31~0.base_11| 4) |v_#length_17|) (= |v_ULTIMATE.start_main_~#t31~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t31~0.base=|v_ULTIMATE.start_main_~#t31~0.base_11|, ULTIMATE.start_main_~#t31~0.offset=|v_ULTIMATE.start_main_~#t31~0.offset_10|, #valid=|v_#valid_34|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t31~0.base, ULTIMATE.start_main_~#t31~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-12-07 20:48:28,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [927] [927] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_346 v_~y$w_buff1_used~0_197) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69)) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_197 256) 0)) (not (= 0 (mod v_~y$w_buff0_used~0_345 256))))) 1 0) |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|) (= v_~y$w_buff1~0_94 v_~y$w_buff0~0_159) (= |v_P2Thread1of1ForFork0_#in~arg.offset_69| v_P2Thread1of1ForFork0_~arg.offset_67) (= v_~y$w_buff0_used~0_345 1) (= 1 v_~y$w_buff0~0_158) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|) (= |v_P2Thread1of1ForFork0_#in~arg.base_69| v_P2Thread1of1ForFork0_~arg.base_67)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_69|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_346, ~y$w_buff0~0=v_~y$w_buff0~0_159, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_69|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_67, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_69|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_345, ~y$w_buff1~0=v_~y$w_buff1~0_94, ~y$w_buff0~0=v_~y$w_buff0~0_158, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_67, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_69|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_197} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 20:48:28,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L802-2-->L802-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-140193650 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-140193650 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out-140193650| ~y$w_buff0~0_In-140193650)) (and (= |P2Thread1of1ForFork0_#t~ite28_Out-140193650| ~y$w_buff1~0_In-140193650) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-140193650, ~y$w_buff1~0=~y$w_buff1~0_In-140193650, ~y$w_buff0~0=~y$w_buff0~0_In-140193650, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-140193650} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-140193650|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-140193650, ~y$w_buff1~0=~y$w_buff1~0_In-140193650, ~y$w_buff0~0=~y$w_buff0~0_In-140193650, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-140193650} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 20:48:28,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L802-4-->L803: Formula: (= v_~y~0_30 |v_P2Thread1of1ForFork0_#t~ite28_6|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_6|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_5|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|, ~y~0=v_~y~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-07 20:48:28,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L807-->L808: Formula: (and (= v_~y$r_buff0_thd3~0_64 v_~y$r_buff0_thd3~0_63) (not (= (mod v_~weak$$choice2~0_41 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_64, ~weak$$choice2~0=v_~weak$$choice2~0_41} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_5|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_63, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_5|, ~weak$$choice2~0=v_~weak$$choice2~0_41} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 20:48:28,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-756435413 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite48_Out-756435413| ~y$mem_tmp~0_In-756435413)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite48_Out-756435413| ~y~0_In-756435413)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-756435413, ~y$flush_delayed~0=~y$flush_delayed~0_In-756435413, ~y~0=~y~0_In-756435413} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-756435413|, ~y$mem_tmp~0=~y$mem_tmp~0_In-756435413, ~y$flush_delayed~0=~y$flush_delayed~0_In-756435413, ~y~0=~y~0_In-756435413} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 20:48:28,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] P0ENTRY-->P0EXIT: Formula: (and (= v_~z~0_13 v_~__unbuffered_p0_EAX~0_17) (= (+ v_~__unbuffered_cnt~0_80 1) v_~__unbuffered_cnt~0_79) (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= |v_P0Thread1of1ForFork1_#in~arg.base_10| v_P0Thread1of1ForFork1_~arg.base_8) (= v_P0Thread1of1ForFork1_~arg.offset_8 |v_P0Thread1of1ForFork1_#in~arg.offset_10|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|) (= v_~__unbuffered_p0_EBX~0_17 v_~x~0_35) (= v_~z~0_13 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_10|, ~x~0=v_~x~0_35} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_17, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_10|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~z~0=v_~z~0_13, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_10|, ~x~0=v_~x~0_35, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_8} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 20:48:28,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L818-->L818-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1095393446 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1095393446 256) 0))) (or (and (= ~y$w_buff0_used~0_In1095393446 |P2Thread1of1ForFork0_#t~ite51_Out1095393446|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out1095393446|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1095393446, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1095393446} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1095393446, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1095393446, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out1095393446|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 20:48:28,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L819-->L819-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In1732543762 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In1732543762 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1732543762 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1732543762 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite52_Out1732543762| ~y$w_buff1_used~0_In1732543762)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork0_#t~ite52_Out1732543762| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1732543762, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1732543762, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1732543762, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1732543762} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1732543762, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1732543762, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1732543762, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out1732543762|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1732543762} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 20:48:28,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L820-->L821: Formula: (let ((.cse1 (= ~y$r_buff0_thd3~0_In-1349417870 ~y$r_buff0_thd3~0_Out-1349417870)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-1349417870 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1349417870 256)))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and (= 0 ~y$r_buff0_thd3~0_Out-1349417870) (not .cse0) (not .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1349417870, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1349417870} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1349417870, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1349417870, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-1349417870|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 20:48:28,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L821-->L821-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In865144819 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In865144819 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In865144819 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In865144819 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite54_Out865144819| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite54_Out865144819| ~y$r_buff1_thd3~0_In865144819) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In865144819, ~y$w_buff0_used~0=~y$w_buff0_used~0_In865144819, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In865144819, ~y$w_buff1_used~0=~y$w_buff1_used~0_In865144819} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In865144819, ~y$w_buff0_used~0=~y$w_buff0_used~0_In865144819, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out865144819|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In865144819, ~y$w_buff1_used~0=~y$w_buff1_used~0_In865144819} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 20:48:28,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L821-2-->P2EXIT: Formula: (and (= v_~y$r_buff1_thd3~0_196 |v_P2Thread1of1ForFork0_#t~ite54_36|) (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= (+ v_~__unbuffered_cnt~0_98 1) v_~__unbuffered_cnt~0_97) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_196, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 20:48:28,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-408622954 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite25_Out-408622954| ~y$mem_tmp~0_In-408622954)) (and .cse0 (= |P1Thread1of1ForFork2_#t~ite25_Out-408622954| ~y~0_In-408622954)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-408622954, ~y$flush_delayed~0=~y$flush_delayed~0_In-408622954, ~y~0=~y~0_In-408622954} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-408622954, ~y$flush_delayed~0=~y$flush_delayed~0_In-408622954, ~y~0=~y~0_In-408622954, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-408622954|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 20:48:28,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~y~0_233 |v_P1Thread1of1ForFork2_#t~ite25_92|) (= v_~y$flush_delayed~0_261 0) (= v_~__unbuffered_cnt~0_123 (+ v_~__unbuffered_cnt~0_124 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_124, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_92|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_261, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123, ~y~0=v_~y~0_233, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_91|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 20:48:28,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [898] [898] L848-->L850-2: Formula: (and (or (= (mod v_~y$r_buff0_thd0~0_26 256) 0) (= (mod v_~y$w_buff0_used~0_150 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_150, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_150, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 20:48:28,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L850-2-->L850-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite59_Out-1378200520| |ULTIMATE.start_main_#t~ite58_Out-1378200520|)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1378200520 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1378200520 256)))) (or (and (or .cse0 .cse1) .cse2 (= ~y~0_In-1378200520 |ULTIMATE.start_main_#t~ite58_Out-1378200520|)) (and .cse2 (= ~y$w_buff1~0_In-1378200520 |ULTIMATE.start_main_#t~ite58_Out-1378200520|) (not .cse1) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1378200520, ~y~0=~y~0_In-1378200520, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1378200520, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1378200520} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1378200520, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-1378200520|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1378200520|, ~y~0=~y~0_In-1378200520, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1378200520, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1378200520} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 20:48:28,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L851-->L851-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In920464421 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In920464421 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite60_Out920464421| 0)) (and (= ~y$w_buff0_used~0_In920464421 |ULTIMATE.start_main_#t~ite60_Out920464421|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In920464421, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In920464421} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out920464421|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In920464421, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In920464421} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 20:48:28,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L852-->L852-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd0~0_In-1071659972 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1071659972 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1071659972 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1071659972 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite61_Out-1071659972|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-1071659972 |ULTIMATE.start_main_#t~ite61_Out-1071659972|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1071659972, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1071659972, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1071659972, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1071659972} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1071659972|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1071659972, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1071659972, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1071659972, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1071659972} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 20:48:28,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L853-->L853-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In2136610479 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In2136610479 256) 0))) (or (and (= ~y$r_buff0_thd0~0_In2136610479 |ULTIMATE.start_main_#t~ite62_Out2136610479|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite62_Out2136610479|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2136610479, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2136610479} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out2136610479|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2136610479, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2136610479} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 20:48:28,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L854-->L854-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1297355272 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1297355272 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-1297355272 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1297355272 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite63_Out-1297355272|)) (and (or .cse1 .cse0) (= ~y$r_buff1_thd0~0_In-1297355272 |ULTIMATE.start_main_#t~ite63_Out-1297355272|) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1297355272, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1297355272, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1297355272, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1297355272} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1297355272|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1297355272, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1297355272, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1297355272, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1297355272} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 20:48:28,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~y$r_buff1_thd0~0_254 |v_ULTIMATE.start_main_#t~ite63_47|) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_29 0) (= 1 v_~__unbuffered_p0_EAX~0_29) (= 1 v_~__unbuffered_p1_EAX~0_47) (= v_~__unbuffered_p2_EBX~0_26 0) (= v_~__unbuffered_p0_EBX~0_29 0) (= 1 v_~__unbuffered_p2_EAX~0_23))) 1 0)) 0 1) v_~main$tmp_guard1~0_22) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_22 256))) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_47|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_29, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_46|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_29, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_254, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 20:48:28,512 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f0e34b8d-9436-44d2-ac35-127efbbb9bfe/bin/utaipan/witness.graphml [2019-12-07 20:48:28,512 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 20:48:28,513 INFO L168 Benchmark]: Toolchain (without parser) took 32145.40 ms. Allocated memory was 1.0 GB in the beginning and 4.5 GB in the end (delta: 3.4 GB). Free memory was 934.0 MB in the beginning and 1.5 GB in the end (delta: -606.7 MB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2019-12-07 20:48:28,513 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:48:28,513 INFO L168 Benchmark]: CACSL2BoogieTranslator took 408.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 68.7 MB). Free memory was 934.0 MB in the beginning and 1.0 GB in the end (delta: -100.9 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-12-07 20:48:28,513 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.28 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:48:28,514 INFO L168 Benchmark]: Boogie Preprocessor took 28.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:48:28,514 INFO L168 Benchmark]: RCFGBuilder took 436.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 968.8 MB in the end (delta: 60.8 MB). Peak memory consumption was 60.8 MB. Max. memory is 11.5 GB. [2019-12-07 20:48:28,514 INFO L168 Benchmark]: TraceAbstraction took 31151.15 ms. Allocated memory was 1.1 GB in the beginning and 4.5 GB in the end (delta: 3.4 GB). Free memory was 968.8 MB in the beginning and 1.6 GB in the end (delta: -631.8 MB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2019-12-07 20:48:28,514 INFO L168 Benchmark]: Witness Printer took 76.14 ms. Allocated memory is still 4.5 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 59.9 MB). Peak memory consumption was 59.9 MB. Max. memory is 11.5 GB. [2019-12-07 20:48:28,516 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 408.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 68.7 MB). Free memory was 934.0 MB in the beginning and 1.0 GB in the end (delta: -100.9 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.28 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 436.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 968.8 MB in the end (delta: 60.8 MB). Peak memory consumption was 60.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 31151.15 ms. Allocated memory was 1.1 GB in the beginning and 4.5 GB in the end (delta: 3.4 GB). Free memory was 968.8 MB in the beginning and 1.6 GB in the end (delta: -631.8 MB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. * Witness Printer took 76.14 ms. Allocated memory is still 4.5 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 59.9 MB). Peak memory consumption was 59.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 197 ProgramPointsBefore, 108 ProgramPointsAfterwards, 243 TransitionsBefore, 130 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 52 ConcurrentYvCompositions, 28 ChoiceCompositions, 9487 VarBasedMoverChecksPositive, 322 VarBasedMoverChecksNegative, 94 SemBasedMoverChecksPositive, 333 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 124432 CheckedPairsTotal, 127 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L840] FCALL, FORK 0 pthread_create(&t29, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L842] FCALL, FORK 0 pthread_create(&t30, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t31, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L792] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L793] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L794] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L795] 3 y$r_buff0_thd3 = (_Bool)1 [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 y$flush_delayed = weak$$choice2 [L801] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L804] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L805] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L805] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L808] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L810] 3 y = y$flush_delayed ? y$mem_tmp : y [L811] 3 y$flush_delayed = (_Bool)0 [L814] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L755] 2 x = 1 [L758] 2 __unbuffered_p1_EAX = x [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 y$flush_delayed = weak$$choice2 [L764] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L817] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L818] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L819] 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 [L765] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L766] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L767] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L768] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L769] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L771] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L771] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L846] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L850] 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) [L851] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L852] 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 [L853] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 188 locations, 2 error locations. Result: UNSAFE, OverallTime: 30.9s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3982 SDtfs, 6290 SDslu, 8668 SDs, 0 SdLazy, 4078 SolverSat, 228 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73414occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 28565 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 693 NumberOfCodeBlocks, 693 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 612 ConstructedInterpolants, 0 QuantifiedInterpolants, 234218 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...