./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix033_tso.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_c4877987-3f24-4785-a791-d8e15cc6056b/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c4877987-3f24-4785-a791-d8e15cc6056b/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c4877987-3f24-4785-a791-d8e15cc6056b/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c4877987-3f24-4785-a791-d8e15cc6056b/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix033_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c4877987-3f24-4785-a791-d8e15cc6056b/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c4877987-3f24-4785-a791-d8e15cc6056b/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 0d6c0c6e9153dea18fd0e220e58ec075ace4a772 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 16:51:04,903 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:51:04,904 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:51:04,913 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:51:04,913 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:51:04,914 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:51:04,915 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:51:04,917 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:51:04,919 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:51:04,920 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:51:04,920 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:51:04,921 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:51:04,921 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:51:04,922 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:51:04,922 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:51:04,923 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:51:04,924 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:51:04,925 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:51:04,927 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:51:04,928 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:51:04,929 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:51:04,930 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:51:04,931 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:51:04,931 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:51:04,933 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:51:04,934 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:51:04,934 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:51:04,934 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:51:04,934 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:51:04,935 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:51:04,935 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:51:04,936 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:51:04,936 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:51:04,937 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:51:04,938 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:51:04,938 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:51:04,939 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:51:04,939 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:51:04,939 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:51:04,940 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:51:04,940 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:51:04,941 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c4877987-3f24-4785-a791-d8e15cc6056b/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 16:51:04,954 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:51:04,954 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:51:04,954 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 16:51:04,954 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 16:51:04,955 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 16:51:04,955 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 16:51:04,955 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 16:51:04,955 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 16:51:04,955 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 16:51:04,956 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 16:51:04,956 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 16:51:04,956 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 16:51:04,956 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 16:51:04,956 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 16:51:04,957 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 16:51:04,957 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:51:04,957 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:51:04,958 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:51:04,958 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:51:04,958 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:51:04,958 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:51:04,958 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:51:04,958 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:51:04,958 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 16:51:04,959 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:51:04,959 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:51:04,959 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:51:04,959 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:51:04,959 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:51:04,960 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:51:04,960 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:51:04,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:51:04,960 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:51:04,960 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:51:04,961 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:51:04,961 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 16:51:04,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:51:04,961 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:51:04,961 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:51:04,961 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 16:51:04,962 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_c4877987-3f24-4785-a791-d8e15cc6056b/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 -> 0d6c0c6e9153dea18fd0e220e58ec075ace4a772 [2019-12-07 16:51:05,080 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:51:05,090 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:51:05,093 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:51:05,094 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:51:05,094 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:51:05,095 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c4877987-3f24-4785-a791-d8e15cc6056b/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix033_tso.opt.i [2019-12-07 16:51:05,134 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c4877987-3f24-4785-a791-d8e15cc6056b/bin/utaipan/data/09be2d874/2eb4246e0a304cec8a3beb504fee239e/FLAG6eab4f8c7 [2019-12-07 16:51:05,598 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:51:05,598 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c4877987-3f24-4785-a791-d8e15cc6056b/sv-benchmarks/c/pthread-wmm/mix033_tso.opt.i [2019-12-07 16:51:05,609 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c4877987-3f24-4785-a791-d8e15cc6056b/bin/utaipan/data/09be2d874/2eb4246e0a304cec8a3beb504fee239e/FLAG6eab4f8c7 [2019-12-07 16:51:06,118 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c4877987-3f24-4785-a791-d8e15cc6056b/bin/utaipan/data/09be2d874/2eb4246e0a304cec8a3beb504fee239e [2019-12-07 16:51:06,120 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:51:06,122 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:51:06,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:51:06,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:51:06,125 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:51:06,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:51:06" (1/1) ... [2019-12-07 16:51:06,128 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9096c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:51:06, skipping insertion in model container [2019-12-07 16:51:06,128 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:51:06" (1/1) ... [2019-12-07 16:51:06,134 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:51:06,164 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:51:06,408 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:51:06,415 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:51:06,456 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:51:06,501 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:51:06,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:51:06 WrapperNode [2019-12-07 16:51:06,501 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:51:06,502 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:51:06,502 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:51:06,502 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:51:06,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:51:06" (1/1) ... [2019-12-07 16:51:06,520 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:51:06" (1/1) ... [2019-12-07 16:51:06,539 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:51:06,539 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:51:06,539 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:51:06,539 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:51:06,546 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:51:06" (1/1) ... [2019-12-07 16:51:06,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:51:06" (1/1) ... [2019-12-07 16:51:06,549 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:51:06" (1/1) ... [2019-12-07 16:51:06,550 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:51:06" (1/1) ... [2019-12-07 16:51:06,556 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:51:06" (1/1) ... [2019-12-07 16:51:06,558 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:51:06" (1/1) ... [2019-12-07 16:51:06,560 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:51:06" (1/1) ... [2019-12-07 16:51:06,563 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:51:06,564 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:51:06,564 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:51:06,564 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:51:06,564 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:51:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4877987-3f24-4785-a791-d8e15cc6056b/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 16:51:06,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 16:51:06,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 16:51:06,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 16:51:06,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 16:51:06,605 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 16:51:06,605 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 16:51:06,605 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 16:51:06,606 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 16:51:06,606 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 16:51:06,606 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 16:51:06,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 16:51:06,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:51:06,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:51:06,607 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 16:51:06,943 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:51:06,943 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 16:51:06,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:51:06 BoogieIcfgContainer [2019-12-07 16:51:06,944 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:51:06,945 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:51:06,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:51:06,946 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:51:06,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:51:06" (1/3) ... [2019-12-07 16:51:06,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@465454bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:51:06, skipping insertion in model container [2019-12-07 16:51:06,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:51:06" (2/3) ... [2019-12-07 16:51:06,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@465454bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:51:06, skipping insertion in model container [2019-12-07 16:51:06,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:51:06" (3/3) ... [2019-12-07 16:51:06,949 INFO L109 eAbstractionObserver]: Analyzing ICFG mix033_tso.opt.i [2019-12-07 16:51:06,955 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 16:51:06,955 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:51:06,959 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 16:51:06,960 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 16:51:06,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,983 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,983 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,984 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,985 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,995 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,995 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,996 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,996 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,996 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:06,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:51:07,013 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 16:51:07,028 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:51:07,029 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:51:07,029 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:51:07,029 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:51:07,029 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:51:07,029 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:51:07,029 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:51:07,029 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:51:07,040 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 180 transitions [2019-12-07 16:51:07,041 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 155 places, 180 transitions [2019-12-07 16:51:07,097 INFO L134 PetriNetUnfolder]: 35/177 cut-off events. [2019-12-07 16:51:07,098 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 16:51:07,109 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 177 events. 35/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 560 event pairs. 9/149 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-07 16:51:07,120 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 155 places, 180 transitions [2019-12-07 16:51:07,149 INFO L134 PetriNetUnfolder]: 35/177 cut-off events. [2019-12-07 16:51:07,149 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 16:51:07,153 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 177 events. 35/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 560 event pairs. 9/149 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-07 16:51:07,163 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-07 16:51:07,163 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 16:51:09,836 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-07 16:51:10,001 INFO L206 etLargeBlockEncoding]: Checked pairs total: 39797 [2019-12-07 16:51:10,001 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-07 16:51:10,003 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 70 places, 78 transitions [2019-12-07 16:51:10,461 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 11878 states. [2019-12-07 16:51:10,462 INFO L276 IsEmpty]: Start isEmpty. Operand 11878 states. [2019-12-07 16:51:10,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 16:51:10,467 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:10,467 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:51:10,467 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:10,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:10,471 INFO L82 PathProgramCache]: Analyzing trace with hash -884972408, now seen corresponding path program 1 times [2019-12-07 16:51:10,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:51:10,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244817550] [2019-12-07 16:51:10,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:10,628 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 16:51:10,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244817550] [2019-12-07 16:51:10,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:10,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 16:51:10,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352381968] [2019-12-07 16:51:10,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:51:10,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:51:10,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:51:10,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:51:10,644 INFO L87 Difference]: Start difference. First operand 11878 states. Second operand 3 states. [2019-12-07 16:51:10,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:10,833 INFO L93 Difference]: Finished difference Result 11574 states and 44420 transitions. [2019-12-07 16:51:10,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:51:10,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 16:51:10,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:10,921 INFO L225 Difference]: With dead ends: 11574 [2019-12-07 16:51:10,921 INFO L226 Difference]: Without dead ends: 10902 [2019-12-07 16:51:10,922 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 16:51:11,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10902 states. [2019-12-07 16:51:11,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10902 to 10902. [2019-12-07 16:51:11,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10902 states. [2019-12-07 16:51:11,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10902 states to 10902 states and 41772 transitions. [2019-12-07 16:51:11,314 INFO L78 Accepts]: Start accepts. Automaton has 10902 states and 41772 transitions. Word has length 7 [2019-12-07 16:51:11,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:11,315 INFO L462 AbstractCegarLoop]: Abstraction has 10902 states and 41772 transitions. [2019-12-07 16:51:11,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:51:11,315 INFO L276 IsEmpty]: Start isEmpty. Operand 10902 states and 41772 transitions. [2019-12-07 16:51:11,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 16:51:11,319 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:11,319 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:51:11,319 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:11,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:11,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1826046565, now seen corresponding path program 1 times [2019-12-07 16:51:11,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:51:11,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993085036] [2019-12-07 16:51:11,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:11,379 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 16:51:11,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993085036] [2019-12-07 16:51:11,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:11,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:51:11,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284475556] [2019-12-07 16:51:11,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:51:11,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:51:11,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:51:11,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:51:11,381 INFO L87 Difference]: Start difference. First operand 10902 states and 41772 transitions. Second operand 4 states. [2019-12-07 16:51:11,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:11,593 INFO L93 Difference]: Finished difference Result 16442 states and 60890 transitions. [2019-12-07 16:51:11,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:51:11,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 16:51:11,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:11,649 INFO L225 Difference]: With dead ends: 16442 [2019-12-07 16:51:11,649 INFO L226 Difference]: Without dead ends: 16416 [2019-12-07 16:51:11,649 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 16:51:11,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16416 states. [2019-12-07 16:51:11,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16416 to 14534. [2019-12-07 16:51:11,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14534 states. [2019-12-07 16:51:12,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14534 states to 14534 states and 54626 transitions. [2019-12-07 16:51:12,005 INFO L78 Accepts]: Start accepts. Automaton has 14534 states and 54626 transitions. Word has length 13 [2019-12-07 16:51:12,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:12,005 INFO L462 AbstractCegarLoop]: Abstraction has 14534 states and 54626 transitions. [2019-12-07 16:51:12,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:51:12,006 INFO L276 IsEmpty]: Start isEmpty. Operand 14534 states and 54626 transitions. [2019-12-07 16:51:12,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 16:51:12,010 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:12,010 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:51:12,011 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:12,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:12,011 INFO L82 PathProgramCache]: Analyzing trace with hash 564133875, now seen corresponding path program 1 times [2019-12-07 16:51:12,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:51:12,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224477215] [2019-12-07 16:51:12,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:12,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:12,046 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 16:51:12,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224477215] [2019-12-07 16:51:12,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:12,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:51:12,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243135366] [2019-12-07 16:51:12,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:51:12,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:51:12,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:51:12,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:51:12,048 INFO L87 Difference]: Start difference. First operand 14534 states and 54626 transitions. Second operand 3 states. [2019-12-07 16:51:12,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:12,202 INFO L93 Difference]: Finished difference Result 19566 states and 73114 transitions. [2019-12-07 16:51:12,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:51:12,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 16:51:12,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:12,276 INFO L225 Difference]: With dead ends: 19566 [2019-12-07 16:51:12,276 INFO L226 Difference]: Without dead ends: 19566 [2019-12-07 16:51:12,276 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 16:51:12,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19566 states. [2019-12-07 16:51:12,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19566 to 17774. [2019-12-07 16:51:12,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17774 states. [2019-12-07 16:51:12,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17774 states to 17774 states and 66874 transitions. [2019-12-07 16:51:12,604 INFO L78 Accepts]: Start accepts. Automaton has 17774 states and 66874 transitions. Word has length 16 [2019-12-07 16:51:12,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:12,604 INFO L462 AbstractCegarLoop]: Abstraction has 17774 states and 66874 transitions. [2019-12-07 16:51:12,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:51:12,604 INFO L276 IsEmpty]: Start isEmpty. Operand 17774 states and 66874 transitions. [2019-12-07 16:51:12,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 16:51:12,608 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:12,608 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:51:12,608 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:12,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:12,608 INFO L82 PathProgramCache]: Analyzing trace with hash 659196956, now seen corresponding path program 1 times [2019-12-07 16:51:12,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:51:12,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585295982] [2019-12-07 16:51:12,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:12,675 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 16:51:12,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585295982] [2019-12-07 16:51:12,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:12,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:51:12,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164379047] [2019-12-07 16:51:12,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:51:12,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:51:12,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:51:12,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:51:12,677 INFO L87 Difference]: Start difference. First operand 17774 states and 66874 transitions. Second operand 5 states. [2019-12-07 16:51:12,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:12,951 INFO L93 Difference]: Finished difference Result 25142 states and 92536 transitions. [2019-12-07 16:51:12,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:51:12,952 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 16:51:12,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:12,998 INFO L225 Difference]: With dead ends: 25142 [2019-12-07 16:51:12,998 INFO L226 Difference]: Without dead ends: 25100 [2019-12-07 16:51:12,998 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:51:13,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25100 states. [2019-12-07 16:51:13,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25100 to 19982. [2019-12-07 16:51:13,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19982 states. [2019-12-07 16:51:13,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19982 states to 19982 states and 74788 transitions. [2019-12-07 16:51:13,368 INFO L78 Accepts]: Start accepts. Automaton has 19982 states and 74788 transitions. Word has length 16 [2019-12-07 16:51:13,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:13,368 INFO L462 AbstractCegarLoop]: Abstraction has 19982 states and 74788 transitions. [2019-12-07 16:51:13,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:51:13,368 INFO L276 IsEmpty]: Start isEmpty. Operand 19982 states and 74788 transitions. [2019-12-07 16:51:13,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 16:51:13,374 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:13,374 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 16:51:13,374 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:13,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:13,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1098036901, now seen corresponding path program 1 times [2019-12-07 16:51:13,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:51:13,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606153767] [2019-12-07 16:51:13,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:13,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:13,421 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 16:51:13,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606153767] [2019-12-07 16:51:13,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:13,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:51:13,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413768365] [2019-12-07 16:51:13,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:51:13,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:51:13,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:51:13,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:51:13,423 INFO L87 Difference]: Start difference. First operand 19982 states and 74788 transitions. Second operand 3 states. [2019-12-07 16:51:13,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:13,486 INFO L93 Difference]: Finished difference Result 18938 states and 69918 transitions. [2019-12-07 16:51:13,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:51:13,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 16:51:13,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:13,520 INFO L225 Difference]: With dead ends: 18938 [2019-12-07 16:51:13,520 INFO L226 Difference]: Without dead ends: 18938 [2019-12-07 16:51:13,520 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 16:51:13,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18938 states. [2019-12-07 16:51:13,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18938 to 18578. [2019-12-07 16:51:13,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18578 states. [2019-12-07 16:51:13,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18578 states to 18578 states and 68654 transitions. [2019-12-07 16:51:13,921 INFO L78 Accepts]: Start accepts. Automaton has 18578 states and 68654 transitions. Word has length 18 [2019-12-07 16:51:13,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:13,922 INFO L462 AbstractCegarLoop]: Abstraction has 18578 states and 68654 transitions. [2019-12-07 16:51:13,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:51:13,922 INFO L276 IsEmpty]: Start isEmpty. Operand 18578 states and 68654 transitions. [2019-12-07 16:51:13,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 16:51:13,925 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:13,925 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 16:51:13,925 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:13,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:13,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1956522172, now seen corresponding path program 1 times [2019-12-07 16:51:13,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:51:13,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677792501] [2019-12-07 16:51:13,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:13,951 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 16:51:13,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677792501] [2019-12-07 16:51:13,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:13,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:51:13,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651105647] [2019-12-07 16:51:13,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:51:13,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:51:13,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:51:13,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:51:13,953 INFO L87 Difference]: Start difference. First operand 18578 states and 68654 transitions. Second operand 3 states. [2019-12-07 16:51:13,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:13,986 INFO L93 Difference]: Finished difference Result 10731 states and 34563 transitions. [2019-12-07 16:51:13,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:51:13,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 16:51:13,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:14,000 INFO L225 Difference]: With dead ends: 10731 [2019-12-07 16:51:14,000 INFO L226 Difference]: Without dead ends: 10731 [2019-12-07 16:51:14,001 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:51:14,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10731 states. [2019-12-07 16:51:14,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10731 to 10731. [2019-12-07 16:51:14,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10731 states. [2019-12-07 16:51:14,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10731 states to 10731 states and 34563 transitions. [2019-12-07 16:51:14,149 INFO L78 Accepts]: Start accepts. Automaton has 10731 states and 34563 transitions. Word has length 18 [2019-12-07 16:51:14,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:14,150 INFO L462 AbstractCegarLoop]: Abstraction has 10731 states and 34563 transitions. [2019-12-07 16:51:14,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:51:14,150 INFO L276 IsEmpty]: Start isEmpty. Operand 10731 states and 34563 transitions. [2019-12-07 16:51:14,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 16:51:14,152 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:14,152 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:51:14,152 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:14,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:14,153 INFO L82 PathProgramCache]: Analyzing trace with hash -200928332, now seen corresponding path program 1 times [2019-12-07 16:51:14,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:51:14,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572931092] [2019-12-07 16:51:14,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:14,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:14,181 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 16:51:14,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572931092] [2019-12-07 16:51:14,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:14,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:51:14,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39145459] [2019-12-07 16:51:14,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:51:14,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:51:14,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:51:14,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:51:14,183 INFO L87 Difference]: Start difference. First operand 10731 states and 34563 transitions. Second operand 4 states. [2019-12-07 16:51:14,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:14,200 INFO L93 Difference]: Finished difference Result 2078 states and 5522 transitions. [2019-12-07 16:51:14,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:51:14,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 16:51:14,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:14,202 INFO L225 Difference]: With dead ends: 2078 [2019-12-07 16:51:14,202 INFO L226 Difference]: Without dead ends: 2078 [2019-12-07 16:51:14,203 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 16:51:14,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2078 states. [2019-12-07 16:51:14,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2078 to 2078. [2019-12-07 16:51:14,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2078 states. [2019-12-07 16:51:14,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2078 states to 2078 states and 5522 transitions. [2019-12-07 16:51:14,221 INFO L78 Accepts]: Start accepts. Automaton has 2078 states and 5522 transitions. Word has length 19 [2019-12-07 16:51:14,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:14,221 INFO L462 AbstractCegarLoop]: Abstraction has 2078 states and 5522 transitions. [2019-12-07 16:51:14,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:51:14,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2078 states and 5522 transitions. [2019-12-07 16:51:14,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 16:51:14,223 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:14,223 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] [2019-12-07 16:51:14,224 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:14,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:14,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1695035107, now seen corresponding path program 1 times [2019-12-07 16:51:14,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:51:14,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298008732] [2019-12-07 16:51:14,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:14,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:14,277 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 16:51:14,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298008732] [2019-12-07 16:51:14,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:14,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:51:14,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347422502] [2019-12-07 16:51:14,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:51:14,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:51:14,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:51:14,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:51:14,278 INFO L87 Difference]: Start difference. First operand 2078 states and 5522 transitions. Second operand 6 states. [2019-12-07 16:51:14,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:14,477 INFO L93 Difference]: Finished difference Result 3185 states and 8089 transitions. [2019-12-07 16:51:14,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 16:51:14,477 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-07 16:51:14,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:14,480 INFO L225 Difference]: With dead ends: 3185 [2019-12-07 16:51:14,480 INFO L226 Difference]: Without dead ends: 3181 [2019-12-07 16:51:14,480 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:51:14,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3181 states. [2019-12-07 16:51:14,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3181 to 2131. [2019-12-07 16:51:14,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2131 states. [2019-12-07 16:51:14,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 5582 transitions. [2019-12-07 16:51:14,504 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 5582 transitions. Word has length 29 [2019-12-07 16:51:14,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:14,505 INFO L462 AbstractCegarLoop]: Abstraction has 2131 states and 5582 transitions. [2019-12-07 16:51:14,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:51:14,505 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 5582 transitions. [2019-12-07 16:51:14,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 16:51:14,507 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:14,507 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] [2019-12-07 16:51:14,507 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:14,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:14,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1710409753, now seen corresponding path program 1 times [2019-12-07 16:51:14,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:51:14,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301125007] [2019-12-07 16:51:14,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:14,547 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 16:51:14,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301125007] [2019-12-07 16:51:14,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:14,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:51:14,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581603636] [2019-12-07 16:51:14,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:51:14,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:51:14,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:51:14,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:51:14,549 INFO L87 Difference]: Start difference. First operand 2131 states and 5582 transitions. Second operand 5 states. [2019-12-07 16:51:14,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:14,568 INFO L93 Difference]: Finished difference Result 1268 states and 3467 transitions. [2019-12-07 16:51:14,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:51:14,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-07 16:51:14,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:14,570 INFO L225 Difference]: With dead ends: 1268 [2019-12-07 16:51:14,570 INFO L226 Difference]: Without dead ends: 1268 [2019-12-07 16:51:14,570 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 16:51:14,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2019-12-07 16:51:14,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 1268. [2019-12-07 16:51:14,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1268 states. [2019-12-07 16:51:14,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 3467 transitions. [2019-12-07 16:51:14,583 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 3467 transitions. Word has length 30 [2019-12-07 16:51:14,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:14,583 INFO L462 AbstractCegarLoop]: Abstraction has 1268 states and 3467 transitions. [2019-12-07 16:51:14,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:51:14,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 3467 transitions. [2019-12-07 16:51:14,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 16:51:14,587 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:14,587 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] [2019-12-07 16:51:14,587 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:14,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:14,587 INFO L82 PathProgramCache]: Analyzing trace with hash 91748315, now seen corresponding path program 1 times [2019-12-07 16:51:14,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:51:14,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797842574] [2019-12-07 16:51:14,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:14,651 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 16:51:14,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797842574] [2019-12-07 16:51:14,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:14,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:51:14,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415058358] [2019-12-07 16:51:14,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:51:14,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:51:14,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:51:14,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:51:14,652 INFO L87 Difference]: Start difference. First operand 1268 states and 3467 transitions. Second operand 4 states. [2019-12-07 16:51:14,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:14,676 INFO L93 Difference]: Finished difference Result 1771 states and 4609 transitions. [2019-12-07 16:51:14,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:51:14,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-12-07 16:51:14,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:14,678 INFO L225 Difference]: With dead ends: 1771 [2019-12-07 16:51:14,678 INFO L226 Difference]: Without dead ends: 1128 [2019-12-07 16:51:14,679 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 16:51:14,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2019-12-07 16:51:14,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1128. [2019-12-07 16:51:14,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1128 states. [2019-12-07 16:51:14,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 3032 transitions. [2019-12-07 16:51:14,694 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 3032 transitions. Word has length 45 [2019-12-07 16:51:14,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:14,695 INFO L462 AbstractCegarLoop]: Abstraction has 1128 states and 3032 transitions. [2019-12-07 16:51:14,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:51:14,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 3032 transitions. [2019-12-07 16:51:14,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 16:51:14,697 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:14,697 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] [2019-12-07 16:51:14,697 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:14,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:14,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1010142777, now seen corresponding path program 2 times [2019-12-07 16:51:14,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:51:14,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71369287] [2019-12-07 16:51:14,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:14,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:14,751 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 16:51:14,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71369287] [2019-12-07 16:51:14,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:14,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:51:14,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245894117] [2019-12-07 16:51:14,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:51:14,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:51:14,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:51:14,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:51:14,753 INFO L87 Difference]: Start difference. First operand 1128 states and 3032 transitions. Second operand 3 states. [2019-12-07 16:51:14,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:14,763 INFO L93 Difference]: Finished difference Result 1513 states and 3934 transitions. [2019-12-07 16:51:14,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:51:14,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-12-07 16:51:14,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:14,765 INFO L225 Difference]: With dead ends: 1513 [2019-12-07 16:51:14,765 INFO L226 Difference]: Without dead ends: 417 [2019-12-07 16:51:14,765 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:51:14,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2019-12-07 16:51:14,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2019-12-07 16:51:14,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-12-07 16:51:14,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 957 transitions. [2019-12-07 16:51:14,770 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 957 transitions. Word has length 45 [2019-12-07 16:51:14,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:14,771 INFO L462 AbstractCegarLoop]: Abstraction has 417 states and 957 transitions. [2019-12-07 16:51:14,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:51:14,771 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 957 transitions. [2019-12-07 16:51:14,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 16:51:14,772 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:14,772 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] [2019-12-07 16:51:14,772 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:14,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:14,772 INFO L82 PathProgramCache]: Analyzing trace with hash -926318759, now seen corresponding path program 3 times [2019-12-07 16:51:14,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:51:14,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099109875] [2019-12-07 16:51:14,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:51:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:51:14,853 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 16:51:14,853 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 16:51:14,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= 0 v_~weak$$choice0~0_10) (= v_~weak$$choice2~0_155 0) (= 0 v_~z$r_buff1_thd1~0_69) (= 0 v_~__unbuffered_cnt~0_89) (= v_~z$w_buff1~0_237 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t894~0.base_26|) 0) (= 0 v_~z$r_buff1_thd3~0_123) (= 0 v_~__unbuffered_p2_EAX~0_85) (= |v_#NULL.offset_7| 0) (= v_~main$tmp_guard0~0_18 0) (= v_~z~0_127 0) (= v_~z$mem_tmp~0_16 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t894~0.base_26|) (= v_~z$r_buff0_thd2~0_289 0) (= v_~z$read_delayed_var~0.base_4 0) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$w_buff0~0_373 0) (= v_~__unbuffered_p2_EBX~0_85 0) (= v_~z$read_delayed~0_5 0) (= v_~z$read_delayed_var~0.offset_4 0) (= v_~a~0_68 0) (= v_~z$r_buff0_thd1~0_24 0) (= v_~y~0_12 0) (= 0 v_~__unbuffered_p1_EAX~0_29) (= v_~z$r_buff1_thd0~0_127 0) (= v_~z$r_buff0_thd0~0_88 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t894~0.base_26| 4)) (= v_~z$w_buff1_used~0_415 0) (= 0 |v_#NULL.base_7|) (= 0 v_~z$flush_delayed~0_41) (= v_~b~0_31 0) (= v_~z$w_buff0_used~0_644 0) (= 0 v_~z$r_buff0_thd3~0_138) (= v_~__unbuffered_p1_EBX~0_47 0) (= v_~z$r_buff1_thd2~0_233 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t894~0.base_26| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t894~0.base_26|) |v_ULTIMATE.start_main_~#t894~0.offset_19| 0)) |v_#memory_int_21|) (= v_~x~0_36 0) (= v_~main$tmp_guard1~0_25 0) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t894~0.base_26| 1)) (= |v_ULTIMATE.start_main_~#t894~0.offset_19| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_233, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t895~0.offset=|v_ULTIMATE.start_main_~#t895~0.offset_16|, ~a~0=v_~a~0_68, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_88, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_85, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_~#t896~0.offset=|v_ULTIMATE.start_main_~#t896~0.offset_16|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_85, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_79|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_415, ULTIMATE.start_main_~#t894~0.base=|v_ULTIMATE.start_main_~#t894~0.base_26|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_37|, ~z$flush_delayed~0=v_~z$flush_delayed~0_41, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_~#t895~0.base=|v_ULTIMATE.start_main_~#t895~0.base_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_53|, ~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_4, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_138, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~x~0=v_~x~0_36, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ~z$w_buff1~0=v_~z$w_buff1~0_237, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_4, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_127, ULTIMATE.start_main_~#t894~0.offset=|v_ULTIMATE.start_main_~#t894~0.offset_19|, ULTIMATE.start_main_~#t896~0.base=|v_ULTIMATE.start_main_~#t896~0.base_19|, ~y~0=v_~y~0_12, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_289, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_47, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_644, ~z$w_buff0~0=v_~z$w_buff0~0_373, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_123, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_71|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_77|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, #NULL.base=|v_#NULL.base_7|, ~b~0=v_~b~0_31, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_127, ~weak$$choice2~0=v_~weak$$choice2~0_155, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t895~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t896~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t894~0.base, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t895~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_#t~nondet33, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t894~0.offset, ULTIMATE.start_main_~#t896~0.base, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ~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 16:51:14,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L830-1-->L832: Formula: (and (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t895~0.base_11| 4) |v_#length_15|) (not (= 0 |v_ULTIMATE.start_main_~#t895~0.base_11|)) (= |v_ULTIMATE.start_main_~#t895~0.offset_10| 0) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t895~0.base_11|)) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t895~0.base_11| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t895~0.base_11|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t895~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t895~0.base_11|) |v_ULTIMATE.start_main_~#t895~0.offset_10| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t895~0.base=|v_ULTIMATE.start_main_~#t895~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t895~0.offset=|v_ULTIMATE.start_main_~#t895~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t895~0.base, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t895~0.offset] because there is no mapped edge [2019-12-07 16:51:14,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L832-1-->L834: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t896~0.base_13|) (= |v_ULTIMATE.start_main_~#t896~0.offset_11| 0) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t896~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t896~0.base_13|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t896~0.base_13| 4) |v_#length_17|) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t896~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t896~0.base_13|) |v_ULTIMATE.start_main_~#t896~0.offset_11| 2))) (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t896~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t896~0.offset=|v_ULTIMATE.start_main_~#t896~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t896~0.base=|v_ULTIMATE.start_main_~#t896~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t896~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t896~0.base] because there is no mapped edge [2019-12-07 16:51:14,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L4-->L807: Formula: (and (= v_~z$r_buff0_thd3~0_39 1) (= v_~__unbuffered_p2_EBX~0_7 v_~b~0_7) (= v_~z$r_buff0_thd2~0_71 v_~z$r_buff1_thd2~0_39) (= v_~z$r_buff1_thd1~0_6 v_~z$r_buff0_thd1~0_7) (= v_~z$r_buff0_thd0~0_20 v_~z$r_buff1_thd0~0_19) (= v_~z$r_buff0_thd3~0_40 v_~z$r_buff1_thd3~0_26) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_22)) (= 1 v_~a~0_6) (= v_~__unbuffered_p2_EAX~0_7 v_~a~0_6)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~b~0=v_~b~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_40, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_22, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_71} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_26, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_39, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_22, ~a~0=v_~a~0_6, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~b~0=v_~b~0_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_19, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_39, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_71} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p2_EBX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0] because there is no mapped edge [2019-12-07 16:51:14,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] P0ENTRY-->P0EXIT: Formula: (and (= v_~b~0_22 1) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_P0Thread1of1ForFork0_~arg.offset_6 |v_P0Thread1of1ForFork0_#in~arg.offset_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~x~0_18 1) (= v_P0Thread1of1ForFork0_~arg.base_6 |v_P0Thread1of1ForFork0_#in~arg.base_8|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~b~0=v_~b~0_22, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_6, ~x~0=v_~x~0_18, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_6} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 16:51:14,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In915523228 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite15_Out915523228| ~z$w_buff0_used~0_In915523228) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite14_In915523228| |P1Thread1of1ForFork1_#t~ite14_Out915523228|)) (and .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In915523228 256)))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd2~0_In915523228 256))) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In915523228 256))) (= 0 (mod ~z$w_buff0_used~0_In915523228 256)))) (= |P1Thread1of1ForFork1_#t~ite15_Out915523228| |P1Thread1of1ForFork1_#t~ite14_Out915523228|) (= ~z$w_buff0_used~0_In915523228 |P1Thread1of1ForFork1_#t~ite14_Out915523228|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In915523228, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In915523228, ~z$w_buff1_used~0=~z$w_buff1_used~0_In915523228, ~weak$$choice2~0=~weak$$choice2~0_In915523228, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In915523228, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In915523228|} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In915523228, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In915523228, ~z$w_buff1_used~0=~z$w_buff1_used~0_In915523228, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out915523228|, ~weak$$choice2~0=~weak$$choice2~0_In915523228, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out915523228|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In915523228} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 16:51:14,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L770-->L771: Formula: (and (= v_~z$r_buff0_thd2~0_113 v_~z$r_buff0_thd2~0_112) (not (= (mod v_~weak$$choice2~0_37 256) 0))) InVars {~weak$$choice2~0=v_~weak$$choice2~0_37, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_113} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_13|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_8|, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_5|, ~weak$$choice2~0=v_~weak$$choice2~0_37, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_112} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 16:51:14,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L773-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_13 256) 0)) (= 0 v_~z$flush_delayed~0_12) (= v_~z~0_41 v_~z$mem_tmp~0_6) (= (+ v_~__unbuffered_cnt~0_26 1) v_~__unbuffered_cnt~0_25)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~z$flush_delayed~0=v_~z$flush_delayed~0_13} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ~z~0=v_~z~0_41, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_13|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 16:51:14,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-597348658 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-597348658 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite28_Out-597348658| ~z$w_buff0_used~0_In-597348658)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite28_Out-597348658| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-597348658, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-597348658} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-597348658, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-597348658, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out-597348658|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 16:51:14,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L809-->L809-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In17925070 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In17925070 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In17925070 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In17925070 256)))) (or (and (= ~z$w_buff1_used~0_In17925070 |P2Thread1of1ForFork2_#t~ite29_Out17925070|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork2_#t~ite29_Out17925070| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In17925070, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In17925070, ~z$w_buff1_used~0=~z$w_buff1_used~0_In17925070, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In17925070} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In17925070, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In17925070, ~z$w_buff1_used~0=~z$w_buff1_used~0_In17925070, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In17925070, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out17925070|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 16:51:14,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L810-->L811: Formula: (let ((.cse1 (= ~z$r_buff0_thd3~0_In459121037 ~z$r_buff0_thd3~0_Out459121037)) (.cse2 (= (mod ~z$w_buff0_used~0_In459121037 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In459121037 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (not .cse0) (= ~z$r_buff0_thd3~0_Out459121037 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In459121037, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In459121037} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out459121037|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In459121037, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out459121037} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 16:51:14,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L811-->L811-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In575588700 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In575588700 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In575588700 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In575588700 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite31_Out575588700|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$r_buff1_thd3~0_In575588700 |P2Thread1of1ForFork2_#t~ite31_Out575588700|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In575588700, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In575588700, ~z$w_buff1_used~0=~z$w_buff1_used~0_In575588700, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In575588700} OutVars{P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out575588700|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In575588700, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In575588700, ~z$w_buff1_used~0=~z$w_buff1_used~0_In575588700, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In575588700} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 16:51:14,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L811-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_46 1) v_~__unbuffered_cnt~0_45) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite31_28| v_~z$r_buff1_thd3~0_49)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_27|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_49, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 16:51:14,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [604] [604] L834-1-->L840: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_13) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 16:51:14,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L840-2-->L840-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-957089756 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-957089756 256) 0))) (or (and (or .cse0 .cse1) (= ~z~0_In-957089756 |ULTIMATE.start_main_#t~ite35_Out-957089756|)) (and (= ~z$w_buff1~0_In-957089756 |ULTIMATE.start_main_#t~ite35_Out-957089756|) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-957089756, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-957089756, ~z$w_buff1~0=~z$w_buff1~0_In-957089756, ~z~0=~z~0_In-957089756} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-957089756, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-957089756|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-957089756, ~z$w_buff1~0=~z$w_buff1~0_In-957089756, ~z~0=~z~0_In-957089756} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-07 16:51:14,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L840-4-->L841: Formula: (= v_~z~0_31 |v_ULTIMATE.start_main_#t~ite35_22|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_22|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_21|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_19|, ~z~0=v_~z~0_31} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~z~0] because there is no mapped edge [2019-12-07 16:51:14,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L841-->L841-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In629134431 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In629134431 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite37_Out629134431|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In629134431 |ULTIMATE.start_main_#t~ite37_Out629134431|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In629134431, ~z$w_buff0_used~0=~z$w_buff0_used~0_In629134431} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In629134431, ~z$w_buff0_used~0=~z$w_buff0_used~0_In629134431, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out629134431|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 16:51:14,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L842-->L842-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1903422540 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1903422540 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-1903422540 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1903422540 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite38_Out-1903422540|)) (and (= ~z$w_buff1_used~0_In-1903422540 |ULTIMATE.start_main_#t~ite38_Out-1903422540|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1903422540, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1903422540, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1903422540, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1903422540} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1903422540, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1903422540, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1903422540, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1903422540, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1903422540|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 16:51:14,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L843-->L843-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1765100893 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1765100893 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite39_Out-1765100893| ~z$r_buff0_thd0~0_In-1765100893)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite39_Out-1765100893| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1765100893, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1765100893} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1765100893, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1765100893|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1765100893} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 16:51:14,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L844-->L844-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In1925094295 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1925094295 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1925094295 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1925094295 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1925094295| ~z$r_buff1_thd0~0_In1925094295) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite40_Out1925094295| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1925094295, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1925094295, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1925094295, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1925094295} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1925094295, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1925094295|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1925094295, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1925094295, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1925094295} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 16:51:14,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_80) (= 1 v_~__unbuffered_p1_EAX~0_24) (= v_~__unbuffered_p2_EBX~0_80 0) (= v_~x~0_31 2) (= v_~__unbuffered_p1_EBX~0_41 0))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~z$r_buff1_thd0~0_122 |v_ULTIMATE.start_main_#t~ite40_46|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_41, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_80, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_80, ~x~0=v_~x~0_31} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_41, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_80, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_122, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_80, ~x~0=v_~x~0_31, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 16:51:14,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:51:14 BasicIcfg [2019-12-07 16:51:14,929 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:51:14,929 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:51:14,929 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:51:14,929 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:51:14,930 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:51:06" (3/4) ... [2019-12-07 16:51:14,931 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 16:51:14,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= 0 v_~weak$$choice0~0_10) (= v_~weak$$choice2~0_155 0) (= 0 v_~z$r_buff1_thd1~0_69) (= 0 v_~__unbuffered_cnt~0_89) (= v_~z$w_buff1~0_237 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t894~0.base_26|) 0) (= 0 v_~z$r_buff1_thd3~0_123) (= 0 v_~__unbuffered_p2_EAX~0_85) (= |v_#NULL.offset_7| 0) (= v_~main$tmp_guard0~0_18 0) (= v_~z~0_127 0) (= v_~z$mem_tmp~0_16 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t894~0.base_26|) (= v_~z$r_buff0_thd2~0_289 0) (= v_~z$read_delayed_var~0.base_4 0) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$w_buff0~0_373 0) (= v_~__unbuffered_p2_EBX~0_85 0) (= v_~z$read_delayed~0_5 0) (= v_~z$read_delayed_var~0.offset_4 0) (= v_~a~0_68 0) (= v_~z$r_buff0_thd1~0_24 0) (= v_~y~0_12 0) (= 0 v_~__unbuffered_p1_EAX~0_29) (= v_~z$r_buff1_thd0~0_127 0) (= v_~z$r_buff0_thd0~0_88 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t894~0.base_26| 4)) (= v_~z$w_buff1_used~0_415 0) (= 0 |v_#NULL.base_7|) (= 0 v_~z$flush_delayed~0_41) (= v_~b~0_31 0) (= v_~z$w_buff0_used~0_644 0) (= 0 v_~z$r_buff0_thd3~0_138) (= v_~__unbuffered_p1_EBX~0_47 0) (= v_~z$r_buff1_thd2~0_233 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t894~0.base_26| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t894~0.base_26|) |v_ULTIMATE.start_main_~#t894~0.offset_19| 0)) |v_#memory_int_21|) (= v_~x~0_36 0) (= v_~main$tmp_guard1~0_25 0) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t894~0.base_26| 1)) (= |v_ULTIMATE.start_main_~#t894~0.offset_19| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_233, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t895~0.offset=|v_ULTIMATE.start_main_~#t895~0.offset_16|, ~a~0=v_~a~0_68, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_88, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_85, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_~#t896~0.offset=|v_ULTIMATE.start_main_~#t896~0.offset_16|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_85, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_79|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_415, ULTIMATE.start_main_~#t894~0.base=|v_ULTIMATE.start_main_~#t894~0.base_26|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_37|, ~z$flush_delayed~0=v_~z$flush_delayed~0_41, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_~#t895~0.base=|v_ULTIMATE.start_main_~#t895~0.base_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_53|, ~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_4, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_138, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~x~0=v_~x~0_36, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ~z$w_buff1~0=v_~z$w_buff1~0_237, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_4, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_127, ULTIMATE.start_main_~#t894~0.offset=|v_ULTIMATE.start_main_~#t894~0.offset_19|, ULTIMATE.start_main_~#t896~0.base=|v_ULTIMATE.start_main_~#t896~0.base_19|, ~y~0=v_~y~0_12, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_289, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_47, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_644, ~z$w_buff0~0=v_~z$w_buff0~0_373, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_123, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_71|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_77|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, #NULL.base=|v_#NULL.base_7|, ~b~0=v_~b~0_31, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_127, ~weak$$choice2~0=v_~weak$$choice2~0_155, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t895~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t896~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t894~0.base, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t895~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_#t~nondet33, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t894~0.offset, ULTIMATE.start_main_~#t896~0.base, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ~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 16:51:14,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L830-1-->L832: Formula: (and (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t895~0.base_11| 4) |v_#length_15|) (not (= 0 |v_ULTIMATE.start_main_~#t895~0.base_11|)) (= |v_ULTIMATE.start_main_~#t895~0.offset_10| 0) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t895~0.base_11|)) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t895~0.base_11| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t895~0.base_11|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t895~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t895~0.base_11|) |v_ULTIMATE.start_main_~#t895~0.offset_10| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t895~0.base=|v_ULTIMATE.start_main_~#t895~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t895~0.offset=|v_ULTIMATE.start_main_~#t895~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t895~0.base, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t895~0.offset] because there is no mapped edge [2019-12-07 16:51:14,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L832-1-->L834: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t896~0.base_13|) (= |v_ULTIMATE.start_main_~#t896~0.offset_11| 0) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t896~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t896~0.base_13|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t896~0.base_13| 4) |v_#length_17|) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t896~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t896~0.base_13|) |v_ULTIMATE.start_main_~#t896~0.offset_11| 2))) (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t896~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t896~0.offset=|v_ULTIMATE.start_main_~#t896~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t896~0.base=|v_ULTIMATE.start_main_~#t896~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t896~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t896~0.base] because there is no mapped edge [2019-12-07 16:51:14,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L4-->L807: Formula: (and (= v_~z$r_buff0_thd3~0_39 1) (= v_~__unbuffered_p2_EBX~0_7 v_~b~0_7) (= v_~z$r_buff0_thd2~0_71 v_~z$r_buff1_thd2~0_39) (= v_~z$r_buff1_thd1~0_6 v_~z$r_buff0_thd1~0_7) (= v_~z$r_buff0_thd0~0_20 v_~z$r_buff1_thd0~0_19) (= v_~z$r_buff0_thd3~0_40 v_~z$r_buff1_thd3~0_26) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_22)) (= 1 v_~a~0_6) (= v_~__unbuffered_p2_EAX~0_7 v_~a~0_6)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~b~0=v_~b~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_40, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_22, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_71} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_26, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_39, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_22, ~a~0=v_~a~0_6, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~b~0=v_~b~0_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_19, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_39, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_71} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p2_EBX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0] because there is no mapped edge [2019-12-07 16:51:14,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] P0ENTRY-->P0EXIT: Formula: (and (= v_~b~0_22 1) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_P0Thread1of1ForFork0_~arg.offset_6 |v_P0Thread1of1ForFork0_#in~arg.offset_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~x~0_18 1) (= v_P0Thread1of1ForFork0_~arg.base_6 |v_P0Thread1of1ForFork0_#in~arg.base_8|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~b~0=v_~b~0_22, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_6, ~x~0=v_~x~0_18, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_6} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 16:51:14,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In915523228 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite15_Out915523228| ~z$w_buff0_used~0_In915523228) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite14_In915523228| |P1Thread1of1ForFork1_#t~ite14_Out915523228|)) (and .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In915523228 256)))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd2~0_In915523228 256))) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In915523228 256))) (= 0 (mod ~z$w_buff0_used~0_In915523228 256)))) (= |P1Thread1of1ForFork1_#t~ite15_Out915523228| |P1Thread1of1ForFork1_#t~ite14_Out915523228|) (= ~z$w_buff0_used~0_In915523228 |P1Thread1of1ForFork1_#t~ite14_Out915523228|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In915523228, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In915523228, ~z$w_buff1_used~0=~z$w_buff1_used~0_In915523228, ~weak$$choice2~0=~weak$$choice2~0_In915523228, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In915523228, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In915523228|} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In915523228, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In915523228, ~z$w_buff1_used~0=~z$w_buff1_used~0_In915523228, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out915523228|, ~weak$$choice2~0=~weak$$choice2~0_In915523228, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out915523228|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In915523228} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 16:51:14,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L770-->L771: Formula: (and (= v_~z$r_buff0_thd2~0_113 v_~z$r_buff0_thd2~0_112) (not (= (mod v_~weak$$choice2~0_37 256) 0))) InVars {~weak$$choice2~0=v_~weak$$choice2~0_37, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_113} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_13|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_8|, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_5|, ~weak$$choice2~0=v_~weak$$choice2~0_37, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_112} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 16:51:14,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L773-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_13 256) 0)) (= 0 v_~z$flush_delayed~0_12) (= v_~z~0_41 v_~z$mem_tmp~0_6) (= (+ v_~__unbuffered_cnt~0_26 1) v_~__unbuffered_cnt~0_25)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~z$flush_delayed~0=v_~z$flush_delayed~0_13} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ~z~0=v_~z~0_41, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_13|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 16:51:14,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-597348658 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-597348658 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite28_Out-597348658| ~z$w_buff0_used~0_In-597348658)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite28_Out-597348658| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-597348658, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-597348658} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-597348658, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-597348658, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out-597348658|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 16:51:14,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L809-->L809-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In17925070 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In17925070 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In17925070 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In17925070 256)))) (or (and (= ~z$w_buff1_used~0_In17925070 |P2Thread1of1ForFork2_#t~ite29_Out17925070|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork2_#t~ite29_Out17925070| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In17925070, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In17925070, ~z$w_buff1_used~0=~z$w_buff1_used~0_In17925070, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In17925070} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In17925070, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In17925070, ~z$w_buff1_used~0=~z$w_buff1_used~0_In17925070, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In17925070, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out17925070|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 16:51:14,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L810-->L811: Formula: (let ((.cse1 (= ~z$r_buff0_thd3~0_In459121037 ~z$r_buff0_thd3~0_Out459121037)) (.cse2 (= (mod ~z$w_buff0_used~0_In459121037 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In459121037 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (not .cse0) (= ~z$r_buff0_thd3~0_Out459121037 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In459121037, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In459121037} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out459121037|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In459121037, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out459121037} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 16:51:14,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L811-->L811-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In575588700 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In575588700 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In575588700 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In575588700 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite31_Out575588700|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$r_buff1_thd3~0_In575588700 |P2Thread1of1ForFork2_#t~ite31_Out575588700|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In575588700, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In575588700, ~z$w_buff1_used~0=~z$w_buff1_used~0_In575588700, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In575588700} OutVars{P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out575588700|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In575588700, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In575588700, ~z$w_buff1_used~0=~z$w_buff1_used~0_In575588700, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In575588700} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 16:51:14,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L811-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_46 1) v_~__unbuffered_cnt~0_45) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite31_28| v_~z$r_buff1_thd3~0_49)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_27|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_49, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 16:51:14,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [604] [604] L834-1-->L840: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_13) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 16:51:14,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L840-2-->L840-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-957089756 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-957089756 256) 0))) (or (and (or .cse0 .cse1) (= ~z~0_In-957089756 |ULTIMATE.start_main_#t~ite35_Out-957089756|)) (and (= ~z$w_buff1~0_In-957089756 |ULTIMATE.start_main_#t~ite35_Out-957089756|) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-957089756, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-957089756, ~z$w_buff1~0=~z$w_buff1~0_In-957089756, ~z~0=~z~0_In-957089756} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-957089756, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-957089756|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-957089756, ~z$w_buff1~0=~z$w_buff1~0_In-957089756, ~z~0=~z~0_In-957089756} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-07 16:51:14,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L840-4-->L841: Formula: (= v_~z~0_31 |v_ULTIMATE.start_main_#t~ite35_22|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_22|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_21|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_19|, ~z~0=v_~z~0_31} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~z~0] because there is no mapped edge [2019-12-07 16:51:14,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L841-->L841-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In629134431 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In629134431 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite37_Out629134431|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In629134431 |ULTIMATE.start_main_#t~ite37_Out629134431|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In629134431, ~z$w_buff0_used~0=~z$w_buff0_used~0_In629134431} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In629134431, ~z$w_buff0_used~0=~z$w_buff0_used~0_In629134431, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out629134431|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 16:51:14,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L842-->L842-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1903422540 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1903422540 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-1903422540 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1903422540 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite38_Out-1903422540|)) (and (= ~z$w_buff1_used~0_In-1903422540 |ULTIMATE.start_main_#t~ite38_Out-1903422540|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1903422540, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1903422540, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1903422540, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1903422540} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1903422540, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1903422540, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1903422540, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1903422540, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1903422540|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 16:51:14,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L843-->L843-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1765100893 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1765100893 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite39_Out-1765100893| ~z$r_buff0_thd0~0_In-1765100893)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite39_Out-1765100893| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1765100893, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1765100893} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1765100893, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1765100893|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1765100893} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 16:51:14,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L844-->L844-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In1925094295 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1925094295 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1925094295 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1925094295 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1925094295| ~z$r_buff1_thd0~0_In1925094295) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite40_Out1925094295| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1925094295, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1925094295, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1925094295, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1925094295} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1925094295, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1925094295|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1925094295, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1925094295, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1925094295} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 16:51:14,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_80) (= 1 v_~__unbuffered_p1_EAX~0_24) (= v_~__unbuffered_p2_EBX~0_80 0) (= v_~x~0_31 2) (= v_~__unbuffered_p1_EBX~0_41 0))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~z$r_buff1_thd0~0_122 |v_ULTIMATE.start_main_#t~ite40_46|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_41, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_80, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_80, ~x~0=v_~x~0_31} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_41, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_80, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_122, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_80, ~x~0=v_~x~0_31, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 16:51:14,997 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c4877987-3f24-4785-a791-d8e15cc6056b/bin/utaipan/witness.graphml [2019-12-07 16:51:14,998 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:51:14,999 INFO L168 Benchmark]: Toolchain (without parser) took 8877.36 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 439.9 MB). Free memory was 938.1 MB in the beginning and 691.8 MB in the end (delta: 246.3 MB). Peak memory consumption was 686.2 MB. Max. memory is 11.5 GB. [2019-12-07 16:51:14,999 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:51:14,999 INFO L168 Benchmark]: CACSL2BoogieTranslator took 379.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 77.1 MB). Free memory was 938.1 MB in the beginning and 1.0 GB in the end (delta: -105.3 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 16:51:15,000 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:51:15,000 INFO L168 Benchmark]: Boogie Preprocessor took 24.28 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:51:15,000 INFO L168 Benchmark]: RCFGBuilder took 380.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 988.6 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:51:15,000 INFO L168 Benchmark]: TraceAbstraction took 7984.13 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 362.8 MB). Free memory was 988.6 MB in the beginning and 717.9 MB in the end (delta: 270.7 MB). Peak memory consumption was 633.5 MB. Max. memory is 11.5 GB. [2019-12-07 16:51:15,001 INFO L168 Benchmark]: Witness Printer took 68.54 ms. Allocated memory is still 1.5 GB. Free memory was 717.9 MB in the beginning and 691.8 MB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-12-07 16:51:15,002 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 379.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 77.1 MB). Free memory was 938.1 MB in the beginning and 1.0 GB in the end (delta: -105.3 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.28 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 380.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 988.6 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7984.13 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 362.8 MB). Free memory was 988.6 MB in the beginning and 717.9 MB in the end (delta: 270.7 MB). Peak memory consumption was 633.5 MB. Max. memory is 11.5 GB. * Witness Printer took 68.54 ms. Allocated memory is still 1.5 GB. Free memory was 717.9 MB in the beginning and 691.8 MB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.9s, 155 ProgramPointsBefore, 70 ProgramPointsAfterwards, 180 TransitionsBefore, 78 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 21 ChoiceCompositions, 4873 VarBasedMoverChecksPositive, 192 VarBasedMoverChecksNegative, 55 SemBasedMoverChecksPositive, 173 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.7s, 0 MoverChecksTotal, 39797 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t894, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] FCALL, FORK 0 pthread_create(&t895, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] FCALL, FORK 0 pthread_create(&t896, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] 3 z$w_buff1 = z$w_buff0 [L787] 3 z$w_buff0 = 1 [L788] 3 z$w_buff1_used = z$w_buff0_used [L789] 3 z$w_buff0_used = (_Bool)1 [L752] 2 x = 2 [L755] 2 y = 1 [L758] 2 __unbuffered_p1_EAX = y [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 z$flush_delayed = weak$$choice2 [L764] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L766] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L767] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L768] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L808] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L809] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L840] 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}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L842] 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 [L843] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 146 locations, 2 error locations. Result: UNSAFE, OverallTime: 7.8s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1086 SDtfs, 971 SDslu, 1328 SDs, 0 SdLazy, 584 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19982occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 10202 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 301 NumberOfCodeBlocks, 301 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 245 ConstructedInterpolants, 0 QuantifiedInterpolants, 19535 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...