./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix000_rmo.oepc.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_f3fb16d0-5b8a-48e8-8e35-3ea4d2c65e6a/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f3fb16d0-5b8a-48e8-8e35-3ea4d2c65e6a/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f3fb16d0-5b8a-48e8-8e35-3ea4d2c65e6a/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f3fb16d0-5b8a-48e8-8e35-3ea4d2c65e6a/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix000_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_f3fb16d0-5b8a-48e8-8e35-3ea4d2c65e6a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f3fb16d0-5b8a-48e8-8e35-3ea4d2c65e6a/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 894d4f58c4dbc16c2c024d8950af736994705dfb ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 12:07:34,205 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:07:34,206 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:07:34,215 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:07:34,216 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:07:34,216 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:07:34,217 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:07:34,219 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:07:34,220 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:07:34,221 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:07:34,222 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:07:34,222 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:07:34,223 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:07:34,223 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:07:34,224 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:07:34,225 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:07:34,225 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:07:34,226 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:07:34,227 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:07:34,229 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:07:34,230 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:07:34,230 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:07:34,231 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:07:34,231 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:07:34,233 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:07:34,233 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:07:34,233 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:07:34,234 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:07:34,234 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:07:34,235 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:07:34,235 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:07:34,235 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:07:34,236 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:07:34,237 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:07:34,237 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:07:34,238 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:07:34,238 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:07:34,238 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:07:34,238 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:07:34,239 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:07:34,240 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:07:34,241 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f3fb16d0-5b8a-48e8-8e35-3ea4d2c65e6a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 12:07:34,251 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:07:34,251 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:07:34,251 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 12:07:34,252 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 12:07:34,252 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 12:07:34,252 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 12:07:34,252 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 12:07:34,252 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 12:07:34,252 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 12:07:34,252 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 12:07:34,252 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 12:07:34,253 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 12:07:34,253 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 12:07:34,253 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 12:07:34,253 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 12:07:34,253 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:07:34,254 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:07:34,254 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:07:34,254 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:07:34,254 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:07:34,254 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:07:34,254 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:07:34,254 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:07:34,254 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 12:07:34,254 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:07:34,255 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:07:34,255 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:07:34,255 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:07:34,255 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:07:34,255 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:07:34,255 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:07:34,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:07:34,255 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:07:34,255 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:07:34,256 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:07:34,256 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 12:07:34,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:07:34,256 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:07:34,256 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:07:34,256 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 12:07:34,256 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_f3fb16d0-5b8a-48e8-8e35-3ea4d2c65e6a/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 -> 894d4f58c4dbc16c2c024d8950af736994705dfb [2019-12-07 12:07:34,355 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:07:34,365 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:07:34,367 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:07:34,369 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:07:34,369 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:07:34,370 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f3fb16d0-5b8a-48e8-8e35-3ea4d2c65e6a/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix000_rmo.oepc.i [2019-12-07 12:07:34,415 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f3fb16d0-5b8a-48e8-8e35-3ea4d2c65e6a/bin/utaipan/data/834f5b075/43c92592a6e94740948fba1b717d2edd/FLAG0786ceff8 [2019-12-07 12:07:34,865 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:07:34,865 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f3fb16d0-5b8a-48e8-8e35-3ea4d2c65e6a/sv-benchmarks/c/pthread-wmm/mix000_rmo.oepc.i [2019-12-07 12:07:34,875 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f3fb16d0-5b8a-48e8-8e35-3ea4d2c65e6a/bin/utaipan/data/834f5b075/43c92592a6e94740948fba1b717d2edd/FLAG0786ceff8 [2019-12-07 12:07:34,884 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f3fb16d0-5b8a-48e8-8e35-3ea4d2c65e6a/bin/utaipan/data/834f5b075/43c92592a6e94740948fba1b717d2edd [2019-12-07 12:07:34,886 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:07:34,887 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:07:34,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:07:34,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:07:34,890 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:07:34,890 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:07:34" (1/1) ... [2019-12-07 12:07:34,892 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2ff042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:07:34, skipping insertion in model container [2019-12-07 12:07:34,892 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:07:34" (1/1) ... [2019-12-07 12:07:34,897 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:07:34,924 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:07:35,204 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:07:35,215 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:07:35,273 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:07:35,322 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:07:35,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:07:35 WrapperNode [2019-12-07 12:07:35,322 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:07:35,323 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:07:35,323 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:07:35,323 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:07:35,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:07:35" (1/1) ... [2019-12-07 12:07:35,346 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:07:35" (1/1) ... [2019-12-07 12:07:35,369 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:07:35,369 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:07:35,369 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:07:35,369 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:07:35,376 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:07:35" (1/1) ... [2019-12-07 12:07:35,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:07:35" (1/1) ... [2019-12-07 12:07:35,379 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:07:35" (1/1) ... [2019-12-07 12:07:35,379 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:07:35" (1/1) ... [2019-12-07 12:07:35,387 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:07:35" (1/1) ... [2019-12-07 12:07:35,390 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:07:35" (1/1) ... [2019-12-07 12:07:35,392 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:07:35" (1/1) ... [2019-12-07 12:07:35,396 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:07:35,396 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:07:35,396 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:07:35,396 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:07:35,397 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:07:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3fb16d0-5b8a-48e8-8e35-3ea4d2c65e6a/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 12:07:35,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 12:07:35,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 12:07:35,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:07:35,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:07:35,440 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 12:07:35,440 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 12:07:35,440 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 12:07:35,440 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 12:07:35,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 12:07:35,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:07:35,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:07:35,441 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 12:07:35,842 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:07:35,842 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 12:07:35,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:07:35 BoogieIcfgContainer [2019-12-07 12:07:35,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:07:35,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:07:35,844 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:07:35,846 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:07:35,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:07:34" (1/3) ... [2019-12-07 12:07:35,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cd6d43d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:07:35, skipping insertion in model container [2019-12-07 12:07:35,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:07:35" (2/3) ... [2019-12-07 12:07:35,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cd6d43d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:07:35, skipping insertion in model container [2019-12-07 12:07:35,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:07:35" (3/3) ... [2019-12-07 12:07:35,849 INFO L109 eAbstractionObserver]: Analyzing ICFG mix000_rmo.oepc.i [2019-12-07 12:07:35,855 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 12:07:35,855 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:07:35,860 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 12:07:35,861 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 12:07:35,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,889 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,889 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,889 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,889 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,890 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,904 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,904 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:07:35,929 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 12:07:35,941 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:07:35,942 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:07:35,942 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:07:35,942 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:07:35,942 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:07:35,942 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:07:35,942 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:07:35,942 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:07:35,953 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 246 transitions [2019-12-07 12:07:35,954 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 191 places, 246 transitions [2019-12-07 12:07:36,033 INFO L134 PetriNetUnfolder]: 62/244 cut-off events. [2019-12-07 12:07:36,034 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:07:36,050 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 244 events. 62/244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1032 event pairs. 6/186 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-07 12:07:36,073 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 191 places, 246 transitions [2019-12-07 12:07:36,110 INFO L134 PetriNetUnfolder]: 62/244 cut-off events. [2019-12-07 12:07:36,110 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:07:36,119 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 244 events. 62/244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1032 event pairs. 6/186 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-07 12:07:36,144 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 27428 [2019-12-07 12:07:36,145 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 12:07:39,253 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-12-07 12:07:39,523 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-07 12:07:39,621 INFO L206 etLargeBlockEncoding]: Checked pairs total: 146813 [2019-12-07 12:07:39,621 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-07 12:07:39,623 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 113 places, 136 transitions [2019-12-07 12:07:41,222 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 29658 states. [2019-12-07 12:07:41,223 INFO L276 IsEmpty]: Start isEmpty. Operand 29658 states. [2019-12-07 12:07:41,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 12:07:41,227 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:07:41,227 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 12:07:41,228 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:07:41,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:07:41,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1084682, now seen corresponding path program 1 times [2019-12-07 12:07:41,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:07:41,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711747714] [2019-12-07 12:07:41,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:07:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:07:41,365 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 12:07:41,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711747714] [2019-12-07 12:07:41,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:07:41,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:07:41,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596686284] [2019-12-07 12:07:41,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:07:41,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:07:41,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:07:41,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:07:41,380 INFO L87 Difference]: Start difference. First operand 29658 states. Second operand 3 states. [2019-12-07 12:07:41,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:07:41,667 INFO L93 Difference]: Finished difference Result 29506 states and 103746 transitions. [2019-12-07 12:07:41,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:07:41,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 12:07:41,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:07:41,825 INFO L225 Difference]: With dead ends: 29506 [2019-12-07 12:07:41,825 INFO L226 Difference]: Without dead ends: 27490 [2019-12-07 12:07:41,826 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 12:07:42,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27490 states. [2019-12-07 12:07:42,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27490 to 27490. [2019-12-07 12:07:42,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27490 states. [2019-12-07 12:07:42,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27490 states to 27490 states and 96576 transitions. [2019-12-07 12:07:42,840 INFO L78 Accepts]: Start accepts. Automaton has 27490 states and 96576 transitions. Word has length 3 [2019-12-07 12:07:42,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:07:42,840 INFO L462 AbstractCegarLoop]: Abstraction has 27490 states and 96576 transitions. [2019-12-07 12:07:42,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:07:42,840 INFO L276 IsEmpty]: Start isEmpty. Operand 27490 states and 96576 transitions. [2019-12-07 12:07:42,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 12:07:42,843 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:07:42,843 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:07:42,843 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:07:42,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:07:42,843 INFO L82 PathProgramCache]: Analyzing trace with hash -271665278, now seen corresponding path program 1 times [2019-12-07 12:07:42,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:07:42,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672764011] [2019-12-07 12:07:42,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:07:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:07:42,904 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 12:07:42,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672764011] [2019-12-07 12:07:42,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:07:42,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:07:42,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487552286] [2019-12-07 12:07:42,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:07:42,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:07:42,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:07:42,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:07:42,906 INFO L87 Difference]: Start difference. First operand 27490 states and 96576 transitions. Second operand 4 states. [2019-12-07 12:07:43,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:07:43,372 INFO L93 Difference]: Finished difference Result 43940 states and 147802 transitions. [2019-12-07 12:07:43,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:07:43,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 12:07:43,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:07:43,467 INFO L225 Difference]: With dead ends: 43940 [2019-12-07 12:07:43,468 INFO L226 Difference]: Without dead ends: 43933 [2019-12-07 12:07:43,468 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 12:07:44,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43933 states. [2019-12-07 12:07:44,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43933 to 42445. [2019-12-07 12:07:44,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42445 states. [2019-12-07 12:07:44,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42445 states to 42445 states and 143845 transitions. [2019-12-07 12:07:44,555 INFO L78 Accepts]: Start accepts. Automaton has 42445 states and 143845 transitions. Word has length 11 [2019-12-07 12:07:44,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:07:44,555 INFO L462 AbstractCegarLoop]: Abstraction has 42445 states and 143845 transitions. [2019-12-07 12:07:44,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:07:44,555 INFO L276 IsEmpty]: Start isEmpty. Operand 42445 states and 143845 transitions. [2019-12-07 12:07:44,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 12:07:44,560 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:07:44,560 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:07:44,560 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:07:44,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:07:44,560 INFO L82 PathProgramCache]: Analyzing trace with hash 295368792, now seen corresponding path program 1 times [2019-12-07 12:07:44,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:07:44,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302135959] [2019-12-07 12:07:44,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:07:44,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:07:44,705 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 12:07:44,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302135959] [2019-12-07 12:07:44,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:07:44,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:07:44,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764545116] [2019-12-07 12:07:44,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:07:44,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:07:44,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:07:44,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:07:44,706 INFO L87 Difference]: Start difference. First operand 42445 states and 143845 transitions. Second operand 4 states. [2019-12-07 12:07:45,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:07:45,010 INFO L93 Difference]: Finished difference Result 54065 states and 181150 transitions. [2019-12-07 12:07:45,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:07:45,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 12:07:45,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:07:45,101 INFO L225 Difference]: With dead ends: 54065 [2019-12-07 12:07:45,101 INFO L226 Difference]: Without dead ends: 54065 [2019-12-07 12:07:45,101 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:07:45,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54065 states. [2019-12-07 12:07:46,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54065 to 48429. [2019-12-07 12:07:46,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48429 states. [2019-12-07 12:07:46,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48429 states to 48429 states and 163514 transitions. [2019-12-07 12:07:46,277 INFO L78 Accepts]: Start accepts. Automaton has 48429 states and 163514 transitions. Word has length 14 [2019-12-07 12:07:46,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:07:46,278 INFO L462 AbstractCegarLoop]: Abstraction has 48429 states and 163514 transitions. [2019-12-07 12:07:46,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:07:46,278 INFO L276 IsEmpty]: Start isEmpty. Operand 48429 states and 163514 transitions. [2019-12-07 12:07:46,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 12:07:46,281 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:07:46,281 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:07:46,281 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:07:46,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:07:46,281 INFO L82 PathProgramCache]: Analyzing trace with hash 566526627, now seen corresponding path program 1 times [2019-12-07 12:07:46,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:07:46,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474414398] [2019-12-07 12:07:46,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:07:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:07:46,309 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 12:07:46,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474414398] [2019-12-07 12:07:46,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:07:46,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:07:46,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020183198] [2019-12-07 12:07:46,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:07:46,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:07:46,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:07:46,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:07:46,311 INFO L87 Difference]: Start difference. First operand 48429 states and 163514 transitions. Second operand 3 states. [2019-12-07 12:07:46,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:07:46,588 INFO L93 Difference]: Finished difference Result 84362 states and 273188 transitions. [2019-12-07 12:07:46,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:07:46,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 12:07:46,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:07:46,721 INFO L225 Difference]: With dead ends: 84362 [2019-12-07 12:07:46,721 INFO L226 Difference]: Without dead ends: 84362 [2019-12-07 12:07:46,722 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 12:07:47,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84362 states. [2019-12-07 12:07:48,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84362 to 74579. [2019-12-07 12:07:48,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74579 states. [2019-12-07 12:07:48,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74579 states to 74579 states and 244551 transitions. [2019-12-07 12:07:48,377 INFO L78 Accepts]: Start accepts. Automaton has 74579 states and 244551 transitions. Word has length 15 [2019-12-07 12:07:48,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:07:48,377 INFO L462 AbstractCegarLoop]: Abstraction has 74579 states and 244551 transitions. [2019-12-07 12:07:48,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:07:48,377 INFO L276 IsEmpty]: Start isEmpty. Operand 74579 states and 244551 transitions. [2019-12-07 12:07:48,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 12:07:48,381 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:07:48,381 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:07:48,381 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:07:48,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:07:48,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1557518127, now seen corresponding path program 1 times [2019-12-07 12:07:48,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:07:48,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860846534] [2019-12-07 12:07:48,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:07:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:07:48,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:07:48,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860846534] [2019-12-07 12:07:48,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:07:48,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:07:48,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527347422] [2019-12-07 12:07:48,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:07:48,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:07:48,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:07:48,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:07:48,439 INFO L87 Difference]: Start difference. First operand 74579 states and 244551 transitions. Second operand 3 states. [2019-12-07 12:07:48,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:07:48,760 INFO L93 Difference]: Finished difference Result 74600 states and 244461 transitions. [2019-12-07 12:07:48,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:07:48,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 12:07:48,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:07:48,885 INFO L225 Difference]: With dead ends: 74600 [2019-12-07 12:07:48,885 INFO L226 Difference]: Without dead ends: 74600 [2019-12-07 12:07:48,885 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 12:07:49,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74600 states. [2019-12-07 12:07:50,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74600 to 74508. [2019-12-07 12:07:50,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74508 states. [2019-12-07 12:07:50,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74508 states to 74508 states and 244321 transitions. [2019-12-07 12:07:50,516 INFO L78 Accepts]: Start accepts. Automaton has 74508 states and 244321 transitions. Word has length 16 [2019-12-07 12:07:50,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:07:50,517 INFO L462 AbstractCegarLoop]: Abstraction has 74508 states and 244321 transitions. [2019-12-07 12:07:50,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:07:50,517 INFO L276 IsEmpty]: Start isEmpty. Operand 74508 states and 244321 transitions. [2019-12-07 12:07:50,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 12:07:50,521 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:07:50,521 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:07:50,521 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:07:50,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:07:50,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1038427720, now seen corresponding path program 1 times [2019-12-07 12:07:50,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:07:50,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956952785] [2019-12-07 12:07:50,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:07:50,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:07:50,564 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 12:07:50,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956952785] [2019-12-07 12:07:50,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:07:50,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:07:50,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523074456] [2019-12-07 12:07:50,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:07:50,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:07:50,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:07:50,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:07:50,566 INFO L87 Difference]: Start difference. First operand 74508 states and 244321 transitions. Second operand 3 states. [2019-12-07 12:07:50,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:07:50,782 INFO L93 Difference]: Finished difference Result 74508 states and 240926 transitions. [2019-12-07 12:07:50,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:07:50,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 12:07:50,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:07:50,902 INFO L225 Difference]: With dead ends: 74508 [2019-12-07 12:07:50,902 INFO L226 Difference]: Without dead ends: 74508 [2019-12-07 12:07:50,902 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 12:07:51,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74508 states. [2019-12-07 12:07:52,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74508 to 74308. [2019-12-07 12:07:52,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74308 states. [2019-12-07 12:07:53,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74308 states to 74308 states and 240334 transitions. [2019-12-07 12:07:53,734 INFO L78 Accepts]: Start accepts. Automaton has 74308 states and 240334 transitions. Word has length 17 [2019-12-07 12:07:53,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:07:53,735 INFO L462 AbstractCegarLoop]: Abstraction has 74308 states and 240334 transitions. [2019-12-07 12:07:53,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:07:53,735 INFO L276 IsEmpty]: Start isEmpty. Operand 74308 states and 240334 transitions. [2019-12-07 12:07:53,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 12:07:53,739 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:07:53,739 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:07:53,739 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:07:53,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:07:53,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1509366251, now seen corresponding path program 1 times [2019-12-07 12:07:53,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:07:53,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136478235] [2019-12-07 12:07:53,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:07:53,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:07:53,789 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 12:07:53,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136478235] [2019-12-07 12:07:53,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:07:53,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:07:53,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465612066] [2019-12-07 12:07:53,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:07:53,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:07:53,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:07:53,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:07:53,790 INFO L87 Difference]: Start difference. First operand 74308 states and 240334 transitions. Second operand 4 states. [2019-12-07 12:07:54,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:07:54,003 INFO L93 Difference]: Finished difference Result 69911 states and 225616 transitions. [2019-12-07 12:07:54,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:07:54,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 12:07:54,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:07:54,113 INFO L225 Difference]: With dead ends: 69911 [2019-12-07 12:07:54,113 INFO L226 Difference]: Without dead ends: 69911 [2019-12-07 12:07:54,113 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:07:54,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69911 states. [2019-12-07 12:07:55,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69911 to 69911. [2019-12-07 12:07:55,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69911 states. [2019-12-07 12:07:55,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69911 states to 69911 states and 225616 transitions. [2019-12-07 12:07:55,535 INFO L78 Accepts]: Start accepts. Automaton has 69911 states and 225616 transitions. Word has length 17 [2019-12-07 12:07:55,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:07:55,536 INFO L462 AbstractCegarLoop]: Abstraction has 69911 states and 225616 transitions. [2019-12-07 12:07:55,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:07:55,536 INFO L276 IsEmpty]: Start isEmpty. Operand 69911 states and 225616 transitions. [2019-12-07 12:07:55,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 12:07:55,539 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:07:55,539 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:07:55,540 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:07:55,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:07:55,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1206588916, now seen corresponding path program 1 times [2019-12-07 12:07:55,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:07:55,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698288400] [2019-12-07 12:07:55,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:07:55,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:07:55,568 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 12:07:55,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698288400] [2019-12-07 12:07:55,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:07:55,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:07:55,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256540416] [2019-12-07 12:07:55,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:07:55,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:07:55,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:07:55,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:07:55,570 INFO L87 Difference]: Start difference. First operand 69911 states and 225616 transitions. Second operand 4 states. [2019-12-07 12:07:56,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:07:56,087 INFO L93 Difference]: Finished difference Result 85438 states and 273755 transitions. [2019-12-07 12:07:56,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:07:56,088 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 12:07:56,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:07:56,217 INFO L225 Difference]: With dead ends: 85438 [2019-12-07 12:07:56,217 INFO L226 Difference]: Without dead ends: 85438 [2019-12-07 12:07:56,218 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 12:07:56,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85438 states. [2019-12-07 12:07:57,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85438 to 70560. [2019-12-07 12:07:57,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70560 states. [2019-12-07 12:07:57,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70560 states to 70560 states and 227731 transitions. [2019-12-07 12:07:57,788 INFO L78 Accepts]: Start accepts. Automaton has 70560 states and 227731 transitions. Word has length 17 [2019-12-07 12:07:57,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:07:57,788 INFO L462 AbstractCegarLoop]: Abstraction has 70560 states and 227731 transitions. [2019-12-07 12:07:57,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:07:57,788 INFO L276 IsEmpty]: Start isEmpty. Operand 70560 states and 227731 transitions. [2019-12-07 12:07:57,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 12:07:57,795 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:07:57,795 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:07:57,795 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:07:57,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:07:57,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1669716828, now seen corresponding path program 1 times [2019-12-07 12:07:57,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:07:57,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838811769] [2019-12-07 12:07:57,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:07:57,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:07:57,816 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 12:07:57,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838811769] [2019-12-07 12:07:57,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:07:57,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:07:57,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253487648] [2019-12-07 12:07:57,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:07:57,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:07:57,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:07:57,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:07:57,817 INFO L87 Difference]: Start difference. First operand 70560 states and 227731 transitions. Second operand 3 states. [2019-12-07 12:07:57,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:07:57,842 INFO L93 Difference]: Finished difference Result 6495 states and 15036 transitions. [2019-12-07 12:07:57,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:07:57,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 12:07:57,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:07:57,847 INFO L225 Difference]: With dead ends: 6495 [2019-12-07 12:07:57,848 INFO L226 Difference]: Without dead ends: 6495 [2019-12-07 12:07:57,848 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 12:07:57,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6495 states. [2019-12-07 12:07:57,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6495 to 6495. [2019-12-07 12:07:57,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6495 states. [2019-12-07 12:07:57,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6495 states to 6495 states and 15036 transitions. [2019-12-07 12:07:57,921 INFO L78 Accepts]: Start accepts. Automaton has 6495 states and 15036 transitions. Word has length 20 [2019-12-07 12:07:57,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:07:57,921 INFO L462 AbstractCegarLoop]: Abstraction has 6495 states and 15036 transitions. [2019-12-07 12:07:57,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:07:57,922 INFO L276 IsEmpty]: Start isEmpty. Operand 6495 states and 15036 transitions. [2019-12-07 12:07:57,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 12:07:57,924 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:07:57,924 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:07:57,924 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:07:57,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:07:57,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1293061293, now seen corresponding path program 1 times [2019-12-07 12:07:57,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:07:57,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823667873] [2019-12-07 12:07:57,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:07:57,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:07:57,972 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 12:07:57,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823667873] [2019-12-07 12:07:57,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:07:57,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:07:57,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782771506] [2019-12-07 12:07:57,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:07:57,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:07:57,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:07:57,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:07:57,973 INFO L87 Difference]: Start difference. First operand 6495 states and 15036 transitions. Second operand 5 states. [2019-12-07 12:07:58,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:07:58,255 INFO L93 Difference]: Finished difference Result 8792 states and 19920 transitions. [2019-12-07 12:07:58,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:07:58,256 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 12:07:58,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:07:58,262 INFO L225 Difference]: With dead ends: 8792 [2019-12-07 12:07:58,262 INFO L226 Difference]: Without dead ends: 8792 [2019-12-07 12:07:58,262 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:07:58,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8792 states. [2019-12-07 12:07:58,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8792 to 7888. [2019-12-07 12:07:58,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7888 states. [2019-12-07 12:07:58,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7888 states to 7888 states and 18089 transitions. [2019-12-07 12:07:58,339 INFO L78 Accepts]: Start accepts. Automaton has 7888 states and 18089 transitions. Word has length 27 [2019-12-07 12:07:58,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:07:58,339 INFO L462 AbstractCegarLoop]: Abstraction has 7888 states and 18089 transitions. [2019-12-07 12:07:58,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:07:58,339 INFO L276 IsEmpty]: Start isEmpty. Operand 7888 states and 18089 transitions. [2019-12-07 12:07:58,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 12:07:58,343 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:07:58,343 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 12:07:58,343 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:07:58,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:07:58,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1277893089, now seen corresponding path program 1 times [2019-12-07 12:07:58,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:07:58,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263829331] [2019-12-07 12:07:58,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:07:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:07:58,362 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 12:07:58,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263829331] [2019-12-07 12:07:58,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:07:58,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:07:58,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782842444] [2019-12-07 12:07:58,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:07:58,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:07:58,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:07:58,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:07:58,364 INFO L87 Difference]: Start difference. First operand 7888 states and 18089 transitions. Second operand 3 states. [2019-12-07 12:07:58,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:07:58,411 INFO L93 Difference]: Finished difference Result 8877 states and 19243 transitions. [2019-12-07 12:07:58,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:07:58,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-07 12:07:58,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:07:58,417 INFO L225 Difference]: With dead ends: 8877 [2019-12-07 12:07:58,417 INFO L226 Difference]: Without dead ends: 8877 [2019-12-07 12:07:58,418 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 12:07:58,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8877 states. [2019-12-07 12:07:58,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8877 to 7937. [2019-12-07 12:07:58,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7937 states. [2019-12-07 12:07:58,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7937 states to 7937 states and 17330 transitions. [2019-12-07 12:07:58,492 INFO L78 Accepts]: Start accepts. Automaton has 7937 states and 17330 transitions. Word has length 30 [2019-12-07 12:07:58,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:07:58,492 INFO L462 AbstractCegarLoop]: Abstraction has 7937 states and 17330 transitions. [2019-12-07 12:07:58,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:07:58,492 INFO L276 IsEmpty]: Start isEmpty. Operand 7937 states and 17330 transitions. [2019-12-07 12:07:58,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 12:07:58,496 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:07:58,496 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:07:58,496 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:07:58,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:07:58,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1657093328, now seen corresponding path program 1 times [2019-12-07 12:07:58,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:07:58,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083946218] [2019-12-07 12:07:58,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:07:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:07:58,533 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 12:07:58,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083946218] [2019-12-07 12:07:58,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:07:58,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:07:58,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090590144] [2019-12-07 12:07:58,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:07:58,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:07:58,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:07:58,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:07:58,534 INFO L87 Difference]: Start difference. First operand 7937 states and 17330 transitions. Second operand 5 states. [2019-12-07 12:07:58,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:07:58,767 INFO L93 Difference]: Finished difference Result 9260 states and 19952 transitions. [2019-12-07 12:07:58,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:07:58,767 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-07 12:07:58,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:07:58,773 INFO L225 Difference]: With dead ends: 9260 [2019-12-07 12:07:58,773 INFO L226 Difference]: Without dead ends: 9260 [2019-12-07 12:07:58,773 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:07:58,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9260 states. [2019-12-07 12:07:58,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9260 to 7281. [2019-12-07 12:07:58,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7281 states. [2019-12-07 12:07:58,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7281 states to 7281 states and 15997 transitions. [2019-12-07 12:07:58,843 INFO L78 Accepts]: Start accepts. Automaton has 7281 states and 15997 transitions. Word has length 33 [2019-12-07 12:07:58,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:07:58,843 INFO L462 AbstractCegarLoop]: Abstraction has 7281 states and 15997 transitions. [2019-12-07 12:07:58,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:07:58,844 INFO L276 IsEmpty]: Start isEmpty. Operand 7281 states and 15997 transitions. [2019-12-07 12:07:58,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 12:07:58,848 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:07:58,848 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] [2019-12-07 12:07:58,849 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:07:58,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:07:58,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1233120795, now seen corresponding path program 1 times [2019-12-07 12:07:58,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:07:58,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625466886] [2019-12-07 12:07:58,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:07:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:07:58,895 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 12:07:58,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625466886] [2019-12-07 12:07:58,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:07:58,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:07:58,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368004534] [2019-12-07 12:07:58,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:07:58,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:07:58,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:07:58,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:07:58,896 INFO L87 Difference]: Start difference. First operand 7281 states and 15997 transitions. Second operand 6 states. [2019-12-07 12:07:59,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:07:59,255 INFO L93 Difference]: Finished difference Result 9812 states and 20992 transitions. [2019-12-07 12:07:59,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 12:07:59,256 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-07 12:07:59,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:07:59,262 INFO L225 Difference]: With dead ends: 9812 [2019-12-07 12:07:59,263 INFO L226 Difference]: Without dead ends: 9811 [2019-12-07 12:07:59,263 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:07:59,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9811 states. [2019-12-07 12:07:59,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9811 to 9002. [2019-12-07 12:07:59,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9002 states. [2019-12-07 12:07:59,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9002 states to 9002 states and 19455 transitions. [2019-12-07 12:07:59,343 INFO L78 Accepts]: Start accepts. Automaton has 9002 states and 19455 transitions. Word has length 39 [2019-12-07 12:07:59,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:07:59,343 INFO L462 AbstractCegarLoop]: Abstraction has 9002 states and 19455 transitions. [2019-12-07 12:07:59,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:07:59,344 INFO L276 IsEmpty]: Start isEmpty. Operand 9002 states and 19455 transitions. [2019-12-07 12:07:59,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 12:07:59,350 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:07:59,350 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] [2019-12-07 12:07:59,350 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:07:59,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:07:59,350 INFO L82 PathProgramCache]: Analyzing trace with hash 94263077, now seen corresponding path program 1 times [2019-12-07 12:07:59,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:07:59,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184231929] [2019-12-07 12:07:59,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:07:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:07:59,388 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 12:07:59,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184231929] [2019-12-07 12:07:59,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:07:59,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:07:59,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291900817] [2019-12-07 12:07:59,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:07:59,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:07:59,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:07:59,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:07:59,389 INFO L87 Difference]: Start difference. First operand 9002 states and 19455 transitions. Second operand 3 states. [2019-12-07 12:07:59,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:07:59,442 INFO L93 Difference]: Finished difference Result 9001 states and 19453 transitions. [2019-12-07 12:07:59,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:07:59,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-07 12:07:59,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:07:59,449 INFO L225 Difference]: With dead ends: 9001 [2019-12-07 12:07:59,449 INFO L226 Difference]: Without dead ends: 9001 [2019-12-07 12:07:59,449 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 12:07:59,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9001 states. [2019-12-07 12:07:59,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9001 to 9001. [2019-12-07 12:07:59,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9001 states. [2019-12-07 12:07:59,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9001 states to 9001 states and 19453 transitions. [2019-12-07 12:07:59,525 INFO L78 Accepts]: Start accepts. Automaton has 9001 states and 19453 transitions. Word has length 42 [2019-12-07 12:07:59,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:07:59,525 INFO L462 AbstractCegarLoop]: Abstraction has 9001 states and 19453 transitions. [2019-12-07 12:07:59,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:07:59,525 INFO L276 IsEmpty]: Start isEmpty. Operand 9001 states and 19453 transitions. [2019-12-07 12:07:59,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 12:07:59,532 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:07:59,532 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] [2019-12-07 12:07:59,532 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:07:59,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:07:59,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1372817948, now seen corresponding path program 1 times [2019-12-07 12:07:59,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:07:59,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292310601] [2019-12-07 12:07:59,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:07:59,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:07:59,673 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 12:07:59,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292310601] [2019-12-07 12:07:59,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:07:59,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 12:07:59,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166372111] [2019-12-07 12:07:59,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 12:07:59,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:07:59,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 12:07:59,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-07 12:07:59,674 INFO L87 Difference]: Start difference. First operand 9001 states and 19453 transitions. Second operand 12 states. [2019-12-07 12:08:00,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:08:00,560 INFO L93 Difference]: Finished difference Result 16341 states and 35211 transitions. [2019-12-07 12:08:00,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 12:08:00,560 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2019-12-07 12:08:00,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:08:00,567 INFO L225 Difference]: With dead ends: 16341 [2019-12-07 12:08:00,568 INFO L226 Difference]: Without dead ends: 10791 [2019-12-07 12:08:00,568 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2019-12-07 12:08:00,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10791 states. [2019-12-07 12:08:00,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10791 to 10625. [2019-12-07 12:08:00,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10625 states. [2019-12-07 12:08:00,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10625 states to 10625 states and 23072 transitions. [2019-12-07 12:08:00,661 INFO L78 Accepts]: Start accepts. Automaton has 10625 states and 23072 transitions. Word has length 43 [2019-12-07 12:08:00,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:08:00,661 INFO L462 AbstractCegarLoop]: Abstraction has 10625 states and 23072 transitions. [2019-12-07 12:08:00,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 12:08:00,661 INFO L276 IsEmpty]: Start isEmpty. Operand 10625 states and 23072 transitions. [2019-12-07 12:08:00,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 12:08:00,669 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:08:00,670 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] [2019-12-07 12:08:00,670 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:08:00,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:08:00,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1379610226, now seen corresponding path program 1 times [2019-12-07 12:08:00,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:08:00,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236786149] [2019-12-07 12:08:00,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:08:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:08:00,704 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 12:08:00,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236786149] [2019-12-07 12:08:00,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:08:00,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:08:00,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529110289] [2019-12-07 12:08:00,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:08:00,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:08:00,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:08:00,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:08:00,705 INFO L87 Difference]: Start difference. First operand 10625 states and 23072 transitions. Second operand 4 states. [2019-12-07 12:08:00,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:08:00,728 INFO L93 Difference]: Finished difference Result 7738 states and 16839 transitions. [2019-12-07 12:08:00,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:08:00,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-12-07 12:08:00,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:08:00,735 INFO L225 Difference]: With dead ends: 7738 [2019-12-07 12:08:00,735 INFO L226 Difference]: Without dead ends: 7432 [2019-12-07 12:08:00,736 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 12:08:00,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7432 states. [2019-12-07 12:08:00,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7432 to 6292. [2019-12-07 12:08:00,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6292 states. [2019-12-07 12:08:00,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6292 states to 6292 states and 13989 transitions. [2019-12-07 12:08:00,821 INFO L78 Accepts]: Start accepts. Automaton has 6292 states and 13989 transitions. Word has length 44 [2019-12-07 12:08:00,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:08:00,821 INFO L462 AbstractCegarLoop]: Abstraction has 6292 states and 13989 transitions. [2019-12-07 12:08:00,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:08:00,821 INFO L276 IsEmpty]: Start isEmpty. Operand 6292 states and 13989 transitions. [2019-12-07 12:08:00,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 12:08:00,828 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:08:00,828 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:08:00,829 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:08:00,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:08:00,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1381346118, now seen corresponding path program 1 times [2019-12-07 12:08:00,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:08:00,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002550537] [2019-12-07 12:08:00,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:08:00,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:08:00,878 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 12:08:00,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002550537] [2019-12-07 12:08:00,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:08:00,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:08:00,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790367759] [2019-12-07 12:08:00,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:08:00,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:08:00,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:08:00,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:08:00,880 INFO L87 Difference]: Start difference. First operand 6292 states and 13989 transitions. Second operand 5 states. [2019-12-07 12:08:01,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:08:01,138 INFO L93 Difference]: Finished difference Result 7131 states and 15624 transitions. [2019-12-07 12:08:01,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:08:01,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-07 12:08:01,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:08:01,143 INFO L225 Difference]: With dead ends: 7131 [2019-12-07 12:08:01,143 INFO L226 Difference]: Without dead ends: 7131 [2019-12-07 12:08:01,143 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:08:01,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7131 states. [2019-12-07 12:08:01,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7131 to 6751. [2019-12-07 12:08:01,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6751 states. [2019-12-07 12:08:01,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6751 states to 6751 states and 14925 transitions. [2019-12-07 12:08:01,203 INFO L78 Accepts]: Start accepts. Automaton has 6751 states and 14925 transitions. Word has length 69 [2019-12-07 12:08:01,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:08:01,203 INFO L462 AbstractCegarLoop]: Abstraction has 6751 states and 14925 transitions. [2019-12-07 12:08:01,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:08:01,203 INFO L276 IsEmpty]: Start isEmpty. Operand 6751 states and 14925 transitions. [2019-12-07 12:08:01,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 12:08:01,210 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:08:01,210 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:08:01,210 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:08:01,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:08:01,211 INFO L82 PathProgramCache]: Analyzing trace with hash -148584674, now seen corresponding path program 2 times [2019-12-07 12:08:01,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:08:01,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998146707] [2019-12-07 12:08:01,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:08:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:08:01,298 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 12:08:01,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998146707] [2019-12-07 12:08:01,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:08:01,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 12:08:01,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089164650] [2019-12-07 12:08:01,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 12:08:01,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:08:01,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 12:08:01,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:08:01,300 INFO L87 Difference]: Start difference. First operand 6751 states and 14925 transitions. Second operand 8 states. [2019-12-07 12:08:01,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:08:01,622 INFO L93 Difference]: Finished difference Result 12079 states and 26414 transitions. [2019-12-07 12:08:01,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 12:08:01,622 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2019-12-07 12:08:01,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:08:01,629 INFO L225 Difference]: With dead ends: 12079 [2019-12-07 12:08:01,630 INFO L226 Difference]: Without dead ends: 11047 [2019-12-07 12:08:01,630 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2019-12-07 12:08:01,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11047 states. [2019-12-07 12:08:01,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11047 to 8155. [2019-12-07 12:08:01,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8155 states. [2019-12-07 12:08:01,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8155 states to 8155 states and 18243 transitions. [2019-12-07 12:08:01,724 INFO L78 Accepts]: Start accepts. Automaton has 8155 states and 18243 transitions. Word has length 69 [2019-12-07 12:08:01,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:08:01,724 INFO L462 AbstractCegarLoop]: Abstraction has 8155 states and 18243 transitions. [2019-12-07 12:08:01,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 12:08:01,724 INFO L276 IsEmpty]: Start isEmpty. Operand 8155 states and 18243 transitions. [2019-12-07 12:08:01,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 12:08:01,731 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:08:01,731 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:08:01,731 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:08:01,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:08:01,731 INFO L82 PathProgramCache]: Analyzing trace with hash -454024360, now seen corresponding path program 3 times [2019-12-07 12:08:01,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:08:01,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671928791] [2019-12-07 12:08:01,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:08:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:08:01,779 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 12:08:01,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671928791] [2019-12-07 12:08:01,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:08:01,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:08:01,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215620305] [2019-12-07 12:08:01,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:08:01,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:08:01,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:08:01,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:08:01,781 INFO L87 Difference]: Start difference. First operand 8155 states and 18243 transitions. Second operand 4 states. [2019-12-07 12:08:01,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:08:01,910 INFO L93 Difference]: Finished difference Result 7567 states and 16598 transitions. [2019-12-07 12:08:01,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:08:01,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-07 12:08:01,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:08:01,915 INFO L225 Difference]: With dead ends: 7567 [2019-12-07 12:08:01,915 INFO L226 Difference]: Without dead ends: 7567 [2019-12-07 12:08:01,916 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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 12:08:01,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7567 states. [2019-12-07 12:08:01,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7567 to 7318. [2019-12-07 12:08:01,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7318 states. [2019-12-07 12:08:01,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7318 states to 7318 states and 16076 transitions. [2019-12-07 12:08:01,983 INFO L78 Accepts]: Start accepts. Automaton has 7318 states and 16076 transitions. Word has length 69 [2019-12-07 12:08:01,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:08:01,983 INFO L462 AbstractCegarLoop]: Abstraction has 7318 states and 16076 transitions. [2019-12-07 12:08:01,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:08:01,983 INFO L276 IsEmpty]: Start isEmpty. Operand 7318 states and 16076 transitions. [2019-12-07 12:08:01,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 12:08:01,988 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:08:01,988 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:08:01,988 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:08:01,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:08:01,989 INFO L82 PathProgramCache]: Analyzing trace with hash 368047272, now seen corresponding path program 4 times [2019-12-07 12:08:01,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:08:01,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065698485] [2019-12-07 12:08:01,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:08:01,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:08:02,037 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 12:08:02,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065698485] [2019-12-07 12:08:02,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:08:02,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:08:02,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467655969] [2019-12-07 12:08:02,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:08:02,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:08:02,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:08:02,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:08:02,038 INFO L87 Difference]: Start difference. First operand 7318 states and 16076 transitions. Second operand 4 states. [2019-12-07 12:08:02,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:08:02,115 INFO L93 Difference]: Finished difference Result 8902 states and 19427 transitions. [2019-12-07 12:08:02,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:08:02,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-07 12:08:02,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:08:02,121 INFO L225 Difference]: With dead ends: 8902 [2019-12-07 12:08:02,121 INFO L226 Difference]: Without dead ends: 8902 [2019-12-07 12:08:02,122 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 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 12:08:02,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8902 states. [2019-12-07 12:08:02,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8902 to 7763. [2019-12-07 12:08:02,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7763 states. [2019-12-07 12:08:02,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7763 states to 7763 states and 17103 transitions. [2019-12-07 12:08:02,203 INFO L78 Accepts]: Start accepts. Automaton has 7763 states and 17103 transitions. Word has length 69 [2019-12-07 12:08:02,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:08:02,204 INFO L462 AbstractCegarLoop]: Abstraction has 7763 states and 17103 transitions. [2019-12-07 12:08:02,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:08:02,204 INFO L276 IsEmpty]: Start isEmpty. Operand 7763 states and 17103 transitions. [2019-12-07 12:08:02,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 12:08:02,209 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:08:02,209 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:08:02,209 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:08:02,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:08:02,210 INFO L82 PathProgramCache]: Analyzing trace with hash 22890042, now seen corresponding path program 1 times [2019-12-07 12:08:02,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:08:02,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766636256] [2019-12-07 12:08:02,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:08:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:08:02,288 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 12:08:02,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766636256] [2019-12-07 12:08:02,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:08:02,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:08:02,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897879581] [2019-12-07 12:08:02,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:08:02,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:08:02,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:08:02,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:08:02,290 INFO L87 Difference]: Start difference. First operand 7763 states and 17103 transitions. Second operand 7 states. [2019-12-07 12:08:02,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:08:02,426 INFO L93 Difference]: Finished difference Result 12843 states and 28129 transitions. [2019-12-07 12:08:02,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 12:08:02,427 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-12-07 12:08:02,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:08:02,434 INFO L225 Difference]: With dead ends: 12843 [2019-12-07 12:08:02,434 INFO L226 Difference]: Without dead ends: 10934 [2019-12-07 12:08:02,434 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-12-07 12:08:02,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10934 states. [2019-12-07 12:08:02,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10934 to 9410. [2019-12-07 12:08:02,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9410 states. [2019-12-07 12:08:02,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9410 states to 9410 states and 20780 transitions. [2019-12-07 12:08:02,530 INFO L78 Accepts]: Start accepts. Automaton has 9410 states and 20780 transitions. Word has length 70 [2019-12-07 12:08:02,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:08:02,530 INFO L462 AbstractCegarLoop]: Abstraction has 9410 states and 20780 transitions. [2019-12-07 12:08:02,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:08:02,530 INFO L276 IsEmpty]: Start isEmpty. Operand 9410 states and 20780 transitions. [2019-12-07 12:08:02,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 12:08:02,537 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:08:02,537 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:08:02,537 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:08:02,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:08:02,537 INFO L82 PathProgramCache]: Analyzing trace with hash -955306990, now seen corresponding path program 2 times [2019-12-07 12:08:02,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:08:02,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226432255] [2019-12-07 12:08:02,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:08:02,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:08:02,599 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 12:08:02,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226432255] [2019-12-07 12:08:02,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:08:02,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:08:02,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907204262] [2019-12-07 12:08:02,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:08:02,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:08:02,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:08:02,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:08:02,601 INFO L87 Difference]: Start difference. First operand 9410 states and 20780 transitions. Second operand 4 states. [2019-12-07 12:08:02,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:08:02,644 INFO L93 Difference]: Finished difference Result 10438 states and 22929 transitions. [2019-12-07 12:08:02,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:08:02,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-12-07 12:08:02,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:08:02,649 INFO L225 Difference]: With dead ends: 10438 [2019-12-07 12:08:02,649 INFO L226 Difference]: Without dead ends: 6527 [2019-12-07 12:08:02,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 12:08:02,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6527 states. [2019-12-07 12:08:02,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6527 to 5693. [2019-12-07 12:08:02,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5693 states. [2019-12-07 12:08:02,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5693 states to 5693 states and 12285 transitions. [2019-12-07 12:08:02,705 INFO L78 Accepts]: Start accepts. Automaton has 5693 states and 12285 transitions. Word has length 70 [2019-12-07 12:08:02,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:08:02,705 INFO L462 AbstractCegarLoop]: Abstraction has 5693 states and 12285 transitions. [2019-12-07 12:08:02,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:08:02,706 INFO L276 IsEmpty]: Start isEmpty. Operand 5693 states and 12285 transitions. [2019-12-07 12:08:02,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 12:08:02,709 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:08:02,710 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:08:02,710 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:08:02,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:08:02,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1426698558, now seen corresponding path program 1 times [2019-12-07 12:08:02,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:08:02,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770076465] [2019-12-07 12:08:02,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:08:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:08:02,766 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 12:08:02,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770076465] [2019-12-07 12:08:02,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:08:02,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 12:08:02,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57123969] [2019-12-07 12:08:02,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 12:08:02,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:08:02,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 12:08:02,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:08:02,768 INFO L87 Difference]: Start difference. First operand 5693 states and 12285 transitions. Second operand 8 states. [2019-12-07 12:08:03,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:08:03,013 INFO L93 Difference]: Finished difference Result 8838 states and 18735 transitions. [2019-12-07 12:08:03,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 12:08:03,013 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 71 [2019-12-07 12:08:03,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:08:03,019 INFO L225 Difference]: With dead ends: 8838 [2019-12-07 12:08:03,019 INFO L226 Difference]: Without dead ends: 8232 [2019-12-07 12:08:03,019 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-07 12:08:03,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8232 states. [2019-12-07 12:08:03,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8232 to 5705. [2019-12-07 12:08:03,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5705 states. [2019-12-07 12:08:03,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5705 states to 5705 states and 12303 transitions. [2019-12-07 12:08:03,078 INFO L78 Accepts]: Start accepts. Automaton has 5705 states and 12303 transitions. Word has length 71 [2019-12-07 12:08:03,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:08:03,079 INFO L462 AbstractCegarLoop]: Abstraction has 5705 states and 12303 transitions. [2019-12-07 12:08:03,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 12:08:03,079 INFO L276 IsEmpty]: Start isEmpty. Operand 5705 states and 12303 transitions. [2019-12-07 12:08:03,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 12:08:03,082 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:08:03,082 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:08:03,082 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:08:03,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:08:03,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1762924738, now seen corresponding path program 2 times [2019-12-07 12:08:03,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:08:03,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499704412] [2019-12-07 12:08:03,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:08:03,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:08:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:08:03,157 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 12:08:03,157 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:08:03,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1067] [1067] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_76| 0 0))) (and (= 0 v_~__unbuffered_p1_EBX~0_103) (= v_~y$r_buff1_thd0~0_223 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~main$tmp_guard0~0_19 0) (= v_~y$w_buff0_used~0_997 0) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EAX~0_104 0) (= v_~y$read_delayed~0_4 0) (= 0 v_~y$r_buff1_thd2~0_319) (= |v_#valid_74| (store .cse0 |v_ULTIMATE.start_main_~#t6~0.base_51| 1)) (= v_~y$r_buff0_thd0~0_188 0) (= v_~main$tmp_guard1~0_72 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t6~0.base_51|) (= v_~y$r_buff1_thd1~0_376 0) (= v_~y$w_buff1~0_221 0) (< 0 |v_#StackHeapBarrier_15|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t6~0.base_51| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t6~0.base_51|) |v_ULTIMATE.start_main_~#t6~0.offset_32| 0)) |v_#memory_int_17|) (= 0 |v_#NULL.base_6|) (= v_~y~0_343 0) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd1~0_597 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t6~0.base_51|) 0) (= v_~y$w_buff1_used~0_499 0) (= 0 v_~__unbuffered_cnt~0_73) (= v_~__unbuffered_p0_EBX~0_80 0) (= 0 v_~y$r_buff0_thd2~0_403) (= |v_ULTIMATE.start_main_~#t6~0.offset_32| 0) (= 0 v_~__unbuffered_p0_EAX~0_104) (= v_~y$flush_delayed~0_191 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t6~0.base_51| 4)) (= v_~weak$$choice2~0_254 0) (= v_~x~0_54 0) (= v_~y$mem_tmp~0_169 0) (= 0 v_~weak$$choice0~0_159) (= 0 v_~y$w_buff0~0_236))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_997, ULTIMATE.start_main_~#t7~0.offset=|v_ULTIMATE.start_main_~#t7~0.offset_18|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_143|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_72, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_39|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_39|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_43|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_405|, ULTIMATE.start_main_~#t7~0.base=|v_ULTIMATE.start_main_~#t7~0.base_23|, ~y$read_delayed~0=v_~y$read_delayed~0_4, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_376, ULTIMATE.start_main_~#t6~0.offset=|v_ULTIMATE.start_main_~#t6~0.offset_32|, ~y$mem_tmp~0=v_~y$mem_tmp~0_169, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_104, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_104, ~y$w_buff0~0=v_~y$w_buff0~0_236, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_597, ~y$flush_delayed~0=v_~y$flush_delayed~0_191, #length=|v_#length_17|, ~y~0=v_~y~0_343, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_19|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_103, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_80, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_9|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_319, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_31|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~y$w_buff1~0=v_~y$w_buff1~0_221, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_188, #valid=|v_#valid_74|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_403, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73, ULTIMATE.start_main_~#t6~0.base=|v_ULTIMATE.start_main_~#t6~0.base_51|, ~weak$$choice2~0=v_~weak$$choice2~0_254, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_223, ~x~0=v_~x~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_499} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t7~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite68, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_~#t7~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t6~0.offset, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_#t~nondet62, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet61, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t6~0.base, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:08:03,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1040] [1040] L818-1-->L820: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t7~0.offset_10|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t7~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t7~0.base_11|)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t7~0.base_11|)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t7~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t7~0.base_11|) |v_ULTIMATE.start_main_~#t7~0.offset_10| 1)) |v_#memory_int_9|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t7~0.base_11| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t7~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t7~0.base=|v_ULTIMATE.start_main_~#t7~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t7~0.offset=|v_ULTIMATE.start_main_~#t7~0.offset_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t7~0.base, ULTIMATE.start_main_~#t7~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-07 12:08:03,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L5-->L744: Formula: (and (= ~y$r_buff0_thd1~0_In522402098 ~y$r_buff1_thd1~0_Out522402098) (= ~y$r_buff0_thd1~0_Out522402098 1) (= ~weak$$choice0~0_Out522402098 |P0Thread1of1ForFork1_#t~nondet3_In522402098|) (= ~y$r_buff1_thd0~0_Out522402098 ~y$r_buff0_thd0~0_In522402098) (= ~y$mem_tmp~0_Out522402098 ~y~0_In522402098) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In522402098 0)) (= |P0Thread1of1ForFork1_#t~nondet4_In522402098| ~weak$$choice2~0_Out522402098) (= ~y$flush_delayed~0_Out522402098 ~weak$$choice2~0_Out522402098) (= ~y$r_buff1_thd2~0_Out522402098 ~y$r_buff0_thd2~0_In522402098)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In522402098, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In522402098, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In522402098, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In522402098, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_In522402098|, ~y~0=~y~0_In522402098, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_In522402098|} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out522402098, ~weak$$choice0~0=~weak$$choice0~0_Out522402098, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out522402098, ~y$mem_tmp~0=~y$mem_tmp~0_Out522402098, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In522402098, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out522402098, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In522402098, ~y$flush_delayed~0=~y$flush_delayed~0_Out522402098, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In522402098, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_Out522402098|, ~y~0=~y~0_In522402098, ~weak$$choice2~0=~weak$$choice2~0_Out522402098, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_Out522402098|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out522402098} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 12:08:03,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L744-2-->L744-5: Formula: (let ((.cse1 (= |P0Thread1of1ForFork1_#t~ite6_Out684688155| |P0Thread1of1ForFork1_#t~ite5_Out684688155|)) (.cse0 (= (mod ~y$w_buff0_used~0_In684688155 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In684688155 256) 0))) (or (and (not .cse0) (= ~y$w_buff0~0_In684688155 |P0Thread1of1ForFork1_#t~ite5_Out684688155|) .cse1 (not .cse2)) (and (= ~y$w_buff1~0_In684688155 |P0Thread1of1ForFork1_#t~ite5_Out684688155|) .cse1 (or .cse0 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In684688155, ~y$w_buff1~0=~y$w_buff1~0_In684688155, ~y$w_buff0~0=~y$w_buff0~0_In684688155, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In684688155} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out684688155|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In684688155, ~y$w_buff1~0=~y$w_buff1~0_In684688155, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out684688155|, ~y$w_buff0~0=~y$w_buff0~0_In684688155, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In684688155} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5, P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 12:08:03,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L749-->L750: Formula: (and (not (= (mod v_~weak$$choice2~0_55 256) 0)) (= v_~y$r_buff0_thd1~0_87 v_~y$r_buff0_thd1~0_86)) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_87, ~weak$$choice2~0=v_~weak$$choice2~0_55} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_9|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_9|, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_6|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_86, ~weak$$choice2~0=v_~weak$$choice2~0_55} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, P0Thread1of1ForFork1_#t~ite19, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 12:08:03,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-890607910 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite25_Out-890607910| ~y$mem_tmp~0_In-890607910) (not .cse0)) (and (= |P0Thread1of1ForFork1_#t~ite25_Out-890607910| ~y~0_In-890607910) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-890607910, ~y$flush_delayed~0=~y$flush_delayed~0_In-890607910, ~y~0=~y~0_In-890607910} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-890607910, P0Thread1of1ForFork1_#t~ite25=|P0Thread1of1ForFork1_#t~ite25_Out-890607910|, ~y$flush_delayed~0=~y$flush_delayed~0_In-890607910, ~y~0=~y~0_In-890607910} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 12:08:03,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-2005367451 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork0_#t~ite54_Out-2005367451| ~y~0_In-2005367451)) (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite54_Out-2005367451| ~y$mem_tmp~0_In-2005367451)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-2005367451, ~y$flush_delayed~0=~y$flush_delayed~0_In-2005367451, ~y~0=~y~0_In-2005367451} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-2005367451, P1Thread1of1ForFork0_#t~ite54=|P1Thread1of1ForFork0_#t~ite54_Out-2005367451|, ~y$flush_delayed~0=~y$flush_delayed~0_In-2005367451, ~y~0=~y~0_In-2005367451} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 12:08:03,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L760-->L760-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-669048726 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-669048726 256) 0))) (or (and (= ~y$w_buff0_used~0_In-669048726 |P0Thread1of1ForFork1_#t~ite28_Out-669048726|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite28_Out-669048726|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-669048726, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-669048726} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-669048726, P0Thread1of1ForFork1_#t~ite28=|P0Thread1of1ForFork1_#t~ite28_Out-669048726|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-669048726} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 12:08:03,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L761-->L761-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In117858509 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In117858509 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In117858509 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In117858509 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite29_Out117858509|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In117858509 |P0Thread1of1ForFork1_#t~ite29_Out117858509|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In117858509, ~y$w_buff0_used~0=~y$w_buff0_used~0_In117858509, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In117858509, ~y$w_buff1_used~0=~y$w_buff1_used~0_In117858509} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In117858509, ~y$w_buff0_used~0=~y$w_buff0_used~0_In117858509, P0Thread1of1ForFork1_#t~ite29=|P0Thread1of1ForFork1_#t~ite29_Out117858509|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In117858509, ~y$w_buff1_used~0=~y$w_buff1_used~0_In117858509} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 12:08:03,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] L762-->L763: Formula: (let ((.cse0 (= ~y$r_buff0_thd1~0_Out921335638 ~y$r_buff0_thd1~0_In921335638)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In921335638 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In921335638 256) 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (not .cse1) (= ~y$r_buff0_thd1~0_Out921335638 0) (not .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In921335638, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In921335638} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In921335638, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out921335638, P0Thread1of1ForFork1_#t~ite30=|P0Thread1of1ForFork1_#t~ite30_Out921335638|} AuxVars[] AssignedVars[~y$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 12:08:03,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L763-->L763-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In1742219168 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1742219168 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In1742219168 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1742219168 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite31_Out1742219168| 0)) (and (or .cse0 .cse1) (= ~y$r_buff1_thd1~0_In1742219168 |P0Thread1of1ForFork1_#t~ite31_Out1742219168|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1742219168, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1742219168, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1742219168, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1742219168} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1742219168, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1742219168, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1742219168, P0Thread1of1ForFork1_#t~ite31=|P0Thread1of1ForFork1_#t~ite31_Out1742219168|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1742219168} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 12:08:03,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L763-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= v_~y$r_buff1_thd1~0_198 |v_P0Thread1of1ForFork1_#t~ite31_34|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_34|} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_198, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_33|} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 12:08:03,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L795-2-->L795-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1053053363 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1053053363 256)))) (or (and (= ~y$w_buff1~0_In-1053053363 |P1Thread1of1ForFork0_#t~ite55_Out-1053053363|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y~0_In-1053053363 |P1Thread1of1ForFork0_#t~ite55_Out-1053053363|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1053053363, ~y$w_buff1~0=~y$w_buff1~0_In-1053053363, ~y~0=~y~0_In-1053053363, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1053053363} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1053053363, ~y$w_buff1~0=~y$w_buff1~0_In-1053053363, P1Thread1of1ForFork0_#t~ite55=|P1Thread1of1ForFork0_#t~ite55_Out-1053053363|, ~y~0=~y~0_In-1053053363, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1053053363} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite55] because there is no mapped edge [2019-12-07 12:08:03,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L795-4-->L796: Formula: (= v_~y~0_76 |v_P1Thread1of1ForFork0_#t~ite55_8|) InVars {P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_8|} OutVars{P1Thread1of1ForFork0_#t~ite56=|v_P1Thread1of1ForFork0_#t~ite56_11|, P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_7|, ~y~0=v_~y~0_76} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite56, P1Thread1of1ForFork0_#t~ite55, ~y~0] because there is no mapped edge [2019-12-07 12:08:03,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-476947784 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-476947784 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite57_Out-476947784|)) (and (= ~y$w_buff0_used~0_In-476947784 |P1Thread1of1ForFork0_#t~ite57_Out-476947784|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-476947784, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-476947784} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-476947784, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-476947784, P1Thread1of1ForFork0_#t~ite57=|P1Thread1of1ForFork0_#t~ite57_Out-476947784|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite57] because there is no mapped edge [2019-12-07 12:08:03,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1011] [1011] L797-->L797-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In861123618 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In861123618 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In861123618 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In861123618 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite58_Out861123618| ~y$w_buff1_used~0_In861123618) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork0_#t~ite58_Out861123618| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In861123618, ~y$w_buff0_used~0=~y$w_buff0_used~0_In861123618, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In861123618, ~y$w_buff1_used~0=~y$w_buff1_used~0_In861123618} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In861123618, ~y$w_buff0_used~0=~y$w_buff0_used~0_In861123618, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In861123618, P1Thread1of1ForFork0_#t~ite58=|P1Thread1of1ForFork0_#t~ite58_Out861123618|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In861123618} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite58] because there is no mapped edge [2019-12-07 12:08:03,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1065961402 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1065961402 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite59_Out1065961402| 0) (not .cse1)) (and (= ~y$r_buff0_thd2~0_In1065961402 |P1Thread1of1ForFork0_#t~ite59_Out1065961402|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1065961402, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1065961402} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1065961402, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1065961402, P1Thread1of1ForFork0_#t~ite59=|P1Thread1of1ForFork0_#t~ite59_Out1065961402|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite59] because there is no mapped edge [2019-12-07 12:08:03,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L799-->L799-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1539839021 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1539839021 256))) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-1539839021 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-1539839021 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite60_Out-1539839021| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite60_Out-1539839021| ~y$r_buff1_thd2~0_In-1539839021) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1539839021, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1539839021, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1539839021, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1539839021} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1539839021, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1539839021, P1Thread1of1ForFork0_#t~ite60=|P1Thread1of1ForFork0_#t~ite60_Out-1539839021|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1539839021, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1539839021} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite60] because there is no mapped edge [2019-12-07 12:08:03,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1042] [1042] L799-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~y$r_buff1_thd2~0_192 |v_P1Thread1of1ForFork0_#t~ite60_34|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_192, P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite60, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 12:08:03,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L820-1-->L826: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet62, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 12:08:03,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L826-2-->L826-5: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-71522923 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite64_Out-71522923| |ULTIMATE.start_main_#t~ite63_Out-71522923|)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-71522923 256) 0))) (or (and (or .cse0 .cse1) (= ~y~0_In-71522923 |ULTIMATE.start_main_#t~ite63_Out-71522923|) .cse2) (and (= ~y$w_buff1~0_In-71522923 |ULTIMATE.start_main_#t~ite63_Out-71522923|) (not .cse0) .cse2 (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-71522923, ~y~0=~y~0_In-71522923, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-71522923, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-71522923} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-71522923|, ~y$w_buff1~0=~y$w_buff1~0_In-71522923, ~y~0=~y~0_In-71522923, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-71522923, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-71522923|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-71522923} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 12:08:03,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1017] [1017] L827-->L827-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-26599546 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-26599546 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite65_Out-26599546| ~y$w_buff0_used~0_In-26599546)) (and (= |ULTIMATE.start_main_#t~ite65_Out-26599546| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-26599546, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-26599546} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-26599546, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-26599546, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out-26599546|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-07 12:08:03,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L828-->L828-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In752815684 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In752815684 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In752815684 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In752815684 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite66_Out752815684| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite66_Out752815684| ~y$w_buff1_used~0_In752815684) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In752815684, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In752815684, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In752815684, ~y$w_buff1_used~0=~y$w_buff1_used~0_In752815684} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In752815684, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In752815684, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out752815684|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In752815684, ~y$w_buff1_used~0=~y$w_buff1_used~0_In752815684} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-07 12:08:03,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1700127116 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1700127116 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite67_Out-1700127116| ~y$r_buff0_thd0~0_In-1700127116) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite67_Out-1700127116| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1700127116, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1700127116} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1700127116, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1700127116, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out-1700127116|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-07 12:08:03,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L830-->L830-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1865798860 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1865798860 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In1865798860 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1865798860 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite68_Out1865798860|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd0~0_In1865798860 |ULTIMATE.start_main_#t~ite68_Out1865798860|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1865798860, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1865798860, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1865798860, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1865798860} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1865798860, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1865798860, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out1865798860|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1865798860, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1865798860} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-07 12:08:03,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1060] [1060] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_40 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~main$tmp_guard1~0_40 (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p0_EAX~0_62) (= v_~__unbuffered_p0_EBX~0_46 0) (= 1 v_~__unbuffered_p1_EAX~0_72) (= v_~__unbuffered_p1_EBX~0_61 0))) 1 0)) 0 1)) (= v_~y$r_buff1_thd0~0_188 |v_ULTIMATE.start_main_#t~ite68_82|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_46, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_61, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_72, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_82|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_46, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_61, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_72, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_81|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_188, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite68, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:08:03,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:08:03 BasicIcfg [2019-12-07 12:08:03,232 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:08:03,232 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:08:03,232 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:08:03,232 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:08:03,233 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:07:35" (3/4) ... [2019-12-07 12:08:03,234 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 12:08:03,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1067] [1067] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_76| 0 0))) (and (= 0 v_~__unbuffered_p1_EBX~0_103) (= v_~y$r_buff1_thd0~0_223 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~main$tmp_guard0~0_19 0) (= v_~y$w_buff0_used~0_997 0) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EAX~0_104 0) (= v_~y$read_delayed~0_4 0) (= 0 v_~y$r_buff1_thd2~0_319) (= |v_#valid_74| (store .cse0 |v_ULTIMATE.start_main_~#t6~0.base_51| 1)) (= v_~y$r_buff0_thd0~0_188 0) (= v_~main$tmp_guard1~0_72 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t6~0.base_51|) (= v_~y$r_buff1_thd1~0_376 0) (= v_~y$w_buff1~0_221 0) (< 0 |v_#StackHeapBarrier_15|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t6~0.base_51| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t6~0.base_51|) |v_ULTIMATE.start_main_~#t6~0.offset_32| 0)) |v_#memory_int_17|) (= 0 |v_#NULL.base_6|) (= v_~y~0_343 0) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd1~0_597 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t6~0.base_51|) 0) (= v_~y$w_buff1_used~0_499 0) (= 0 v_~__unbuffered_cnt~0_73) (= v_~__unbuffered_p0_EBX~0_80 0) (= 0 v_~y$r_buff0_thd2~0_403) (= |v_ULTIMATE.start_main_~#t6~0.offset_32| 0) (= 0 v_~__unbuffered_p0_EAX~0_104) (= v_~y$flush_delayed~0_191 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t6~0.base_51| 4)) (= v_~weak$$choice2~0_254 0) (= v_~x~0_54 0) (= v_~y$mem_tmp~0_169 0) (= 0 v_~weak$$choice0~0_159) (= 0 v_~y$w_buff0~0_236))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_997, ULTIMATE.start_main_~#t7~0.offset=|v_ULTIMATE.start_main_~#t7~0.offset_18|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_143|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_72, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_39|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_39|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_43|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_405|, ULTIMATE.start_main_~#t7~0.base=|v_ULTIMATE.start_main_~#t7~0.base_23|, ~y$read_delayed~0=v_~y$read_delayed~0_4, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_376, ULTIMATE.start_main_~#t6~0.offset=|v_ULTIMATE.start_main_~#t6~0.offset_32|, ~y$mem_tmp~0=v_~y$mem_tmp~0_169, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_104, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_104, ~y$w_buff0~0=v_~y$w_buff0~0_236, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_597, ~y$flush_delayed~0=v_~y$flush_delayed~0_191, #length=|v_#length_17|, ~y~0=v_~y~0_343, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_19|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_103, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_80, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_9|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_319, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_31|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~y$w_buff1~0=v_~y$w_buff1~0_221, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_188, #valid=|v_#valid_74|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_403, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73, ULTIMATE.start_main_~#t6~0.base=|v_ULTIMATE.start_main_~#t6~0.base_51|, ~weak$$choice2~0=v_~weak$$choice2~0_254, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_223, ~x~0=v_~x~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_499} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t7~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite68, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_~#t7~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t6~0.offset, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_#t~nondet62, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet61, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t6~0.base, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:08:03,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1040] [1040] L818-1-->L820: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t7~0.offset_10|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t7~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t7~0.base_11|)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t7~0.base_11|)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t7~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t7~0.base_11|) |v_ULTIMATE.start_main_~#t7~0.offset_10| 1)) |v_#memory_int_9|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t7~0.base_11| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t7~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t7~0.base=|v_ULTIMATE.start_main_~#t7~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t7~0.offset=|v_ULTIMATE.start_main_~#t7~0.offset_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t7~0.base, ULTIMATE.start_main_~#t7~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-07 12:08:03,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L5-->L744: Formula: (and (= ~y$r_buff0_thd1~0_In522402098 ~y$r_buff1_thd1~0_Out522402098) (= ~y$r_buff0_thd1~0_Out522402098 1) (= ~weak$$choice0~0_Out522402098 |P0Thread1of1ForFork1_#t~nondet3_In522402098|) (= ~y$r_buff1_thd0~0_Out522402098 ~y$r_buff0_thd0~0_In522402098) (= ~y$mem_tmp~0_Out522402098 ~y~0_In522402098) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In522402098 0)) (= |P0Thread1of1ForFork1_#t~nondet4_In522402098| ~weak$$choice2~0_Out522402098) (= ~y$flush_delayed~0_Out522402098 ~weak$$choice2~0_Out522402098) (= ~y$r_buff1_thd2~0_Out522402098 ~y$r_buff0_thd2~0_In522402098)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In522402098, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In522402098, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In522402098, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In522402098, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_In522402098|, ~y~0=~y~0_In522402098, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_In522402098|} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out522402098, ~weak$$choice0~0=~weak$$choice0~0_Out522402098, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out522402098, ~y$mem_tmp~0=~y$mem_tmp~0_Out522402098, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In522402098, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out522402098, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In522402098, ~y$flush_delayed~0=~y$flush_delayed~0_Out522402098, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In522402098, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_Out522402098|, ~y~0=~y~0_In522402098, ~weak$$choice2~0=~weak$$choice2~0_Out522402098, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_Out522402098|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out522402098} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 12:08:03,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L744-2-->L744-5: Formula: (let ((.cse1 (= |P0Thread1of1ForFork1_#t~ite6_Out684688155| |P0Thread1of1ForFork1_#t~ite5_Out684688155|)) (.cse0 (= (mod ~y$w_buff0_used~0_In684688155 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In684688155 256) 0))) (or (and (not .cse0) (= ~y$w_buff0~0_In684688155 |P0Thread1of1ForFork1_#t~ite5_Out684688155|) .cse1 (not .cse2)) (and (= ~y$w_buff1~0_In684688155 |P0Thread1of1ForFork1_#t~ite5_Out684688155|) .cse1 (or .cse0 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In684688155, ~y$w_buff1~0=~y$w_buff1~0_In684688155, ~y$w_buff0~0=~y$w_buff0~0_In684688155, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In684688155} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out684688155|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In684688155, ~y$w_buff1~0=~y$w_buff1~0_In684688155, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out684688155|, ~y$w_buff0~0=~y$w_buff0~0_In684688155, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In684688155} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5, P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 12:08:03,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L749-->L750: Formula: (and (not (= (mod v_~weak$$choice2~0_55 256) 0)) (= v_~y$r_buff0_thd1~0_87 v_~y$r_buff0_thd1~0_86)) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_87, ~weak$$choice2~0=v_~weak$$choice2~0_55} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_9|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_9|, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_6|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_86, ~weak$$choice2~0=v_~weak$$choice2~0_55} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, P0Thread1of1ForFork1_#t~ite19, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 12:08:03,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-890607910 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite25_Out-890607910| ~y$mem_tmp~0_In-890607910) (not .cse0)) (and (= |P0Thread1of1ForFork1_#t~ite25_Out-890607910| ~y~0_In-890607910) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-890607910, ~y$flush_delayed~0=~y$flush_delayed~0_In-890607910, ~y~0=~y~0_In-890607910} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-890607910, P0Thread1of1ForFork1_#t~ite25=|P0Thread1of1ForFork1_#t~ite25_Out-890607910|, ~y$flush_delayed~0=~y$flush_delayed~0_In-890607910, ~y~0=~y~0_In-890607910} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 12:08:03,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-2005367451 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork0_#t~ite54_Out-2005367451| ~y~0_In-2005367451)) (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite54_Out-2005367451| ~y$mem_tmp~0_In-2005367451)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-2005367451, ~y$flush_delayed~0=~y$flush_delayed~0_In-2005367451, ~y~0=~y~0_In-2005367451} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-2005367451, P1Thread1of1ForFork0_#t~ite54=|P1Thread1of1ForFork0_#t~ite54_Out-2005367451|, ~y$flush_delayed~0=~y$flush_delayed~0_In-2005367451, ~y~0=~y~0_In-2005367451} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 12:08:03,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L760-->L760-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-669048726 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-669048726 256) 0))) (or (and (= ~y$w_buff0_used~0_In-669048726 |P0Thread1of1ForFork1_#t~ite28_Out-669048726|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite28_Out-669048726|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-669048726, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-669048726} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-669048726, P0Thread1of1ForFork1_#t~ite28=|P0Thread1of1ForFork1_#t~ite28_Out-669048726|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-669048726} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 12:08:03,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L761-->L761-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In117858509 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In117858509 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In117858509 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In117858509 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite29_Out117858509|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In117858509 |P0Thread1of1ForFork1_#t~ite29_Out117858509|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In117858509, ~y$w_buff0_used~0=~y$w_buff0_used~0_In117858509, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In117858509, ~y$w_buff1_used~0=~y$w_buff1_used~0_In117858509} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In117858509, ~y$w_buff0_used~0=~y$w_buff0_used~0_In117858509, P0Thread1of1ForFork1_#t~ite29=|P0Thread1of1ForFork1_#t~ite29_Out117858509|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In117858509, ~y$w_buff1_used~0=~y$w_buff1_used~0_In117858509} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 12:08:03,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] L762-->L763: Formula: (let ((.cse0 (= ~y$r_buff0_thd1~0_Out921335638 ~y$r_buff0_thd1~0_In921335638)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In921335638 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In921335638 256) 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (not .cse1) (= ~y$r_buff0_thd1~0_Out921335638 0) (not .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In921335638, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In921335638} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In921335638, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out921335638, P0Thread1of1ForFork1_#t~ite30=|P0Thread1of1ForFork1_#t~ite30_Out921335638|} AuxVars[] AssignedVars[~y$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 12:08:03,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L763-->L763-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In1742219168 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1742219168 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In1742219168 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1742219168 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite31_Out1742219168| 0)) (and (or .cse0 .cse1) (= ~y$r_buff1_thd1~0_In1742219168 |P0Thread1of1ForFork1_#t~ite31_Out1742219168|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1742219168, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1742219168, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1742219168, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1742219168} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1742219168, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1742219168, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1742219168, P0Thread1of1ForFork1_#t~ite31=|P0Thread1of1ForFork1_#t~ite31_Out1742219168|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1742219168} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 12:08:03,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L763-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= v_~y$r_buff1_thd1~0_198 |v_P0Thread1of1ForFork1_#t~ite31_34|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_34|} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_198, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_33|} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 12:08:03,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L795-2-->L795-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1053053363 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1053053363 256)))) (or (and (= ~y$w_buff1~0_In-1053053363 |P1Thread1of1ForFork0_#t~ite55_Out-1053053363|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y~0_In-1053053363 |P1Thread1of1ForFork0_#t~ite55_Out-1053053363|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1053053363, ~y$w_buff1~0=~y$w_buff1~0_In-1053053363, ~y~0=~y~0_In-1053053363, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1053053363} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1053053363, ~y$w_buff1~0=~y$w_buff1~0_In-1053053363, P1Thread1of1ForFork0_#t~ite55=|P1Thread1of1ForFork0_#t~ite55_Out-1053053363|, ~y~0=~y~0_In-1053053363, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1053053363} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite55] because there is no mapped edge [2019-12-07 12:08:03,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L795-4-->L796: Formula: (= v_~y~0_76 |v_P1Thread1of1ForFork0_#t~ite55_8|) InVars {P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_8|} OutVars{P1Thread1of1ForFork0_#t~ite56=|v_P1Thread1of1ForFork0_#t~ite56_11|, P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_7|, ~y~0=v_~y~0_76} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite56, P1Thread1of1ForFork0_#t~ite55, ~y~0] because there is no mapped edge [2019-12-07 12:08:03,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-476947784 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-476947784 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite57_Out-476947784|)) (and (= ~y$w_buff0_used~0_In-476947784 |P1Thread1of1ForFork0_#t~ite57_Out-476947784|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-476947784, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-476947784} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-476947784, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-476947784, P1Thread1of1ForFork0_#t~ite57=|P1Thread1of1ForFork0_#t~ite57_Out-476947784|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite57] because there is no mapped edge [2019-12-07 12:08:03,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1011] [1011] L797-->L797-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In861123618 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In861123618 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In861123618 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In861123618 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite58_Out861123618| ~y$w_buff1_used~0_In861123618) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork0_#t~ite58_Out861123618| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In861123618, ~y$w_buff0_used~0=~y$w_buff0_used~0_In861123618, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In861123618, ~y$w_buff1_used~0=~y$w_buff1_used~0_In861123618} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In861123618, ~y$w_buff0_used~0=~y$w_buff0_used~0_In861123618, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In861123618, P1Thread1of1ForFork0_#t~ite58=|P1Thread1of1ForFork0_#t~ite58_Out861123618|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In861123618} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite58] because there is no mapped edge [2019-12-07 12:08:03,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1065961402 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1065961402 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite59_Out1065961402| 0) (not .cse1)) (and (= ~y$r_buff0_thd2~0_In1065961402 |P1Thread1of1ForFork0_#t~ite59_Out1065961402|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1065961402, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1065961402} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1065961402, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1065961402, P1Thread1of1ForFork0_#t~ite59=|P1Thread1of1ForFork0_#t~ite59_Out1065961402|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite59] because there is no mapped edge [2019-12-07 12:08:03,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L799-->L799-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1539839021 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1539839021 256))) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-1539839021 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-1539839021 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite60_Out-1539839021| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite60_Out-1539839021| ~y$r_buff1_thd2~0_In-1539839021) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1539839021, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1539839021, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1539839021, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1539839021} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1539839021, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1539839021, P1Thread1of1ForFork0_#t~ite60=|P1Thread1of1ForFork0_#t~ite60_Out-1539839021|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1539839021, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1539839021} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite60] because there is no mapped edge [2019-12-07 12:08:03,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1042] [1042] L799-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~y$r_buff1_thd2~0_192 |v_P1Thread1of1ForFork0_#t~ite60_34|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_192, P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite60, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 12:08:03,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L820-1-->L826: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet62, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 12:08:03,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L826-2-->L826-5: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-71522923 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite64_Out-71522923| |ULTIMATE.start_main_#t~ite63_Out-71522923|)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-71522923 256) 0))) (or (and (or .cse0 .cse1) (= ~y~0_In-71522923 |ULTIMATE.start_main_#t~ite63_Out-71522923|) .cse2) (and (= ~y$w_buff1~0_In-71522923 |ULTIMATE.start_main_#t~ite63_Out-71522923|) (not .cse0) .cse2 (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-71522923, ~y~0=~y~0_In-71522923, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-71522923, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-71522923} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-71522923|, ~y$w_buff1~0=~y$w_buff1~0_In-71522923, ~y~0=~y~0_In-71522923, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-71522923, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-71522923|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-71522923} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 12:08:03,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1017] [1017] L827-->L827-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-26599546 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-26599546 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite65_Out-26599546| ~y$w_buff0_used~0_In-26599546)) (and (= |ULTIMATE.start_main_#t~ite65_Out-26599546| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-26599546, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-26599546} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-26599546, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-26599546, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out-26599546|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-07 12:08:03,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L828-->L828-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In752815684 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In752815684 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In752815684 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In752815684 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite66_Out752815684| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite66_Out752815684| ~y$w_buff1_used~0_In752815684) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In752815684, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In752815684, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In752815684, ~y$w_buff1_used~0=~y$w_buff1_used~0_In752815684} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In752815684, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In752815684, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out752815684|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In752815684, ~y$w_buff1_used~0=~y$w_buff1_used~0_In752815684} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-07 12:08:03,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1700127116 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1700127116 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite67_Out-1700127116| ~y$r_buff0_thd0~0_In-1700127116) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite67_Out-1700127116| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1700127116, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1700127116} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1700127116, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1700127116, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out-1700127116|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-07 12:08:03,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L830-->L830-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1865798860 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1865798860 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In1865798860 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1865798860 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite68_Out1865798860|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd0~0_In1865798860 |ULTIMATE.start_main_#t~ite68_Out1865798860|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1865798860, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1865798860, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1865798860, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1865798860} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1865798860, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1865798860, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out1865798860|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1865798860, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1865798860} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-07 12:08:03,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1060] [1060] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_40 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~main$tmp_guard1~0_40 (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p0_EAX~0_62) (= v_~__unbuffered_p0_EBX~0_46 0) (= 1 v_~__unbuffered_p1_EAX~0_72) (= v_~__unbuffered_p1_EBX~0_61 0))) 1 0)) 0 1)) (= v_~y$r_buff1_thd0~0_188 |v_ULTIMATE.start_main_#t~ite68_82|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_46, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_61, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_72, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_82|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_46, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_61, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_72, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_81|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_188, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite68, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:08:03,304 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f3fb16d0-5b8a-48e8-8e35-3ea4d2c65e6a/bin/utaipan/witness.graphml [2019-12-07 12:08:03,304 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:08:03,305 INFO L168 Benchmark]: Toolchain (without parser) took 28418.34 ms. Allocated memory was 1.0 GB in the beginning and 4.1 GB in the end (delta: 3.1 GB). Free memory was 934.5 MB in the beginning and 1.7 GB in the end (delta: -748.5 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2019-12-07 12:08:03,305 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:08:03,306 INFO L168 Benchmark]: CACSL2BoogieTranslator took 434.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 934.5 MB in the beginning and 1.1 GB in the end (delta: -142.5 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-12-07 12:08:03,306 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.24 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:08:03,306 INFO L168 Benchmark]: Boogie Preprocessor took 26.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:08:03,306 INFO L168 Benchmark]: RCFGBuilder took 447.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. [2019-12-07 12:08:03,307 INFO L168 Benchmark]: TraceAbstraction took 27388.23 ms. Allocated memory was 1.1 GB in the beginning and 4.1 GB in the end (delta: 3.0 GB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -721.9 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2019-12-07 12:08:03,307 INFO L168 Benchmark]: Witness Printer took 72.19 ms. Allocated memory is still 4.1 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. [2019-12-07 12:08:03,308 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 434.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 934.5 MB in the beginning and 1.1 GB in the end (delta: -142.5 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.24 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 447.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27388.23 ms. Allocated memory was 1.1 GB in the beginning and 4.1 GB in the end (delta: 3.0 GB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -721.9 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. * Witness Printer took 72.19 ms. Allocated memory is still 4.1 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 191 ProgramPointsBefore, 113 ProgramPointsAfterwards, 246 TransitionsBefore, 136 TransitionsAfterwards, 27428 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 54 ConcurrentYvCompositions, 35 ChoiceCompositions, 9684 VarBasedMoverChecksPositive, 320 VarBasedMoverChecksNegative, 35 SemBasedMoverChecksPositive, 419 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 146813 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t6, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L820] FCALL, FORK 0 pthread_create(&t7, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 y$w_buff1 = y$w_buff0 [L730] 1 y$w_buff0 = 1 [L731] 1 y$w_buff1_used = y$w_buff0_used [L732] 1 y$w_buff0_used = (_Bool)1 [L744] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L745] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L746] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L746] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L747] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L748] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L750] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 1 y = y$flush_delayed ? y$mem_tmp : y [L753] 1 y$flush_delayed = (_Bool)0 [L756] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 x = 1 [L776] 2 __unbuffered_p1_EAX = x [L779] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 2 y$flush_delayed = weak$$choice2 [L782] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L783] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L783] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L784] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L784] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L785] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L785] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L786] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L787] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L787] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L788] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L789] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L789] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L760] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L761] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L791] 2 y = y$flush_delayed ? y$mem_tmp : y [L792] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L797] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L798] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L826] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L829] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 185 locations, 2 error locations. Result: UNSAFE, OverallTime: 27.2s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5631 SDtfs, 5429 SDslu, 12155 SDs, 0 SdLazy, 4535 SolverSat, 217 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 41 SyntacticMatches, 11 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74579occurred 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: 13.5s AutomataMinimizationTime, 23 MinimizatonAttempts, 47560 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 946 NumberOfCodeBlocks, 946 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 852 ConstructedInterpolants, 0 QuantifiedInterpolants, 216054 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...