./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix040_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_83d96d75-9f1f-415d-94a6-2fa0974d6c5a/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_83d96d75-9f1f-415d-94a6-2fa0974d6c5a/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_83d96d75-9f1f-415d-94a6-2fa0974d6c5a/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_83d96d75-9f1f-415d-94a6-2fa0974d6c5a/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix040_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_83d96d75-9f1f-415d-94a6-2fa0974d6c5a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_83d96d75-9f1f-415d-94a6-2fa0974d6c5a/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 205538613363e7ccc6823ef2dbf50310414045ea .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:20:58,535 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:20:58,536 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:20:58,544 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:20:58,544 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:20:58,545 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:20:58,546 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:20:58,548 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:20:58,549 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:20:58,550 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:20:58,550 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:20:58,551 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:20:58,551 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:20:58,552 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:20:58,553 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:20:58,553 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:20:58,554 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:20:58,555 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:20:58,556 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:20:58,557 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:20:58,558 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:20:58,559 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:20:58,560 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:20:58,560 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:20:58,562 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:20:58,562 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:20:58,562 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:20:58,563 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:20:58,563 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:20:58,563 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:20:58,563 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:20:58,564 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:20:58,564 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:20:58,565 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:20:58,566 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:20:58,566 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:20:58,567 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:20:58,567 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:20:58,567 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:20:58,568 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:20:58,568 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:20:58,569 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_83d96d75-9f1f-415d-94a6-2fa0974d6c5a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 20:20:58,582 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:20:58,582 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:20:58,583 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:20:58,583 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:20:58,583 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:20:58,584 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:20:58,584 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 20:20:58,584 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:20:58,584 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:20:58,584 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 20:20:58,585 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 20:20:58,585 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:20:58,585 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 20:20:58,585 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 20:20:58,585 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 20:20:58,586 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:20:58,586 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:20:58,586 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:20:58,586 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:20:58,587 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:20:58,587 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 20:20:58,587 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:20:58,587 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 20:20:58,587 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:20:58,588 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:20:58,588 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 20:20:58,588 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:20:58,588 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 20:20:58,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:20:58,588 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:20:58,589 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:20:58,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:20:58,589 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:20:58,589 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:20:58,589 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 20:20:58,589 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 20:20:58,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 20:20:58,590 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 20:20:58,590 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:20:58,590 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:20:58,590 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_83d96d75-9f1f-415d-94a6-2fa0974d6c5a/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 -> 205538613363e7ccc6823ef2dbf50310414045ea [2019-12-07 20:20:58,699 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:20:58,706 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:20:58,708 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:20:58,709 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:20:58,709 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:20:58,710 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_83d96d75-9f1f-415d-94a6-2fa0974d6c5a/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix040_power.opt.i [2019-12-07 20:20:58,746 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_83d96d75-9f1f-415d-94a6-2fa0974d6c5a/bin/utaipan/data/d1ecb8d6d/d72b62c6df724095a13472d01df87368/FLAGc62ec94d2 [2019-12-07 20:20:59,252 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:20:59,252 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_83d96d75-9f1f-415d-94a6-2fa0974d6c5a/sv-benchmarks/c/pthread-wmm/mix040_power.opt.i [2019-12-07 20:20:59,263 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_83d96d75-9f1f-415d-94a6-2fa0974d6c5a/bin/utaipan/data/d1ecb8d6d/d72b62c6df724095a13472d01df87368/FLAGc62ec94d2 [2019-12-07 20:20:59,273 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_83d96d75-9f1f-415d-94a6-2fa0974d6c5a/bin/utaipan/data/d1ecb8d6d/d72b62c6df724095a13472d01df87368 [2019-12-07 20:20:59,275 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:20:59,276 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:20:59,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:20:59,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:20:59,280 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:20:59,280 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:20:59" (1/1) ... [2019-12-07 20:20:59,282 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551fb3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:20:59, skipping insertion in model container [2019-12-07 20:20:59,282 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:20:59" (1/1) ... [2019-12-07 20:20:59,287 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:20:59,317 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:20:59,589 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:20:59,597 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:20:59,642 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:20:59,687 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:20:59,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:20:59 WrapperNode [2019-12-07 20:20:59,687 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:20:59,688 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:20:59,688 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:20:59,688 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:20:59,693 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:20:59" (1/1) ... [2019-12-07 20:20:59,706 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:20:59" (1/1) ... [2019-12-07 20:20:59,725 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:20:59,725 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:20:59,725 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:20:59,725 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:20:59,731 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:20:59" (1/1) ... [2019-12-07 20:20:59,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:20:59" (1/1) ... [2019-12-07 20:20:59,735 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:20:59" (1/1) ... [2019-12-07 20:20:59,735 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:20:59" (1/1) ... [2019-12-07 20:20:59,742 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:20:59" (1/1) ... [2019-12-07 20:20:59,744 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:20:59" (1/1) ... [2019-12-07 20:20:59,747 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:20:59" (1/1) ... [2019-12-07 20:20:59,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:20:59,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:20:59,750 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:20:59,750 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:20:59,751 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:20:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_83d96d75-9f1f-415d-94a6-2fa0974d6c5a/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:20:59,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 20:20:59,790 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 20:20:59,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 20:20:59,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 20:20:59,790 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 20:20:59,790 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 20:20:59,790 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 20:20:59,790 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 20:20:59,790 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 20:20:59,790 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 20:20:59,791 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 20:20:59,791 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 20:20:59,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 20:20:59,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:20:59,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:20:59,792 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:21:00,121 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:21:00,121 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 20:21:00,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:21:00 BoogieIcfgContainer [2019-12-07 20:21:00,122 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:21:00,123 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:21:00,123 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:21:00,124 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:21:00,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:20:59" (1/3) ... [2019-12-07 20:21:00,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b8012b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:21:00, skipping insertion in model container [2019-12-07 20:21:00,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:20:59" (2/3) ... [2019-12-07 20:21:00,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b8012b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:21:00, skipping insertion in model container [2019-12-07 20:21:00,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:21:00" (3/3) ... [2019-12-07 20:21:00,127 INFO L109 eAbstractionObserver]: Analyzing ICFG mix040_power.opt.i [2019-12-07 20:21:00,133 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 20:21:00,133 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:21:00,137 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 20:21:00,138 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 20:21:00,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,162 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,162 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,163 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,163 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,165 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,165 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,177 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,177 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,177 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,177 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,177 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,177 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,178 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,178 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,178 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,178 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,178 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,178 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,179 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,179 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,179 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,179 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,179 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,179 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,179 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,179 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,179 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,180 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,180 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,180 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,180 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,180 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,180 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,180 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,180 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,181 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,181 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,181 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,181 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,181 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:21:00,193 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 20:21:00,205 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:21:00,205 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 20:21:00,205 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:21:00,205 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:21:00,206 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:21:00,206 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:21:00,206 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:21:00,206 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:21:00,218 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 191 transitions [2019-12-07 20:21:00,219 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 169 places, 191 transitions [2019-12-07 20:21:00,281 INFO L134 PetriNetUnfolder]: 35/187 cut-off events. [2019-12-07 20:21:00,281 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 20:21:00,291 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 187 events. 35/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 576 event pairs. 12/162 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-07 20:21:00,302 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 169 places, 191 transitions [2019-12-07 20:21:00,337 INFO L134 PetriNetUnfolder]: 35/187 cut-off events. [2019-12-07 20:21:00,337 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 20:21:00,342 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 187 events. 35/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 576 event pairs. 12/162 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-07 20:21:00,354 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-07 20:21:00,355 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 20:21:03,153 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-12-07 20:21:03,350 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-07 20:21:03,451 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46301 [2019-12-07 20:21:03,452 INFO L214 etLargeBlockEncoding]: Total number of compositions: 118 [2019-12-07 20:21:03,454 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 83 transitions [2019-12-07 20:21:04,890 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27254 states. [2019-12-07 20:21:04,892 INFO L276 IsEmpty]: Start isEmpty. Operand 27254 states. [2019-12-07 20:21:04,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 20:21:04,896 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:21:04,897 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:21:04,897 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:21:04,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:21:04,900 INFO L82 PathProgramCache]: Analyzing trace with hash -2114616633, now seen corresponding path program 1 times [2019-12-07 20:21:04,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:21:04,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173231033] [2019-12-07 20:21:04,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:21:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:21:05,065 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:21:05,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173231033] [2019-12-07 20:21:05,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:21:05,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 20:21:05,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218096339] [2019-12-07 20:21:05,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:21:05,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:21:05,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:21:05,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:21:05,080 INFO L87 Difference]: Start difference. First operand 27254 states. Second operand 3 states. [2019-12-07 20:21:05,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:21:05,406 INFO L93 Difference]: Finished difference Result 26518 states and 112736 transitions. [2019-12-07 20:21:05,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:21:05,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 20:21:05,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:21:05,588 INFO L225 Difference]: With dead ends: 26518 [2019-12-07 20:21:05,588 INFO L226 Difference]: Without dead ends: 24958 [2019-12-07 20:21:05,589 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:21:05,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24958 states. [2019-12-07 20:21:06,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24958 to 24958. [2019-12-07 20:21:06,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24958 states. [2019-12-07 20:21:06,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24958 states to 24958 states and 105960 transitions. [2019-12-07 20:21:06,499 INFO L78 Accepts]: Start accepts. Automaton has 24958 states and 105960 transitions. Word has length 9 [2019-12-07 20:21:06,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:21:06,500 INFO L462 AbstractCegarLoop]: Abstraction has 24958 states and 105960 transitions. [2019-12-07 20:21:06,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:21:06,500 INFO L276 IsEmpty]: Start isEmpty. Operand 24958 states and 105960 transitions. [2019-12-07 20:21:06,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 20:21:06,508 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:21:06,508 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:21:06,508 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:21:06,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:21:06,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1982620494, now seen corresponding path program 1 times [2019-12-07 20:21:06,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:21:06,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047377217] [2019-12-07 20:21:06,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:21:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:21:06,601 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:21:06,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047377217] [2019-12-07 20:21:06,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:21:06,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:21:06,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548642802] [2019-12-07 20:21:06,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:21:06,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:21:06,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:21:06,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:21:06,603 INFO L87 Difference]: Start difference. First operand 24958 states and 105960 transitions. Second operand 4 states. [2019-12-07 20:21:06,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:21:06,969 INFO L93 Difference]: Finished difference Result 37710 states and 155548 transitions. [2019-12-07 20:21:06,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:21:06,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 20:21:06,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:21:07,174 INFO L225 Difference]: With dead ends: 37710 [2019-12-07 20:21:07,174 INFO L226 Difference]: Without dead ends: 37654 [2019-12-07 20:21:07,175 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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:21:07,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37654 states. [2019-12-07 20:21:08,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37654 to 32850. [2019-12-07 20:21:08,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32850 states. [2019-12-07 20:21:08,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32850 states to 32850 states and 137140 transitions. [2019-12-07 20:21:08,084 INFO L78 Accepts]: Start accepts. Automaton has 32850 states and 137140 transitions. Word has length 15 [2019-12-07 20:21:08,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:21:08,084 INFO L462 AbstractCegarLoop]: Abstraction has 32850 states and 137140 transitions. [2019-12-07 20:21:08,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:21:08,084 INFO L276 IsEmpty]: Start isEmpty. Operand 32850 states and 137140 transitions. [2019-12-07 20:21:08,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 20:21:08,090 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:21:08,090 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:21:08,090 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:21:08,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:21:08,090 INFO L82 PathProgramCache]: Analyzing trace with hash 965433528, now seen corresponding path program 1 times [2019-12-07 20:21:08,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:21:08,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889257095] [2019-12-07 20:21:08,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:21:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:21:08,140 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:21:08,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889257095] [2019-12-07 20:21:08,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:21:08,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:21:08,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882138085] [2019-12-07 20:21:08,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:21:08,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:21:08,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:21:08,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:21:08,142 INFO L87 Difference]: Start difference. First operand 32850 states and 137140 transitions. Second operand 4 states. [2019-12-07 20:21:08,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:21:08,505 INFO L93 Difference]: Finished difference Result 42390 states and 176044 transitions. [2019-12-07 20:21:08,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:21:08,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 20:21:08,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:21:08,601 INFO L225 Difference]: With dead ends: 42390 [2019-12-07 20:21:08,601 INFO L226 Difference]: Without dead ends: 42338 [2019-12-07 20:21:08,602 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:21:08,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42338 states. [2019-12-07 20:21:09,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42338 to 35874. [2019-12-07 20:21:09,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35874 states. [2019-12-07 20:21:09,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35874 states to 35874 states and 149792 transitions. [2019-12-07 20:21:09,379 INFO L78 Accepts]: Start accepts. Automaton has 35874 states and 149792 transitions. Word has length 18 [2019-12-07 20:21:09,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:21:09,380 INFO L462 AbstractCegarLoop]: Abstraction has 35874 states and 149792 transitions. [2019-12-07 20:21:09,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:21:09,380 INFO L276 IsEmpty]: Start isEmpty. Operand 35874 states and 149792 transitions. [2019-12-07 20:21:09,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 20:21:09,389 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:21:09,389 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:21:09,389 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:21:09,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:21:09,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1915727965, now seen corresponding path program 1 times [2019-12-07 20:21:09,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:21:09,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569732914] [2019-12-07 20:21:09,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:21:09,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:21:09,428 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:21:09,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569732914] [2019-12-07 20:21:09,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:21:09,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:21:09,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712514746] [2019-12-07 20:21:09,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:21:09,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:21:09,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:21:09,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:21:09,430 INFO L87 Difference]: Start difference. First operand 35874 states and 149792 transitions. Second operand 3 states. [2019-12-07 20:21:09,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:21:09,670 INFO L93 Difference]: Finished difference Result 33990 states and 140132 transitions. [2019-12-07 20:21:09,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:21:09,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 20:21:09,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:21:09,738 INFO L225 Difference]: With dead ends: 33990 [2019-12-07 20:21:09,738 INFO L226 Difference]: Without dead ends: 33990 [2019-12-07 20:21:09,738 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:21:09,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33990 states. [2019-12-07 20:21:10,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33990 to 33286. [2019-12-07 20:21:10,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33286 states. [2019-12-07 20:21:10,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33286 states to 33286 states and 137292 transitions. [2019-12-07 20:21:10,581 INFO L78 Accepts]: Start accepts. Automaton has 33286 states and 137292 transitions. Word has length 20 [2019-12-07 20:21:10,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:21:10,581 INFO L462 AbstractCegarLoop]: Abstraction has 33286 states and 137292 transitions. [2019-12-07 20:21:10,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:21:10,581 INFO L276 IsEmpty]: Start isEmpty. Operand 33286 states and 137292 transitions. [2019-12-07 20:21:10,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 20:21:10,587 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:21:10,588 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:21:10,588 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:21:10,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:21:10,588 INFO L82 PathProgramCache]: Analyzing trace with hash -480610237, now seen corresponding path program 1 times [2019-12-07 20:21:10,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:21:10,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795085309] [2019-12-07 20:21:10,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:21:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:21:10,660 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:21:10,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795085309] [2019-12-07 20:21:10,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:21:10,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 20:21:10,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453043299] [2019-12-07 20:21:10,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:21:10,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:21:10,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:21:10,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:21:10,661 INFO L87 Difference]: Start difference. First operand 33286 states and 137292 transitions. Second operand 3 states. [2019-12-07 20:21:10,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:21:10,883 INFO L93 Difference]: Finished difference Result 58153 states and 229521 transitions. [2019-12-07 20:21:10,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:21:10,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 20:21:10,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:21:11,003 INFO L225 Difference]: With dead ends: 58153 [2019-12-07 20:21:11,003 INFO L226 Difference]: Without dead ends: 56257 [2019-12-07 20:21:11,003 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:21:11,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56257 states. [2019-12-07 20:21:12,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56257 to 54016. [2019-12-07 20:21:12,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54016 states. [2019-12-07 20:21:12,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54016 states to 54016 states and 213839 transitions. [2019-12-07 20:21:12,204 INFO L78 Accepts]: Start accepts. Automaton has 54016 states and 213839 transitions. Word has length 20 [2019-12-07 20:21:12,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:21:12,204 INFO L462 AbstractCegarLoop]: Abstraction has 54016 states and 213839 transitions. [2019-12-07 20:21:12,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:21:12,204 INFO L276 IsEmpty]: Start isEmpty. Operand 54016 states and 213839 transitions. [2019-12-07 20:21:12,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 20:21:12,217 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:21:12,218 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] [2019-12-07 20:21:12,218 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:21:12,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:21:12,218 INFO L82 PathProgramCache]: Analyzing trace with hash 732387999, now seen corresponding path program 1 times [2019-12-07 20:21:12,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:21:12,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261244270] [2019-12-07 20:21:12,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:21:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:21:12,265 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:21:12,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261244270] [2019-12-07 20:21:12,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:21:12,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:21:12,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024291571] [2019-12-07 20:21:12,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:21:12,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:21:12,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:21:12,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:21:12,267 INFO L87 Difference]: Start difference. First operand 54016 states and 213839 transitions. Second operand 4 states. [2019-12-07 20:21:12,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:21:12,481 INFO L93 Difference]: Finished difference Result 55350 states and 217039 transitions. [2019-12-07 20:21:12,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:21:12,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 20:21:12,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:21:12,598 INFO L225 Difference]: With dead ends: 55350 [2019-12-07 20:21:12,599 INFO L226 Difference]: Without dead ends: 55350 [2019-12-07 20:21:12,599 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:21:12,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55350 states. [2019-12-07 20:21:13,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55350 to 50220. [2019-12-07 20:21:13,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50220 states. [2019-12-07 20:21:13,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50220 states to 50220 states and 199318 transitions. [2019-12-07 20:21:13,737 INFO L78 Accepts]: Start accepts. Automaton has 50220 states and 199318 transitions. Word has length 21 [2019-12-07 20:21:13,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:21:13,738 INFO L462 AbstractCegarLoop]: Abstraction has 50220 states and 199318 transitions. [2019-12-07 20:21:13,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:21:13,738 INFO L276 IsEmpty]: Start isEmpty. Operand 50220 states and 199318 transitions. [2019-12-07 20:21:13,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 20:21:13,752 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:21:13,752 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] [2019-12-07 20:21:13,752 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:21:13,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:21:13,752 INFO L82 PathProgramCache]: Analyzing trace with hash -2001005515, now seen corresponding path program 1 times [2019-12-07 20:21:13,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:21:13,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030688332] [2019-12-07 20:21:13,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:21:13,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:21:13,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:21:13,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030688332] [2019-12-07 20:21:13,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:21:13,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:21:13,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647623240] [2019-12-07 20:21:13,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:21:13,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:21:13,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:21:13,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:21:13,808 INFO L87 Difference]: Start difference. First operand 50220 states and 199318 transitions. Second operand 4 states. [2019-12-07 20:21:14,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:21:14,017 INFO L93 Difference]: Finished difference Result 53688 states and 210483 transitions. [2019-12-07 20:21:14,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:21:14,018 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 20:21:14,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:21:14,130 INFO L225 Difference]: With dead ends: 53688 [2019-12-07 20:21:14,130 INFO L226 Difference]: Without dead ends: 53056 [2019-12-07 20:21:14,130 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:21:14,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53056 states. [2019-12-07 20:21:15,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53056 to 48998. [2019-12-07 20:21:15,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48998 states. [2019-12-07 20:21:16,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48998 states to 48998 states and 193996 transitions. [2019-12-07 20:21:16,266 INFO L78 Accepts]: Start accepts. Automaton has 48998 states and 193996 transitions. Word has length 22 [2019-12-07 20:21:16,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:21:16,266 INFO L462 AbstractCegarLoop]: Abstraction has 48998 states and 193996 transitions. [2019-12-07 20:21:16,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:21:16,266 INFO L276 IsEmpty]: Start isEmpty. Operand 48998 states and 193996 transitions. [2019-12-07 20:21:16,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 20:21:16,281 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:21:16,281 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:21:16,281 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:21:16,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:21:16,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1352926639, now seen corresponding path program 1 times [2019-12-07 20:21:16,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:21:16,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087311748] [2019-12-07 20:21:16,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:21:16,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:21:16,339 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:21:16,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087311748] [2019-12-07 20:21:16,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:21:16,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:21:16,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515927743] [2019-12-07 20:21:16,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:21:16,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:21:16,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:21:16,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:21:16,340 INFO L87 Difference]: Start difference. First operand 48998 states and 193996 transitions. Second operand 4 states. [2019-12-07 20:21:16,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:21:16,634 INFO L93 Difference]: Finished difference Result 72764 states and 275197 transitions. [2019-12-07 20:21:16,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:21:16,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-07 20:21:16,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:21:16,725 INFO L225 Difference]: With dead ends: 72764 [2019-12-07 20:21:16,725 INFO L226 Difference]: Without dead ends: 47746 [2019-12-07 20:21:16,725 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:21:16,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47746 states. [2019-12-07 20:21:17,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47746 to 43534. [2019-12-07 20:21:17,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43534 states. [2019-12-07 20:21:17,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43534 states to 43534 states and 152674 transitions. [2019-12-07 20:21:17,582 INFO L78 Accepts]: Start accepts. Automaton has 43534 states and 152674 transitions. Word has length 23 [2019-12-07 20:21:17,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:21:17,582 INFO L462 AbstractCegarLoop]: Abstraction has 43534 states and 152674 transitions. [2019-12-07 20:21:17,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:21:17,582 INFO L276 IsEmpty]: Start isEmpty. Operand 43534 states and 152674 transitions. [2019-12-07 20:21:17,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 20:21:17,595 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:21:17,595 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:21:17,595 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:21:17,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:21:17,595 INFO L82 PathProgramCache]: Analyzing trace with hash 26385379, now seen corresponding path program 1 times [2019-12-07 20:21:17,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:21:17,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834262699] [2019-12-07 20:21:17,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:21:17,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:21:17,645 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:21:17,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834262699] [2019-12-07 20:21:17,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:21:17,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:21:17,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379606092] [2019-12-07 20:21:17,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:21:17,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:21:17,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:21:17,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:21:17,646 INFO L87 Difference]: Start difference. First operand 43534 states and 152674 transitions. Second operand 4 states. [2019-12-07 20:21:17,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:21:17,817 INFO L93 Difference]: Finished difference Result 52239 states and 178495 transitions. [2019-12-07 20:21:17,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:21:17,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-07 20:21:17,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:21:17,850 INFO L225 Difference]: With dead ends: 52239 [2019-12-07 20:21:17,851 INFO L226 Difference]: Without dead ends: 20663 [2019-12-07 20:21:17,851 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:21:17,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20663 states. [2019-12-07 20:21:18,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20663 to 18322. [2019-12-07 20:21:18,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18322 states. [2019-12-07 20:21:18,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18322 states to 18322 states and 58850 transitions. [2019-12-07 20:21:18,260 INFO L78 Accepts]: Start accepts. Automaton has 18322 states and 58850 transitions. Word has length 23 [2019-12-07 20:21:18,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:21:18,260 INFO L462 AbstractCegarLoop]: Abstraction has 18322 states and 58850 transitions. [2019-12-07 20:21:18,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:21:18,260 INFO L276 IsEmpty]: Start isEmpty. Operand 18322 states and 58850 transitions. [2019-12-07 20:21:18,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 20:21:18,266 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:21:18,266 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] [2019-12-07 20:21:18,266 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:21:18,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:21:18,267 INFO L82 PathProgramCache]: Analyzing trace with hash -539616687, now seen corresponding path program 1 times [2019-12-07 20:21:18,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:21:18,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494815499] [2019-12-07 20:21:18,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:21:18,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:21:18,289 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:21:18,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494815499] [2019-12-07 20:21:18,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:21:18,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:21:18,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744797700] [2019-12-07 20:21:18,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:21:18,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:21:18,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:21:18,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:21:18,291 INFO L87 Difference]: Start difference. First operand 18322 states and 58850 transitions. Second operand 4 states. [2019-12-07 20:21:18,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:21:18,328 INFO L93 Difference]: Finished difference Result 10083 states and 30391 transitions. [2019-12-07 20:21:18,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:21:18,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-12-07 20:21:18,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:21:18,339 INFO L225 Difference]: With dead ends: 10083 [2019-12-07 20:21:18,339 INFO L226 Difference]: Without dead ends: 10083 [2019-12-07 20:21:18,339 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:21:18,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10083 states. [2019-12-07 20:21:18,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10083 to 10083. [2019-12-07 20:21:18,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10083 states. [2019-12-07 20:21:18,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10083 states to 10083 states and 30391 transitions. [2019-12-07 20:21:18,476 INFO L78 Accepts]: Start accepts. Automaton has 10083 states and 30391 transitions. Word has length 24 [2019-12-07 20:21:18,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:21:18,477 INFO L462 AbstractCegarLoop]: Abstraction has 10083 states and 30391 transitions. [2019-12-07 20:21:18,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:21:18,477 INFO L276 IsEmpty]: Start isEmpty. Operand 10083 states and 30391 transitions. [2019-12-07 20:21:18,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 20:21:18,480 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:21:18,480 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:21:18,481 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:21:18,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:21:18,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1260824645, now seen corresponding path program 1 times [2019-12-07 20:21:18,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:21:18,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470149064] [2019-12-07 20:21:18,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:21:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:21:18,510 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:21:18,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470149064] [2019-12-07 20:21:18,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:21:18,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:21:18,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26076186] [2019-12-07 20:21:18,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:21:18,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:21:18,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:21:18,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:21:18,511 INFO L87 Difference]: Start difference. First operand 10083 states and 30391 transitions. Second operand 4 states. [2019-12-07 20:21:18,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:21:18,558 INFO L93 Difference]: Finished difference Result 14213 states and 43533 transitions. [2019-12-07 20:21:18,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:21:18,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-07 20:21:18,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:21:18,566 INFO L225 Difference]: With dead ends: 14213 [2019-12-07 20:21:18,566 INFO L226 Difference]: Without dead ends: 6999 [2019-12-07 20:21:18,566 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:21:18,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6999 states. [2019-12-07 20:21:18,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6999 to 6692. [2019-12-07 20:21:18,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6692 states. [2019-12-07 20:21:18,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6692 states to 6692 states and 19965 transitions. [2019-12-07 20:21:18,666 INFO L78 Accepts]: Start accepts. Automaton has 6692 states and 19965 transitions. Word has length 25 [2019-12-07 20:21:18,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:21:18,667 INFO L462 AbstractCegarLoop]: Abstraction has 6692 states and 19965 transitions. [2019-12-07 20:21:18,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:21:18,667 INFO L276 IsEmpty]: Start isEmpty. Operand 6692 states and 19965 transitions. [2019-12-07 20:21:18,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 20:21:18,670 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:21:18,671 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:21:18,671 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:21:18,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:21:18,671 INFO L82 PathProgramCache]: Analyzing trace with hash 762474207, now seen corresponding path program 2 times [2019-12-07 20:21:18,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:21:18,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192316596] [2019-12-07 20:21:18,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:21:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:21:18,707 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:21:18,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192316596] [2019-12-07 20:21:18,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:21:18,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:21:18,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781387744] [2019-12-07 20:21:18,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:21:18,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:21:18,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:21:18,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:21:18,709 INFO L87 Difference]: Start difference. First operand 6692 states and 19965 transitions. Second operand 5 states. [2019-12-07 20:21:18,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:21:18,734 INFO L93 Difference]: Finished difference Result 1867 states and 4476 transitions. [2019-12-07 20:21:18,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:21:18,734 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 20:21:18,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:21:18,736 INFO L225 Difference]: With dead ends: 1867 [2019-12-07 20:21:18,736 INFO L226 Difference]: Without dead ends: 1867 [2019-12-07 20:21:18,736 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:21:18,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1867 states. [2019-12-07 20:21:18,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1867 to 1867. [2019-12-07 20:21:18,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1867 states. [2019-12-07 20:21:18,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1867 states and 4476 transitions. [2019-12-07 20:21:18,754 INFO L78 Accepts]: Start accepts. Automaton has 1867 states and 4476 transitions. Word has length 25 [2019-12-07 20:21:18,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:21:18,754 INFO L462 AbstractCegarLoop]: Abstraction has 1867 states and 4476 transitions. [2019-12-07 20:21:18,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:21:18,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1867 states and 4476 transitions. [2019-12-07 20:21:18,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 20:21:18,756 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:21:18,756 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] [2019-12-07 20:21:18,756 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:21:18,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:21:18,756 INFO L82 PathProgramCache]: Analyzing trace with hash -617388800, now seen corresponding path program 1 times [2019-12-07 20:21:18,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:21:18,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910353003] [2019-12-07 20:21:18,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:21:18,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:21:18,776 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:21:18,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910353003] [2019-12-07 20:21:18,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:21:18,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:21:18,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991906320] [2019-12-07 20:21:18,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:21:18,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:21:18,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:21:18,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:21:18,778 INFO L87 Difference]: Start difference. First operand 1867 states and 4476 transitions. Second operand 3 states. [2019-12-07 20:21:18,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:21:18,810 INFO L93 Difference]: Finished difference Result 2750 states and 6557 transitions. [2019-12-07 20:21:18,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:21:18,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-07 20:21:18,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:21:18,814 INFO L225 Difference]: With dead ends: 2750 [2019-12-07 20:21:18,814 INFO L226 Difference]: Without dead ends: 2750 [2019-12-07 20:21:18,814 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:21:18,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2019-12-07 20:21:18,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2208. [2019-12-07 20:21:18,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2208 states. [2019-12-07 20:21:18,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2208 states to 2208 states and 5290 transitions. [2019-12-07 20:21:18,846 INFO L78 Accepts]: Start accepts. Automaton has 2208 states and 5290 transitions. Word has length 32 [2019-12-07 20:21:18,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:21:18,846 INFO L462 AbstractCegarLoop]: Abstraction has 2208 states and 5290 transitions. [2019-12-07 20:21:18,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:21:18,846 INFO L276 IsEmpty]: Start isEmpty. Operand 2208 states and 5290 transitions. [2019-12-07 20:21:18,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 20:21:18,849 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:21:18,849 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] [2019-12-07 20:21:18,849 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:21:18,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:21:18,850 INFO L82 PathProgramCache]: Analyzing trace with hash 937445460, now seen corresponding path program 1 times [2019-12-07 20:21:18,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:21:18,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3302918] [2019-12-07 20:21:18,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:21:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:21:18,873 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:21:18,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3302918] [2019-12-07 20:21:18,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:21:18,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:21:18,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222292192] [2019-12-07 20:21:18,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:21:18,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:21:18,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:21:18,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:21:18,874 INFO L87 Difference]: Start difference. First operand 2208 states and 5290 transitions. Second operand 3 states. [2019-12-07 20:21:18,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:21:18,898 INFO L93 Difference]: Finished difference Result 2750 states and 6401 transitions. [2019-12-07 20:21:18,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:21:18,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-07 20:21:18,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:21:18,901 INFO L225 Difference]: With dead ends: 2750 [2019-12-07 20:21:18,901 INFO L226 Difference]: Without dead ends: 2750 [2019-12-07 20:21:18,901 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:21:18,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2019-12-07 20:21:18,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2186. [2019-12-07 20:21:18,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2186 states. [2019-12-07 20:21:18,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2186 states to 2186 states and 5092 transitions. [2019-12-07 20:21:18,922 INFO L78 Accepts]: Start accepts. Automaton has 2186 states and 5092 transitions. Word has length 32 [2019-12-07 20:21:18,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:21:18,922 INFO L462 AbstractCegarLoop]: Abstraction has 2186 states and 5092 transitions. [2019-12-07 20:21:18,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:21:18,922 INFO L276 IsEmpty]: Start isEmpty. Operand 2186 states and 5092 transitions. [2019-12-07 20:21:18,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 20:21:18,924 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:21:18,924 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] [2019-12-07 20:21:18,924 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:21:18,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:21:18,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1469218903, now seen corresponding path program 1 times [2019-12-07 20:21:18,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:21:18,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489482437] [2019-12-07 20:21:18,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:21:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:21:18,986 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:21:18,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489482437] [2019-12-07 20:21:18,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:21:18,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:21:18,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072910505] [2019-12-07 20:21:18,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:21:18,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:21:18,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:21:18,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:21:18,987 INFO L87 Difference]: Start difference. First operand 2186 states and 5092 transitions. Second operand 6 states. [2019-12-07 20:21:19,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:21:19,185 INFO L93 Difference]: Finished difference Result 3546 states and 8043 transitions. [2019-12-07 20:21:19,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 20:21:19,185 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-07 20:21:19,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:21:19,189 INFO L225 Difference]: With dead ends: 3546 [2019-12-07 20:21:19,189 INFO L226 Difference]: Without dead ends: 3426 [2019-12-07 20:21:19,189 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:21:19,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3426 states. [2019-12-07 20:21:19,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3426 to 2150. [2019-12-07 20:21:19,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2150 states. [2019-12-07 20:21:19,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2150 states to 2150 states and 4964 transitions. [2019-12-07 20:21:19,219 INFO L78 Accepts]: Start accepts. Automaton has 2150 states and 4964 transitions. Word has length 32 [2019-12-07 20:21:19,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:21:19,220 INFO L462 AbstractCegarLoop]: Abstraction has 2150 states and 4964 transitions. [2019-12-07 20:21:19,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:21:19,220 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 4964 transitions. [2019-12-07 20:21:19,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 20:21:19,221 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:21:19,222 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] [2019-12-07 20:21:19,222 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:21:19,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:21:19,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1277869158, now seen corresponding path program 1 times [2019-12-07 20:21:19,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:21:19,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314376391] [2019-12-07 20:21:19,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:21:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:21:19,301 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:21:19,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314376391] [2019-12-07 20:21:19,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:21:19,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:21:19,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416713966] [2019-12-07 20:21:19,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:21:19,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:21:19,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:21:19,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:21:19,302 INFO L87 Difference]: Start difference. First operand 2150 states and 4964 transitions. Second operand 6 states. [2019-12-07 20:21:19,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:21:19,524 INFO L93 Difference]: Finished difference Result 2991 states and 6791 transitions. [2019-12-07 20:21:19,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 20:21:19,524 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-07 20:21:19,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:21:19,526 INFO L225 Difference]: With dead ends: 2991 [2019-12-07 20:21:19,526 INFO L226 Difference]: Without dead ends: 2739 [2019-12-07 20:21:19,526 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:21:19,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2739 states. [2019-12-07 20:21:19,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2739 to 1872. [2019-12-07 20:21:19,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1872 states. [2019-12-07 20:21:19,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1872 states and 4205 transitions. [2019-12-07 20:21:19,544 INFO L78 Accepts]: Start accepts. Automaton has 1872 states and 4205 transitions. Word has length 33 [2019-12-07 20:21:19,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:21:19,544 INFO L462 AbstractCegarLoop]: Abstraction has 1872 states and 4205 transitions. [2019-12-07 20:21:19,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:21:19,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1872 states and 4205 transitions. [2019-12-07 20:21:19,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 20:21:19,546 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:21:19,546 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:21:19,546 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:21:19,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:21:19,546 INFO L82 PathProgramCache]: Analyzing trace with hash -926430000, now seen corresponding path program 1 times [2019-12-07 20:21:19,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:21:19,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557338944] [2019-12-07 20:21:19,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:21:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:21:19,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:21:19,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557338944] [2019-12-07 20:21:19,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:21:19,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:21:19,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086833582] [2019-12-07 20:21:19,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:21:19,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:21:19,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:21:19,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:21:19,593 INFO L87 Difference]: Start difference. First operand 1872 states and 4205 transitions. Second operand 6 states. [2019-12-07 20:21:19,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:21:19,620 INFO L93 Difference]: Finished difference Result 1153 states and 2513 transitions. [2019-12-07 20:21:19,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:21:19,620 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-07 20:21:19,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:21:19,620 INFO L225 Difference]: With dead ends: 1153 [2019-12-07 20:21:19,620 INFO L226 Difference]: Without dead ends: 514 [2019-12-07 20:21:19,621 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:21:19,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-12-07 20:21:19,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2019-12-07 20:21:19,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2019-12-07 20:21:19,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 1102 transitions. [2019-12-07 20:21:19,625 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 1102 transitions. Word has length 34 [2019-12-07 20:21:19,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:21:19,625 INFO L462 AbstractCegarLoop]: Abstraction has 514 states and 1102 transitions. [2019-12-07 20:21:19,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:21:19,625 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 1102 transitions. [2019-12-07 20:21:19,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 20:21:19,626 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:21:19,626 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] [2019-12-07 20:21:19,626 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:21:19,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:21:19,626 INFO L82 PathProgramCache]: Analyzing trace with hash 616592385, now seen corresponding path program 1 times [2019-12-07 20:21:19,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:21:19,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321957821] [2019-12-07 20:21:19,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:21:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:21:19,824 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:21:19,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321957821] [2019-12-07 20:21:19,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:21:19,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 20:21:19,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485377117] [2019-12-07 20:21:19,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 20:21:19,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:21:19,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 20:21:19,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-07 20:21:19,825 INFO L87 Difference]: Start difference. First operand 514 states and 1102 transitions. Second operand 12 states. [2019-12-07 20:21:20,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:21:20,545 INFO L93 Difference]: Finished difference Result 1031 states and 2110 transitions. [2019-12-07 20:21:20,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 20:21:20,546 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-07 20:21:20,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:21:20,546 INFO L225 Difference]: With dead ends: 1031 [2019-12-07 20:21:20,546 INFO L226 Difference]: Without dead ends: 570 [2019-12-07 20:21:20,547 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=649, Unknown=0, NotChecked=0, Total=812 [2019-12-07 20:21:20,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-12-07 20:21:20,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 534. [2019-12-07 20:21:20,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-12-07 20:21:20,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 1128 transitions. [2019-12-07 20:21:20,551 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 1128 transitions. Word has length 48 [2019-12-07 20:21:20,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:21:20,552 INFO L462 AbstractCegarLoop]: Abstraction has 534 states and 1128 transitions. [2019-12-07 20:21:20,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 20:21:20,552 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 1128 transitions. [2019-12-07 20:21:20,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 20:21:20,553 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:21:20,553 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] [2019-12-07 20:21:20,553 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:21:20,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:21:20,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1640819455, now seen corresponding path program 2 times [2019-12-07 20:21:20,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:21:20,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781837046] [2019-12-07 20:21:20,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:21:20,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:21:20,625 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:21:20,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781837046] [2019-12-07 20:21:20,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:21:20,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 20:21:20,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018989778] [2019-12-07 20:21:20,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 20:21:20,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:21:20,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 20:21:20,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:21:20,627 INFO L87 Difference]: Start difference. First operand 534 states and 1128 transitions. Second operand 7 states. [2019-12-07 20:21:20,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:21:20,779 INFO L93 Difference]: Finished difference Result 907 states and 1879 transitions. [2019-12-07 20:21:20,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 20:21:20,779 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-07 20:21:20,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:21:20,780 INFO L225 Difference]: With dead ends: 907 [2019-12-07 20:21:20,780 INFO L226 Difference]: Without dead ends: 613 [2019-12-07 20:21:20,780 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-07 20:21:20,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-12-07 20:21:20,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 547. [2019-12-07 20:21:20,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-12-07 20:21:20,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1141 transitions. [2019-12-07 20:21:20,785 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 1141 transitions. Word has length 48 [2019-12-07 20:21:20,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:21:20,785 INFO L462 AbstractCegarLoop]: Abstraction has 547 states and 1141 transitions. [2019-12-07 20:21:20,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 20:21:20,785 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1141 transitions. [2019-12-07 20:21:20,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 20:21:20,786 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:21:20,786 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] [2019-12-07 20:21:20,786 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:21:20,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:21:20,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1502542547, now seen corresponding path program 3 times [2019-12-07 20:21:20,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:21:20,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021502089] [2019-12-07 20:21:20,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:21:20,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 20:21:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 20:21:20,851 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 20:21:20,851 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 20:21:20,853 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] ULTIMATE.startENTRY-->L841: Formula: (let ((.cse0 (store |v_#valid_97| 0 0))) (and (= 0 v_~z$r_buff1_thd1~0_69) (= 0 v_~z$r_buff1_thd2~0_69) (= v_~z$w_buff0~0_326 0) (= 0 v_~z$r_buff1_thd4~0_128) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= 0 v_~__unbuffered_p3_EBX~0_104) (= v_~b~0_46 0) (= v_~weak$$choice2~0_157 0) (= 0 v_~__unbuffered_p2_EAX~0_59) (= 0 v_~z$r_buff0_thd3~0_271) (= v_~z$r_buff0_thd0~0_83 0) (= 0 v_~z$flush_delayed~0_78) (= v_~main$tmp_guard1~0_45 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1061~0.base_46| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1061~0.base_46|) |v_ULTIMATE.start_main_~#t1061~0.offset_30| 0)) |v_#memory_int_25|) (= v_~a~0_68 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1061~0.base_46|)) (= v_~z$r_buff0_thd1~0_26 0) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~weak$$choice0~0_39) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z~0_172 0) (= 0 v_~z$r_buff0_thd4~0_139) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1061~0.base_46|) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t1061~0.base_46| 4)) (= v_~y~0_82 0) (= |v_#valid_95| (store .cse0 |v_ULTIMATE.start_main_~#t1061~0.base_46| 1)) (= v_~z$read_delayed~0_7 0) (= 0 |v_ULTIMATE.start_main_~#t1061~0.offset_30|) (< 0 |v_#StackHeapBarrier_20|) (= 0 v_~z$r_buff1_thd3~0_242) (= 0 |v_#NULL.base_7|) (= v_~z$mem_tmp~0_49 0) (= v_~z$w_buff1_used~0_372 0) (= v_~z$r_buff1_thd0~0_144 0) (= v_~z$w_buff0_used~0_607 0) (= v_~x~0_74 0) (= v_~__unbuffered_p3_EAX~0_105 0) (= v_~z$w_buff1~0_201 0) (= v_~__unbuffered_cnt~0_157 0) (= v_~z$r_buff0_thd2~0_25 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_97|, #memory_int=|v_#memory_int_26|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_69, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t1063~0.offset=|v_ULTIMATE.start_main_~#t1063~0.offset_29|, ~a~0=v_~a~0_68, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_83, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_139, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_105, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_59, ~z$mem_tmp~0=v_~z$mem_tmp~0_49, ULTIMATE.start_main_~#t1062~0.base=|v_ULTIMATE.start_main_~#t1062~0.base_45|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_28|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_372, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_42|, ~z$flush_delayed~0=v_~z$flush_delayed~0_78, ~weak$$choice0~0=v_~weak$$choice0~0_39, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_~#t1063~0.base=|v_ULTIMATE.start_main_~#t1063~0.base_45|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_26|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_69, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_271, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_157, ~x~0=v_~x~0_74, ULTIMATE.start_main_~#t1064~0.offset=|v_ULTIMATE.start_main_~#t1064~0.offset_19|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_128, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_22|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_201, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ULTIMATE.start_main_~#t1061~0.base=|v_ULTIMATE.start_main_~#t1061~0.base_46|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_144, ULTIMATE.start_main_~#t1064~0.base=|v_ULTIMATE.start_main_~#t1064~0.base_26|, ~y~0=v_~y~0_82, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25, ULTIMATE.start_main_~#t1062~0.offset=|v_ULTIMATE.start_main_~#t1062~0.offset_29|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_607, ~z$w_buff0~0=v_~z$w_buff0~0_326, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_242, ULTIMATE.start_main_~#t1061~0.offset=|v_ULTIMATE.start_main_~#t1061~0.offset_30|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_66|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_128|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_104, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_94|, ~b~0=v_~b~0_46, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_29|, #valid=|v_#valid_95|, #memory_int=|v_#memory_int_25|, ~z~0=v_~z~0_172, ~weak$$choice2~0=v_~weak$$choice2~0_157, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t1063~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t1062~0.base, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t1063~0.base, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1064~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1061~0.base, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1064~0.base, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1062~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t1061~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 20:21:20,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L841-1-->L843: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1062~0.base_13| 4) |v_#length_17|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1062~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t1062~0.base_13|)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1062~0.base_13| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1062~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1062~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1062~0.base_13|) |v_ULTIMATE.start_main_~#t1062~0.offset_11| 1)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t1062~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t1062~0.base=|v_ULTIMATE.start_main_~#t1062~0.base_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1062~0.offset=|v_ULTIMATE.start_main_~#t1062~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1062~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1062~0.offset] because there is no mapped edge [2019-12-07 20:21:20,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1063~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1063~0.base_13|) |v_ULTIMATE.start_main_~#t1063~0.offset_11| 2)) |v_#memory_int_19|) (= 0 (select |v_#valid_51| |v_ULTIMATE.start_main_~#t1063~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t1063~0.offset_11|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1063~0.base_13| 4)) (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t1063~0.base_13| 1)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1063~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t1063~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1063~0.base=|v_ULTIMATE.start_main_~#t1063~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_19|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1063~0.offset=|v_ULTIMATE.start_main_~#t1063~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1063~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1063~0.offset] because there is no mapped edge [2019-12-07 20:21:20,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L845-1-->L847: Formula: (and (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1064~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1064~0.base_11|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1064~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1064~0.base_11|) |v_ULTIMATE.start_main_~#t1064~0.offset_10| 3)) |v_#memory_int_17|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1064~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1064~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1064~0.offset_10|) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1064~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1064~0.base=|v_ULTIMATE.start_main_~#t1064~0.base_11|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1064~0.offset=|v_ULTIMATE.start_main_~#t1064~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1064~0.base, #length, ULTIMATE.start_main_~#t1064~0.offset] because there is no mapped edge [2019-12-07 20:21:20,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] P3ENTRY-->L4-3: Formula: (and (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_8| (ite (not (and (not (= 0 (mod v_~z$w_buff0_used~0_112 256))) (not (= (mod v_~z$w_buff1_used~0_69 256) 0)))) 1 0)) (= v_~z$w_buff0~0_26 v_~z$w_buff1~0_20) (= 1 v_~z$w_buff0~0_25) (= v_~z$w_buff0_used~0_113 v_~z$w_buff1_used~0_69) (= v_~z$w_buff0_used~0_112 1) (not (= 0 v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_10)) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_8| v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_10) (= v_P3Thread1of1ForFork1_~arg.offset_8 |v_P3Thread1of1ForFork1_#in~arg.offset_10|) (= |v_P3Thread1of1ForFork1_#in~arg.base_10| v_P3Thread1of1ForFork1_~arg.base_8)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_113, ~z$w_buff0~0=v_~z$w_buff0~0_26, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_10|, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_10|} OutVars{P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_112, ~z$w_buff0~0=v_~z$w_buff0~0_25, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_10|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_69, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_8|, ~z$w_buff1~0=v_~z$w_buff1~0_20, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_8, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_10|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_8} AuxVars[] AssignedVars[P3Thread1of1ForFork1___VERIFIER_assert_~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression, ~z$w_buff1~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 20:21:20,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#in~arg.offset_18| v_P0Thread1of1ForFork2_~arg.offset_16) (= v_P0Thread1of1ForFork2_~arg.base_16 |v_P0Thread1of1ForFork2_#in~arg.base_18|) (= v_~b~0_24 1) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= v_~x~0_35 1) (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1)) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_18|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_18|, ~b~0=v_~b~0_24, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_16, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_18|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|, ~x~0=v_~x~0_35, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_16} AuxVars[] AssignedVars[~b~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 20:21:20,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] P1ENTRY-->P1EXIT: Formula: (and (= v_~x~0_48 2) (= 0 |v_P1Thread1of1ForFork3_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork3_#res.base_3|) (= v_~__unbuffered_cnt~0_131 (+ v_~__unbuffered_cnt~0_132 1)) (= v_~y~0_47 1) (= |v_P1Thread1of1ForFork3_#in~arg.offset_14| v_P1Thread1of1ForFork3_~arg.offset_12) (= |v_P1Thread1of1ForFork3_#in~arg.base_14| v_P1Thread1of1ForFork3_~arg.base_12)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_132, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_14|} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_3|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_12, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_14|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_12, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_14|, ~y~0=v_~y~0_47, ~x~0=v_~x~0_48} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0, ~y~0, ~x~0] because there is no mapped edge [2019-12-07 20:21:20,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L776-->L776-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1649344722 256) 0))) (or (and (= ~z$w_buff0~0_In1649344722 |P2Thread1of1ForFork0_#t~ite8_Out1649344722|) (= |P2Thread1of1ForFork0_#t~ite8_Out1649344722| |P2Thread1of1ForFork0_#t~ite9_Out1649344722|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1649344722 256)))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In1649344722 256)) .cse0) (and .cse0 (= (mod ~z$w_buff1_used~0_In1649344722 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In1649344722 256)))) .cse1) (and (= |P2Thread1of1ForFork0_#t~ite8_In1649344722| |P2Thread1of1ForFork0_#t~ite8_Out1649344722|) (= ~z$w_buff0~0_In1649344722 |P2Thread1of1ForFork0_#t~ite9_Out1649344722|) (not .cse1)))) InVars {P2Thread1of1ForFork0_#t~ite8=|P2Thread1of1ForFork0_#t~ite8_In1649344722|, ~z$w_buff0~0=~z$w_buff0~0_In1649344722, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1649344722, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1649344722, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1649344722, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1649344722, ~weak$$choice2~0=~weak$$choice2~0_In1649344722} OutVars{P2Thread1of1ForFork0_#t~ite8=|P2Thread1of1ForFork0_#t~ite8_Out1649344722|, ~z$w_buff0~0=~z$w_buff0~0_In1649344722, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1649344722, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1649344722, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1649344722, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1649344722, ~weak$$choice2~0=~weak$$choice2~0_In1649344722, P2Thread1of1ForFork0_#t~ite9=|P2Thread1of1ForFork0_#t~ite9_Out1649344722|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite8, P2Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-07 20:21:20,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L777-->L777-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-986385627 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite11_In-986385627| |P2Thread1of1ForFork0_#t~ite11_Out-986385627|) (= ~z$w_buff1~0_In-986385627 |P2Thread1of1ForFork0_#t~ite12_Out-986385627|) (not .cse0)) (and (= ~z$w_buff1~0_In-986385627 |P2Thread1of1ForFork0_#t~ite11_Out-986385627|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-986385627 256)))) (or (and (= (mod ~z$w_buff1_used~0_In-986385627 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-986385627 256)) (and (= 0 (mod ~z$r_buff1_thd3~0_In-986385627 256)) .cse1))) (= |P2Thread1of1ForFork0_#t~ite11_Out-986385627| |P2Thread1of1ForFork0_#t~ite12_Out-986385627|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-986385627, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_In-986385627|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-986385627, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-986385627, ~z$w_buff1~0=~z$w_buff1~0_In-986385627, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-986385627, ~weak$$choice2~0=~weak$$choice2~0_In-986385627} OutVars{P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out-986385627|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-986385627, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out-986385627|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-986385627, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-986385627, ~z$w_buff1~0=~z$w_buff1~0_In-986385627, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-986385627, ~weak$$choice2~0=~weak$$choice2~0_In-986385627} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11, P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-07 20:21:20,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L778-->L778-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In124615516 256) 0))) (or (and (= ~z$w_buff0_used~0_In124615516 |P2Thread1of1ForFork0_#t~ite14_Out124615516|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In124615516 256)))) (or (and (= (mod ~z$w_buff1_used~0_In124615516 256) 0) .cse1) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In124615516 256))) (= 0 (mod ~z$w_buff0_used~0_In124615516 256)))) (= |P2Thread1of1ForFork0_#t~ite15_Out124615516| |P2Thread1of1ForFork0_#t~ite14_Out124615516|)) (and (= ~z$w_buff0_used~0_In124615516 |P2Thread1of1ForFork0_#t~ite15_Out124615516|) (= |P2Thread1of1ForFork0_#t~ite14_In124615516| |P2Thread1of1ForFork0_#t~ite14_Out124615516|) (not .cse0)))) InVars {P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_In124615516|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In124615516, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In124615516, ~z$w_buff1_used~0=~z$w_buff1_used~0_In124615516, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In124615516, ~weak$$choice2~0=~weak$$choice2~0_In124615516} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out124615516|, P2Thread1of1ForFork0_#t~ite15=|P2Thread1of1ForFork0_#t~ite15_Out124615516|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In124615516, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In124615516, ~z$w_buff1_used~0=~z$w_buff1_used~0_In124615516, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In124615516, ~weak$$choice2~0=~weak$$choice2~0_In124615516} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, P2Thread1of1ForFork0_#t~ite15] because there is no mapped edge [2019-12-07 20:21:20,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L780-->L781: Formula: (and (not (= (mod v_~weak$$choice2~0_32 256) 0)) (= v_~z$r_buff0_thd3~0_73 v_~z$r_buff0_thd3~0_72)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_73, ~weak$$choice2~0=v_~weak$$choice2~0_32} OutVars{P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_72, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_9|, ~weak$$choice2~0=v_~weak$$choice2~0_32, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_6|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-07 20:21:20,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L819-->L819-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In865079167 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In865079167 256)))) (or (and (not .cse0) (= |P3Thread1of1ForFork1_#t~ite28_Out865079167| 0) (not .cse1)) (and (= ~z$w_buff0_used~0_In865079167 |P3Thread1of1ForFork1_#t~ite28_Out865079167|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In865079167, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In865079167} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In865079167, P3Thread1of1ForFork1_#t~ite28=|P3Thread1of1ForFork1_#t~ite28_Out865079167|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In865079167} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 20:21:20,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L783-->L791: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_16 v_~z$mem_tmp~0_4) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_5|, ~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 20:21:20,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L820-->L820-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1007271327 256))) (.cse3 (= (mod ~z$r_buff0_thd4~0_In-1007271327 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1007271327 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd4~0_In-1007271327 256) 0))) (or (and (= |P3Thread1of1ForFork1_#t~ite29_Out-1007271327| ~z$w_buff1_used~0_In-1007271327) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P3Thread1of1ForFork1_#t~ite29_Out-1007271327| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1007271327, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1007271327, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1007271327, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1007271327} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1007271327, P3Thread1of1ForFork1_#t~ite29=|P3Thread1of1ForFork1_#t~ite29_Out-1007271327|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1007271327, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1007271327, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1007271327} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 20:21:20,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L821-->L822: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1818477929 256))) (.cse1 (= ~z$r_buff0_thd4~0_In-1818477929 ~z$r_buff0_thd4~0_Out-1818477929)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1818477929 256)))) (or (and .cse0 .cse1) (and (not .cse2) (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out-1818477929)) (and .cse1 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1818477929, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1818477929} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1818477929, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1818477929, P3Thread1of1ForFork1_#t~ite30=|P3Thread1of1ForFork1_#t~ite30_Out-1818477929|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 20:21:20,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L822-->L822-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-647298868 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-647298868 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-647298868 256))) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-647298868 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork1_#t~ite31_Out-647298868| ~z$r_buff1_thd4~0_In-647298868) (or .cse2 .cse3)) (and (= |P3Thread1of1ForFork1_#t~ite31_Out-647298868| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-647298868, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-647298868, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-647298868, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-647298868} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-647298868, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-647298868, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-647298868, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-647298868, P3Thread1of1ForFork1_#t~ite31=|P3Thread1of1ForFork1_#t~ite31_Out-647298868|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 20:21:20,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L822-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_107 (+ v_~__unbuffered_cnt~0_108 1)) (= v_~z$r_buff1_thd4~0_56 |v_P3Thread1of1ForFork1_#t~ite31_58|) (= |v_P3Thread1of1ForFork1_#res.offset_3| 0) (= |v_P3Thread1of1ForFork1_#res.base_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_58|} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_56, P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_3|, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_57|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset, P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 20:21:20,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L847-1-->L853: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= (ite (= 4 v_~__unbuffered_cnt~0_60) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet35, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 20:21:20,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L853-2-->L853-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1822479151 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1822479151 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In-1822479151 |ULTIMATE.start_main_#t~ite36_Out-1822479151|)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite36_Out-1822479151| ~z$w_buff1~0_In-1822479151)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1822479151, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1822479151, ~z$w_buff1~0=~z$w_buff1~0_In-1822479151, ~z~0=~z~0_In-1822479151} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1822479151, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1822479151, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1822479151|, ~z$w_buff1~0=~z$w_buff1~0_In-1822479151, ~z~0=~z~0_In-1822479151} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 20:21:20,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L853-4-->L854: Formula: (= v_~z~0_38 |v_ULTIMATE.start_main_#t~ite36_16|) InVars {ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_16|} OutVars{ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ~z~0=v_~z~0_38} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2019-12-07 20:21:20,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L854-->L854-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1291729050 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1291729050 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out1291729050| 0)) (and (= |ULTIMATE.start_main_#t~ite38_Out1291729050| ~z$w_buff0_used~0_In1291729050) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1291729050, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1291729050} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1291729050, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1291729050, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1291729050|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 20:21:20,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L855-->L855-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In800092036 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In800092036 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In800092036 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In800092036 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite39_Out800092036|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In800092036 |ULTIMATE.start_main_#t~ite39_Out800092036|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In800092036, ~z$w_buff0_used~0=~z$w_buff0_used~0_In800092036, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In800092036, ~z$w_buff1_used~0=~z$w_buff1_used~0_In800092036} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In800092036, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out800092036|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In800092036, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In800092036, ~z$w_buff1_used~0=~z$w_buff1_used~0_In800092036} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 20:21:20,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-931712212 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-931712212 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In-931712212 |ULTIMATE.start_main_#t~ite40_Out-931712212|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite40_Out-931712212|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-931712212, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-931712212} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-931712212, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-931712212|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-931712212} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 20:21:20,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L857-->L857-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-5084836 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-5084836 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-5084836 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-5084836 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In-5084836 |ULTIMATE.start_main_#t~ite41_Out-5084836|)) (and (= |ULTIMATE.start_main_#t~ite41_Out-5084836| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-5084836, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-5084836, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-5084836, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-5084836} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-5084836|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-5084836, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-5084836, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-5084836, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-5084836} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 20:21:20,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L857-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z$r_buff1_thd0~0_110 |v_ULTIMATE.start_main_#t~ite41_51|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (mod v_~main$tmp_guard1~0_23 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~main$tmp_guard1~0_23 (ite (= (ite (not (and (= 1 v_~__unbuffered_p3_EAX~0_73) (= 0 v_~__unbuffered_p3_EBX~0_72) (= 0 v_~__unbuffered_p2_EAX~0_29) (= v_~x~0_52 2) (= v_~y~0_52 2))) 1 0) 0) 0 1))) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_51|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_73, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_72, ~y~0=v_~y~0_52, ~x~0=v_~x~0_52} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_50|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_110, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_73, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_72, ~y~0=v_~y~0_52, ~x~0=v_~x~0_52, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 20:21:20,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 08:21:20 BasicIcfg [2019-12-07 20:21:20,916 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 20:21:20,916 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 20:21:20,916 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 20:21:20,916 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 20:21:20,917 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:21:00" (3/4) ... [2019-12-07 20:21:20,918 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 20:21:20,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] ULTIMATE.startENTRY-->L841: Formula: (let ((.cse0 (store |v_#valid_97| 0 0))) (and (= 0 v_~z$r_buff1_thd1~0_69) (= 0 v_~z$r_buff1_thd2~0_69) (= v_~z$w_buff0~0_326 0) (= 0 v_~z$r_buff1_thd4~0_128) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= 0 v_~__unbuffered_p3_EBX~0_104) (= v_~b~0_46 0) (= v_~weak$$choice2~0_157 0) (= 0 v_~__unbuffered_p2_EAX~0_59) (= 0 v_~z$r_buff0_thd3~0_271) (= v_~z$r_buff0_thd0~0_83 0) (= 0 v_~z$flush_delayed~0_78) (= v_~main$tmp_guard1~0_45 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1061~0.base_46| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1061~0.base_46|) |v_ULTIMATE.start_main_~#t1061~0.offset_30| 0)) |v_#memory_int_25|) (= v_~a~0_68 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1061~0.base_46|)) (= v_~z$r_buff0_thd1~0_26 0) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~weak$$choice0~0_39) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z~0_172 0) (= 0 v_~z$r_buff0_thd4~0_139) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1061~0.base_46|) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t1061~0.base_46| 4)) (= v_~y~0_82 0) (= |v_#valid_95| (store .cse0 |v_ULTIMATE.start_main_~#t1061~0.base_46| 1)) (= v_~z$read_delayed~0_7 0) (= 0 |v_ULTIMATE.start_main_~#t1061~0.offset_30|) (< 0 |v_#StackHeapBarrier_20|) (= 0 v_~z$r_buff1_thd3~0_242) (= 0 |v_#NULL.base_7|) (= v_~z$mem_tmp~0_49 0) (= v_~z$w_buff1_used~0_372 0) (= v_~z$r_buff1_thd0~0_144 0) (= v_~z$w_buff0_used~0_607 0) (= v_~x~0_74 0) (= v_~__unbuffered_p3_EAX~0_105 0) (= v_~z$w_buff1~0_201 0) (= v_~__unbuffered_cnt~0_157 0) (= v_~z$r_buff0_thd2~0_25 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_97|, #memory_int=|v_#memory_int_26|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_69, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t1063~0.offset=|v_ULTIMATE.start_main_~#t1063~0.offset_29|, ~a~0=v_~a~0_68, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_83, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_139, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_105, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_59, ~z$mem_tmp~0=v_~z$mem_tmp~0_49, ULTIMATE.start_main_~#t1062~0.base=|v_ULTIMATE.start_main_~#t1062~0.base_45|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_28|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_372, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_42|, ~z$flush_delayed~0=v_~z$flush_delayed~0_78, ~weak$$choice0~0=v_~weak$$choice0~0_39, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_~#t1063~0.base=|v_ULTIMATE.start_main_~#t1063~0.base_45|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_26|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_69, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_271, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_157, ~x~0=v_~x~0_74, ULTIMATE.start_main_~#t1064~0.offset=|v_ULTIMATE.start_main_~#t1064~0.offset_19|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_128, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_22|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_201, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ULTIMATE.start_main_~#t1061~0.base=|v_ULTIMATE.start_main_~#t1061~0.base_46|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_144, ULTIMATE.start_main_~#t1064~0.base=|v_ULTIMATE.start_main_~#t1064~0.base_26|, ~y~0=v_~y~0_82, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25, ULTIMATE.start_main_~#t1062~0.offset=|v_ULTIMATE.start_main_~#t1062~0.offset_29|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_607, ~z$w_buff0~0=v_~z$w_buff0~0_326, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_242, ULTIMATE.start_main_~#t1061~0.offset=|v_ULTIMATE.start_main_~#t1061~0.offset_30|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_66|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_128|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_104, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_94|, ~b~0=v_~b~0_46, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_29|, #valid=|v_#valid_95|, #memory_int=|v_#memory_int_25|, ~z~0=v_~z~0_172, ~weak$$choice2~0=v_~weak$$choice2~0_157, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t1063~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t1062~0.base, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t1063~0.base, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1064~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1061~0.base, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1064~0.base, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1062~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t1061~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 20:21:20,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L841-1-->L843: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1062~0.base_13| 4) |v_#length_17|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1062~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t1062~0.base_13|)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1062~0.base_13| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1062~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1062~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1062~0.base_13|) |v_ULTIMATE.start_main_~#t1062~0.offset_11| 1)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t1062~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t1062~0.base=|v_ULTIMATE.start_main_~#t1062~0.base_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1062~0.offset=|v_ULTIMATE.start_main_~#t1062~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1062~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1062~0.offset] because there is no mapped edge [2019-12-07 20:21:20,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1063~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1063~0.base_13|) |v_ULTIMATE.start_main_~#t1063~0.offset_11| 2)) |v_#memory_int_19|) (= 0 (select |v_#valid_51| |v_ULTIMATE.start_main_~#t1063~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t1063~0.offset_11|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1063~0.base_13| 4)) (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t1063~0.base_13| 1)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1063~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t1063~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1063~0.base=|v_ULTIMATE.start_main_~#t1063~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_19|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1063~0.offset=|v_ULTIMATE.start_main_~#t1063~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1063~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1063~0.offset] because there is no mapped edge [2019-12-07 20:21:20,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L845-1-->L847: Formula: (and (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1064~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1064~0.base_11|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1064~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1064~0.base_11|) |v_ULTIMATE.start_main_~#t1064~0.offset_10| 3)) |v_#memory_int_17|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1064~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1064~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1064~0.offset_10|) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1064~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1064~0.base=|v_ULTIMATE.start_main_~#t1064~0.base_11|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1064~0.offset=|v_ULTIMATE.start_main_~#t1064~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1064~0.base, #length, ULTIMATE.start_main_~#t1064~0.offset] because there is no mapped edge [2019-12-07 20:21:20,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] P3ENTRY-->L4-3: Formula: (and (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_8| (ite (not (and (not (= 0 (mod v_~z$w_buff0_used~0_112 256))) (not (= (mod v_~z$w_buff1_used~0_69 256) 0)))) 1 0)) (= v_~z$w_buff0~0_26 v_~z$w_buff1~0_20) (= 1 v_~z$w_buff0~0_25) (= v_~z$w_buff0_used~0_113 v_~z$w_buff1_used~0_69) (= v_~z$w_buff0_used~0_112 1) (not (= 0 v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_10)) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_8| v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_10) (= v_P3Thread1of1ForFork1_~arg.offset_8 |v_P3Thread1of1ForFork1_#in~arg.offset_10|) (= |v_P3Thread1of1ForFork1_#in~arg.base_10| v_P3Thread1of1ForFork1_~arg.base_8)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_113, ~z$w_buff0~0=v_~z$w_buff0~0_26, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_10|, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_10|} OutVars{P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_112, ~z$w_buff0~0=v_~z$w_buff0~0_25, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_10|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_69, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_8|, ~z$w_buff1~0=v_~z$w_buff1~0_20, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_8, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_10|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_8} AuxVars[] AssignedVars[P3Thread1of1ForFork1___VERIFIER_assert_~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression, ~z$w_buff1~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 20:21:20,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#in~arg.offset_18| v_P0Thread1of1ForFork2_~arg.offset_16) (= v_P0Thread1of1ForFork2_~arg.base_16 |v_P0Thread1of1ForFork2_#in~arg.base_18|) (= v_~b~0_24 1) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= v_~x~0_35 1) (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1)) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_18|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_18|, ~b~0=v_~b~0_24, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_16, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_18|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|, ~x~0=v_~x~0_35, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_16} AuxVars[] AssignedVars[~b~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 20:21:20,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] P1ENTRY-->P1EXIT: Formula: (and (= v_~x~0_48 2) (= 0 |v_P1Thread1of1ForFork3_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork3_#res.base_3|) (= v_~__unbuffered_cnt~0_131 (+ v_~__unbuffered_cnt~0_132 1)) (= v_~y~0_47 1) (= |v_P1Thread1of1ForFork3_#in~arg.offset_14| v_P1Thread1of1ForFork3_~arg.offset_12) (= |v_P1Thread1of1ForFork3_#in~arg.base_14| v_P1Thread1of1ForFork3_~arg.base_12)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_132, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_14|} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_3|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_12, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_14|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_12, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_14|, ~y~0=v_~y~0_47, ~x~0=v_~x~0_48} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0, ~y~0, ~x~0] because there is no mapped edge [2019-12-07 20:21:20,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L776-->L776-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1649344722 256) 0))) (or (and (= ~z$w_buff0~0_In1649344722 |P2Thread1of1ForFork0_#t~ite8_Out1649344722|) (= |P2Thread1of1ForFork0_#t~ite8_Out1649344722| |P2Thread1of1ForFork0_#t~ite9_Out1649344722|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1649344722 256)))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In1649344722 256)) .cse0) (and .cse0 (= (mod ~z$w_buff1_used~0_In1649344722 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In1649344722 256)))) .cse1) (and (= |P2Thread1of1ForFork0_#t~ite8_In1649344722| |P2Thread1of1ForFork0_#t~ite8_Out1649344722|) (= ~z$w_buff0~0_In1649344722 |P2Thread1of1ForFork0_#t~ite9_Out1649344722|) (not .cse1)))) InVars {P2Thread1of1ForFork0_#t~ite8=|P2Thread1of1ForFork0_#t~ite8_In1649344722|, ~z$w_buff0~0=~z$w_buff0~0_In1649344722, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1649344722, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1649344722, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1649344722, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1649344722, ~weak$$choice2~0=~weak$$choice2~0_In1649344722} OutVars{P2Thread1of1ForFork0_#t~ite8=|P2Thread1of1ForFork0_#t~ite8_Out1649344722|, ~z$w_buff0~0=~z$w_buff0~0_In1649344722, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1649344722, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1649344722, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1649344722, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1649344722, ~weak$$choice2~0=~weak$$choice2~0_In1649344722, P2Thread1of1ForFork0_#t~ite9=|P2Thread1of1ForFork0_#t~ite9_Out1649344722|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite8, P2Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-07 20:21:20,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L777-->L777-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-986385627 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite11_In-986385627| |P2Thread1of1ForFork0_#t~ite11_Out-986385627|) (= ~z$w_buff1~0_In-986385627 |P2Thread1of1ForFork0_#t~ite12_Out-986385627|) (not .cse0)) (and (= ~z$w_buff1~0_In-986385627 |P2Thread1of1ForFork0_#t~ite11_Out-986385627|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-986385627 256)))) (or (and (= (mod ~z$w_buff1_used~0_In-986385627 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-986385627 256)) (and (= 0 (mod ~z$r_buff1_thd3~0_In-986385627 256)) .cse1))) (= |P2Thread1of1ForFork0_#t~ite11_Out-986385627| |P2Thread1of1ForFork0_#t~ite12_Out-986385627|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-986385627, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_In-986385627|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-986385627, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-986385627, ~z$w_buff1~0=~z$w_buff1~0_In-986385627, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-986385627, ~weak$$choice2~0=~weak$$choice2~0_In-986385627} OutVars{P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out-986385627|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-986385627, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out-986385627|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-986385627, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-986385627, ~z$w_buff1~0=~z$w_buff1~0_In-986385627, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-986385627, ~weak$$choice2~0=~weak$$choice2~0_In-986385627} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11, P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-07 20:21:20,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L778-->L778-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In124615516 256) 0))) (or (and (= ~z$w_buff0_used~0_In124615516 |P2Thread1of1ForFork0_#t~ite14_Out124615516|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In124615516 256)))) (or (and (= (mod ~z$w_buff1_used~0_In124615516 256) 0) .cse1) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In124615516 256))) (= 0 (mod ~z$w_buff0_used~0_In124615516 256)))) (= |P2Thread1of1ForFork0_#t~ite15_Out124615516| |P2Thread1of1ForFork0_#t~ite14_Out124615516|)) (and (= ~z$w_buff0_used~0_In124615516 |P2Thread1of1ForFork0_#t~ite15_Out124615516|) (= |P2Thread1of1ForFork0_#t~ite14_In124615516| |P2Thread1of1ForFork0_#t~ite14_Out124615516|) (not .cse0)))) InVars {P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_In124615516|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In124615516, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In124615516, ~z$w_buff1_used~0=~z$w_buff1_used~0_In124615516, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In124615516, ~weak$$choice2~0=~weak$$choice2~0_In124615516} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out124615516|, P2Thread1of1ForFork0_#t~ite15=|P2Thread1of1ForFork0_#t~ite15_Out124615516|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In124615516, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In124615516, ~z$w_buff1_used~0=~z$w_buff1_used~0_In124615516, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In124615516, ~weak$$choice2~0=~weak$$choice2~0_In124615516} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, P2Thread1of1ForFork0_#t~ite15] because there is no mapped edge [2019-12-07 20:21:20,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L780-->L781: Formula: (and (not (= (mod v_~weak$$choice2~0_32 256) 0)) (= v_~z$r_buff0_thd3~0_73 v_~z$r_buff0_thd3~0_72)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_73, ~weak$$choice2~0=v_~weak$$choice2~0_32} OutVars{P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_72, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_9|, ~weak$$choice2~0=v_~weak$$choice2~0_32, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_6|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-07 20:21:20,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L819-->L819-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In865079167 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In865079167 256)))) (or (and (not .cse0) (= |P3Thread1of1ForFork1_#t~ite28_Out865079167| 0) (not .cse1)) (and (= ~z$w_buff0_used~0_In865079167 |P3Thread1of1ForFork1_#t~ite28_Out865079167|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In865079167, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In865079167} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In865079167, P3Thread1of1ForFork1_#t~ite28=|P3Thread1of1ForFork1_#t~ite28_Out865079167|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In865079167} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 20:21:20,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L783-->L791: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_16 v_~z$mem_tmp~0_4) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_5|, ~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 20:21:20,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L820-->L820-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1007271327 256))) (.cse3 (= (mod ~z$r_buff0_thd4~0_In-1007271327 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1007271327 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd4~0_In-1007271327 256) 0))) (or (and (= |P3Thread1of1ForFork1_#t~ite29_Out-1007271327| ~z$w_buff1_used~0_In-1007271327) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P3Thread1of1ForFork1_#t~ite29_Out-1007271327| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1007271327, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1007271327, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1007271327, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1007271327} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1007271327, P3Thread1of1ForFork1_#t~ite29=|P3Thread1of1ForFork1_#t~ite29_Out-1007271327|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1007271327, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1007271327, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1007271327} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 20:21:20,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L821-->L822: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1818477929 256))) (.cse1 (= ~z$r_buff0_thd4~0_In-1818477929 ~z$r_buff0_thd4~0_Out-1818477929)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1818477929 256)))) (or (and .cse0 .cse1) (and (not .cse2) (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out-1818477929)) (and .cse1 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1818477929, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1818477929} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1818477929, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1818477929, P3Thread1of1ForFork1_#t~ite30=|P3Thread1of1ForFork1_#t~ite30_Out-1818477929|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 20:21:20,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L822-->L822-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-647298868 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-647298868 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-647298868 256))) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-647298868 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork1_#t~ite31_Out-647298868| ~z$r_buff1_thd4~0_In-647298868) (or .cse2 .cse3)) (and (= |P3Thread1of1ForFork1_#t~ite31_Out-647298868| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-647298868, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-647298868, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-647298868, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-647298868} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-647298868, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-647298868, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-647298868, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-647298868, P3Thread1of1ForFork1_#t~ite31=|P3Thread1of1ForFork1_#t~ite31_Out-647298868|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 20:21:20,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L822-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_107 (+ v_~__unbuffered_cnt~0_108 1)) (= v_~z$r_buff1_thd4~0_56 |v_P3Thread1of1ForFork1_#t~ite31_58|) (= |v_P3Thread1of1ForFork1_#res.offset_3| 0) (= |v_P3Thread1of1ForFork1_#res.base_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_58|} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_56, P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_3|, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_57|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset, P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 20:21:20,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L847-1-->L853: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= (ite (= 4 v_~__unbuffered_cnt~0_60) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet35, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 20:21:20,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L853-2-->L853-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1822479151 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1822479151 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In-1822479151 |ULTIMATE.start_main_#t~ite36_Out-1822479151|)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite36_Out-1822479151| ~z$w_buff1~0_In-1822479151)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1822479151, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1822479151, ~z$w_buff1~0=~z$w_buff1~0_In-1822479151, ~z~0=~z~0_In-1822479151} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1822479151, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1822479151, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1822479151|, ~z$w_buff1~0=~z$w_buff1~0_In-1822479151, ~z~0=~z~0_In-1822479151} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 20:21:20,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L853-4-->L854: Formula: (= v_~z~0_38 |v_ULTIMATE.start_main_#t~ite36_16|) InVars {ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_16|} OutVars{ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ~z~0=v_~z~0_38} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2019-12-07 20:21:20,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L854-->L854-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1291729050 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1291729050 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out1291729050| 0)) (and (= |ULTIMATE.start_main_#t~ite38_Out1291729050| ~z$w_buff0_used~0_In1291729050) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1291729050, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1291729050} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1291729050, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1291729050, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1291729050|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 20:21:20,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L855-->L855-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In800092036 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In800092036 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In800092036 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In800092036 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite39_Out800092036|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In800092036 |ULTIMATE.start_main_#t~ite39_Out800092036|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In800092036, ~z$w_buff0_used~0=~z$w_buff0_used~0_In800092036, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In800092036, ~z$w_buff1_used~0=~z$w_buff1_used~0_In800092036} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In800092036, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out800092036|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In800092036, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In800092036, ~z$w_buff1_used~0=~z$w_buff1_used~0_In800092036} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 20:21:20,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-931712212 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-931712212 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In-931712212 |ULTIMATE.start_main_#t~ite40_Out-931712212|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite40_Out-931712212|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-931712212, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-931712212} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-931712212, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-931712212|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-931712212} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 20:21:20,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L857-->L857-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-5084836 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-5084836 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-5084836 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-5084836 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In-5084836 |ULTIMATE.start_main_#t~ite41_Out-5084836|)) (and (= |ULTIMATE.start_main_#t~ite41_Out-5084836| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-5084836, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-5084836, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-5084836, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-5084836} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-5084836|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-5084836, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-5084836, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-5084836, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-5084836} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 20:21:20,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L857-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z$r_buff1_thd0~0_110 |v_ULTIMATE.start_main_#t~ite41_51|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (mod v_~main$tmp_guard1~0_23 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~main$tmp_guard1~0_23 (ite (= (ite (not (and (= 1 v_~__unbuffered_p3_EAX~0_73) (= 0 v_~__unbuffered_p3_EBX~0_72) (= 0 v_~__unbuffered_p2_EAX~0_29) (= v_~x~0_52 2) (= v_~y~0_52 2))) 1 0) 0) 0 1))) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_51|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_73, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_72, ~y~0=v_~y~0_52, ~x~0=v_~x~0_52} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_50|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_110, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_73, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_72, ~y~0=v_~y~0_52, ~x~0=v_~x~0_52, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 20:21:20,982 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_83d96d75-9f1f-415d-94a6-2fa0974d6c5a/bin/utaipan/witness.graphml [2019-12-07 20:21:20,982 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 20:21:20,983 INFO L168 Benchmark]: Toolchain (without parser) took 21706.93 ms. Allocated memory was 1.0 GB in the beginning and 3.8 GB in the end (delta: 2.8 GB). Free memory was 938.7 MB in the beginning and 1.9 GB in the end (delta: -912.0 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2019-12-07 20:21:20,983 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:21:20,984 INFO L168 Benchmark]: CACSL2BoogieTranslator took 410.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 938.7 MB in the beginning and 1.1 GB in the end (delta: -131.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:21:20,984 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:21:20,984 INFO L168 Benchmark]: Boogie Preprocessor took 24.94 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:21:20,984 INFO L168 Benchmark]: RCFGBuilder took 372.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 11.5 GB. [2019-12-07 20:21:20,985 INFO L168 Benchmark]: TraceAbstraction took 20793.29 ms. Allocated memory was 1.1 GB in the beginning and 3.8 GB in the end (delta: 2.7 GB). Free memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: -888.6 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-12-07 20:21:20,985 INFO L168 Benchmark]: Witness Printer took 66.03 ms. Allocated memory is still 3.8 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 11.5 GB. [2019-12-07 20:21:20,986 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 410.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 938.7 MB in the beginning and 1.1 GB in the end (delta: -131.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.94 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 372.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20793.29 ms. Allocated memory was 1.1 GB in the beginning and 3.8 GB in the end (delta: 2.7 GB). Free memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: -888.6 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 66.03 ms. Allocated memory is still 3.8 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 169 ProgramPointsBefore, 79 ProgramPointsAfterwards, 191 TransitionsBefore, 83 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 23 ChoiceCompositions, 5572 VarBasedMoverChecksPositive, 186 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 165 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.7s, 0 MoverChecksTotal, 46301 CheckedPairsTotal, 118 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L841] FCALL, FORK 0 pthread_create(&t1061, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] FCALL, FORK 0 pthread_create(&t1062, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t1063, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1064, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 [L809] 4 a = 1 [L812] 4 __unbuffered_p3_EAX = a [L815] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 2 [L771] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 3 z$flush_delayed = weak$$choice2 [L774] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L776] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L777] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L778] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L779] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L782] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L819] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L820] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L853] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L855] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L856] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 157 locations, 2 error locations. Result: UNSAFE, OverallTime: 20.6s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2098 SDtfs, 2520 SDslu, 3715 SDs, 0 SdLazy, 1757 SolverSat, 169 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 18 SyntacticMatches, 7 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54016occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 33612 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 552 NumberOfCodeBlocks, 552 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 485 ConstructedInterpolants, 0 QuantifiedInterpolants, 97780 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...