./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix003_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_5e18d660-d8a9-4223-8c6b-9204ed560cbb/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5e18d660-d8a9-4223-8c6b-9204ed560cbb/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5e18d660-d8a9-4223-8c6b-9204ed560cbb/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5e18d660-d8a9-4223-8c6b-9204ed560cbb/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix003_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_5e18d660-d8a9-4223-8c6b-9204ed560cbb/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5e18d660-d8a9-4223-8c6b-9204ed560cbb/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 a5701852ce90a84820ef89cf6ce7497687cba636 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 20:01:19,174 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:01:19,176 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:01:19,183 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:01:19,183 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:01:19,184 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:01:19,185 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:01:19,186 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:01:19,188 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:01:19,188 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:01:19,189 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:01:19,190 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:01:19,190 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:01:19,191 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:01:19,191 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:01:19,192 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:01:19,193 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:01:19,193 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:01:19,195 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:01:19,196 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:01:19,197 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:01:19,198 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:01:19,198 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:01:19,199 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:01:19,200 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:01:19,200 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:01:19,201 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:01:19,201 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:01:19,201 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:01:19,202 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:01:19,202 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:01:19,203 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:01:19,203 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:01:19,203 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:01:19,204 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:01:19,204 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:01:19,205 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:01:19,205 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:01:19,205 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:01:19,205 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:01:19,206 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:01:19,206 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5e18d660-d8a9-4223-8c6b-9204ed560cbb/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 20:01:19,216 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:01:19,217 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:01:19,217 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:01:19,217 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:01:19,217 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:01:19,218 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:01:19,218 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 20:01:19,218 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:01:19,218 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:01:19,218 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 20:01:19,218 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 20:01:19,218 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:01:19,219 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 20:01:19,219 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 20:01:19,219 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 20:01:19,219 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:01:19,219 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:01:19,220 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:01:19,220 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:01:19,220 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:01:19,220 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 20:01:19,220 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:01:19,220 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 20:01:19,220 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:01:19,221 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:01:19,221 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 20:01:19,221 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:01:19,221 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 20:01:19,221 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:01:19,221 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:01:19,221 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:01:19,222 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:01:19,222 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:01:19,222 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:01:19,222 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 20:01:19,222 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 20:01:19,222 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 20:01:19,222 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 20:01:19,223 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:01:19,223 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:01:19,223 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_5e18d660-d8a9-4223-8c6b-9204ed560cbb/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 -> a5701852ce90a84820ef89cf6ce7497687cba636 [2019-12-07 20:01:19,321 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:01:19,328 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:01:19,330 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:01:19,331 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:01:19,332 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:01:19,332 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5e18d660-d8a9-4223-8c6b-9204ed560cbb/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix003_power.opt.i [2019-12-07 20:01:19,369 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5e18d660-d8a9-4223-8c6b-9204ed560cbb/bin/utaipan/data/e4278e718/1b13eee740674472adbe22e9ae1ccb2c/FLAGeb8f2c5d0 [2019-12-07 20:01:19,890 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:01:19,890 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5e18d660-d8a9-4223-8c6b-9204ed560cbb/sv-benchmarks/c/pthread-wmm/mix003_power.opt.i [2019-12-07 20:01:19,901 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5e18d660-d8a9-4223-8c6b-9204ed560cbb/bin/utaipan/data/e4278e718/1b13eee740674472adbe22e9ae1ccb2c/FLAGeb8f2c5d0 [2019-12-07 20:01:20,403 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5e18d660-d8a9-4223-8c6b-9204ed560cbb/bin/utaipan/data/e4278e718/1b13eee740674472adbe22e9ae1ccb2c [2019-12-07 20:01:20,406 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:01:20,407 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:01:20,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:01:20,408 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:01:20,411 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:01:20,411 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:01:20" (1/1) ... [2019-12-07 20:01:20,413 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@227d51b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:01:20, skipping insertion in model container [2019-12-07 20:01:20,413 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:01:20" (1/1) ... [2019-12-07 20:01:20,419 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:01:20,451 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:01:20,696 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:01:20,704 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:01:20,751 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:01:20,797 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:01:20,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:01:20 WrapperNode [2019-12-07 20:01:20,798 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:01:20,798 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:01:20,798 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:01:20,798 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:01:20,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:01:20" (1/1) ... [2019-12-07 20:01:20,818 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:01:20" (1/1) ... [2019-12-07 20:01:20,840 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:01:20,840 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:01:20,840 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:01:20,840 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:01:20,847 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:01:20" (1/1) ... [2019-12-07 20:01:20,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:01:20" (1/1) ... [2019-12-07 20:01:20,851 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:01:20" (1/1) ... [2019-12-07 20:01:20,851 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:01:20" (1/1) ... [2019-12-07 20:01:20,859 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:01:20" (1/1) ... [2019-12-07 20:01:20,862 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:01:20" (1/1) ... [2019-12-07 20:01:20,864 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:01:20" (1/1) ... [2019-12-07 20:01:20,868 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:01:20,868 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:01:20,868 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:01:20,869 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:01:20,869 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:01:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5e18d660-d8a9-4223-8c6b-9204ed560cbb/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:01:20,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 20:01:20,914 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 20:01:20,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 20:01:20,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 20:01:20,915 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 20:01:20,915 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 20:01:20,915 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 20:01:20,915 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 20:01:20,915 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 20:01:20,915 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 20:01:20,915 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 20:01:20,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:01:20,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:01:20,917 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 20:01:21,320 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:01:21,320 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 20:01:21,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:01:21 BoogieIcfgContainer [2019-12-07 20:01:21,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:01:21,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:01:21,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:01:21,324 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:01:21,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:01:20" (1/3) ... [2019-12-07 20:01:21,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4836ee10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:01:21, skipping insertion in model container [2019-12-07 20:01:21,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:01:20" (2/3) ... [2019-12-07 20:01:21,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4836ee10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:01:21, skipping insertion in model container [2019-12-07 20:01:21,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:01:21" (3/3) ... [2019-12-07 20:01:21,326 INFO L109 eAbstractionObserver]: Analyzing ICFG mix003_power.opt.i [2019-12-07 20:01:21,332 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 20:01:21,332 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:01:21,337 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 20:01:21,338 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 20:01:21,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,367 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,367 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,368 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,368 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,380 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,381 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,381 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,381 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,381 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:01:21,406 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 20:01:21,418 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:01:21,418 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 20:01:21,418 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:01:21,418 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:01:21,418 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:01:21,418 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:01:21,418 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:01:21,418 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:01:21,429 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 242 transitions [2019-12-07 20:01:21,430 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 242 transitions [2019-12-07 20:01:21,492 INFO L134 PetriNetUnfolder]: 56/239 cut-off events. [2019-12-07 20:01:21,492 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 20:01:21,504 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 239 events. 56/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 934 event pairs. 9/190 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 20:01:21,527 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 242 transitions [2019-12-07 20:01:21,562 INFO L134 PetriNetUnfolder]: 56/239 cut-off events. [2019-12-07 20:01:21,562 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 20:01:21,569 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 239 events. 56/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 934 event pairs. 9/190 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 20:01:21,593 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-07 20:01:21,593 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 20:01:25,122 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-07 20:01:25,292 INFO L206 etLargeBlockEncoding]: Checked pairs total: 123368 [2019-12-07 20:01:25,293 INFO L214 etLargeBlockEncoding]: Total number of compositions: 129 [2019-12-07 20:01:25,295 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 105 places, 127 transitions [2019-12-07 20:01:27,849 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 42030 states. [2019-12-07 20:01:27,850 INFO L276 IsEmpty]: Start isEmpty. Operand 42030 states. [2019-12-07 20:01:27,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 20:01:27,856 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:01:27,856 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:01:27,857 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:01:27,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:01:27,861 INFO L82 PathProgramCache]: Analyzing trace with hash -668359293, now seen corresponding path program 1 times [2019-12-07 20:01:27,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:01:27,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918120576] [2019-12-07 20:01:27,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:01:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:01:28,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:01:28,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918120576] [2019-12-07 20:01:28,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:01:28,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 20:01:28,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510020739] [2019-12-07 20:01:28,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:01:28,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:01:28,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:01:28,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:01:28,038 INFO L87 Difference]: Start difference. First operand 42030 states. Second operand 3 states. [2019-12-07 20:01:28,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:01:28,450 INFO L93 Difference]: Finished difference Result 41734 states and 171976 transitions. [2019-12-07 20:01:28,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:01:28,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 20:01:28,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:01:28,709 INFO L225 Difference]: With dead ends: 41734 [2019-12-07 20:01:28,709 INFO L226 Difference]: Without dead ends: 38878 [2019-12-07 20:01:28,710 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:01:29,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38878 states. [2019-12-07 20:01:29,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38878 to 38878. [2019-12-07 20:01:29,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38878 states. [2019-12-07 20:01:30,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38878 states to 38878 states and 160088 transitions. [2019-12-07 20:01:30,070 INFO L78 Accepts]: Start accepts. Automaton has 38878 states and 160088 transitions. Word has length 7 [2019-12-07 20:01:30,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:01:30,071 INFO L462 AbstractCegarLoop]: Abstraction has 38878 states and 160088 transitions. [2019-12-07 20:01:30,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:01:30,071 INFO L276 IsEmpty]: Start isEmpty. Operand 38878 states and 160088 transitions. [2019-12-07 20:01:30,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 20:01:30,075 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:01:30,076 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:01:30,076 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:01:30,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:01:30,076 INFO L82 PathProgramCache]: Analyzing trace with hash 298788116, now seen corresponding path program 1 times [2019-12-07 20:01:30,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:01:30,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999779899] [2019-12-07 20:01:30,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:01:30,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:01:30,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:01:30,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999779899] [2019-12-07 20:01:30,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:01:30,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:01:30,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581396235] [2019-12-07 20:01:30,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:01:30,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:01:30,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:01:30,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:01:30,135 INFO L87 Difference]: Start difference. First operand 38878 states and 160088 transitions. Second operand 4 states. [2019-12-07 20:01:30,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:01:30,732 INFO L93 Difference]: Finished difference Result 61934 states and 244684 transitions. [2019-12-07 20:01:30,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:01:30,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 20:01:30,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:01:30,947 INFO L225 Difference]: With dead ends: 61934 [2019-12-07 20:01:30,947 INFO L226 Difference]: Without dead ends: 61902 [2019-12-07 20:01:30,947 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:01:31,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61902 states. [2019-12-07 20:01:32,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61902 to 60256. [2019-12-07 20:01:32,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60256 states. [2019-12-07 20:01:32,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60256 states to 60256 states and 239489 transitions. [2019-12-07 20:01:32,574 INFO L78 Accepts]: Start accepts. Automaton has 60256 states and 239489 transitions. Word has length 13 [2019-12-07 20:01:32,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:01:32,574 INFO L462 AbstractCegarLoop]: Abstraction has 60256 states and 239489 transitions. [2019-12-07 20:01:32,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:01:32,575 INFO L276 IsEmpty]: Start isEmpty. Operand 60256 states and 239489 transitions. [2019-12-07 20:01:32,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 20:01:32,580 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:01:32,580 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:01:32,580 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:01:32,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:01:32,580 INFO L82 PathProgramCache]: Analyzing trace with hash -46103865, now seen corresponding path program 1 times [2019-12-07 20:01:32,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:01:32,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663505778] [2019-12-07 20:01:32,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:01:32,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:01:32,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:01:32,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663505778] [2019-12-07 20:01:32,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:01:32,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:01:32,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940390440] [2019-12-07 20:01:32,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:01:32,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:01:32,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:01:32,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:01:32,630 INFO L87 Difference]: Start difference. First operand 60256 states and 239489 transitions. Second operand 4 states. [2019-12-07 20:01:33,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:01:33,250 INFO L93 Difference]: Finished difference Result 76784 states and 300751 transitions. [2019-12-07 20:01:33,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:01:33,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 20:01:33,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:01:33,414 INFO L225 Difference]: With dead ends: 76784 [2019-12-07 20:01:33,414 INFO L226 Difference]: Without dead ends: 76756 [2019-12-07 20:01:33,414 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:01:34,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76756 states. [2019-12-07 20:01:36,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76756 to 68490. [2019-12-07 20:01:36,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68490 states. [2019-12-07 20:01:36,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68490 states to 68490 states and 270892 transitions. [2019-12-07 20:01:36,334 INFO L78 Accepts]: Start accepts. Automaton has 68490 states and 270892 transitions. Word has length 16 [2019-12-07 20:01:36,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:01:36,334 INFO L462 AbstractCegarLoop]: Abstraction has 68490 states and 270892 transitions. [2019-12-07 20:01:36,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:01:36,334 INFO L276 IsEmpty]: Start isEmpty. Operand 68490 states and 270892 transitions. [2019-12-07 20:01:36,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 20:01:36,340 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:01:36,340 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:01:36,341 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:01:36,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:01:36,341 INFO L82 PathProgramCache]: Analyzing trace with hash 523730593, now seen corresponding path program 1 times [2019-12-07 20:01:36,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:01:36,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639815942] [2019-12-07 20:01:36,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:01:36,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:01:36,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:01:36,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639815942] [2019-12-07 20:01:36,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:01:36,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 20:01:36,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683935248] [2019-12-07 20:01:36,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:01:36,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:01:36,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:01:36,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:01:36,414 INFO L87 Difference]: Start difference. First operand 68490 states and 270892 transitions. Second operand 3 states. [2019-12-07 20:01:36,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:01:36,678 INFO L93 Difference]: Finished difference Result 68520 states and 270829 transitions. [2019-12-07 20:01:36,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:01:36,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 20:01:36,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:01:36,834 INFO L225 Difference]: With dead ends: 68520 [2019-12-07 20:01:36,834 INFO L226 Difference]: Without dead ends: 68520 [2019-12-07 20:01:36,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:01:37,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68520 states. [2019-12-07 20:01:38,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68520 to 68431. [2019-12-07 20:01:38,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68431 states. [2019-12-07 20:01:38,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68431 states to 68431 states and 270638 transitions. [2019-12-07 20:01:38,595 INFO L78 Accepts]: Start accepts. Automaton has 68431 states and 270638 transitions. Word has length 18 [2019-12-07 20:01:38,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:01:38,595 INFO L462 AbstractCegarLoop]: Abstraction has 68431 states and 270638 transitions. [2019-12-07 20:01:38,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:01:38,596 INFO L276 IsEmpty]: Start isEmpty. Operand 68431 states and 270638 transitions. [2019-12-07 20:01:38,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 20:01:38,601 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:01:38,601 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:01:38,602 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:01:38,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:01:38,602 INFO L82 PathProgramCache]: Analyzing trace with hash 353080702, now seen corresponding path program 1 times [2019-12-07 20:01:38,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:01:38,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601647938] [2019-12-07 20:01:38,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:01:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:01:38,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:01:38,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601647938] [2019-12-07 20:01:38,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:01:38,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:01:38,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286949075] [2019-12-07 20:01:38,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:01:38,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:01:38,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:01:38,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:01:38,671 INFO L87 Difference]: Start difference. First operand 68431 states and 270638 transitions. Second operand 4 states. [2019-12-07 20:01:38,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:01:38,970 INFO L93 Difference]: Finished difference Result 68408 states and 270453 transitions. [2019-12-07 20:01:38,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:01:38,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 20:01:38,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:01:39,156 INFO L225 Difference]: With dead ends: 68408 [2019-12-07 20:01:39,156 INFO L226 Difference]: Without dead ends: 68408 [2019-12-07 20:01:39,157 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:01:40,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68408 states. [2019-12-07 20:01:40,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68408 to 68320. [2019-12-07 20:01:40,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68320 states. [2019-12-07 20:01:40,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68320 states to 68320 states and 270263 transitions. [2019-12-07 20:01:40,993 INFO L78 Accepts]: Start accepts. Automaton has 68320 states and 270263 transitions. Word has length 19 [2019-12-07 20:01:40,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:01:40,993 INFO L462 AbstractCegarLoop]: Abstraction has 68320 states and 270263 transitions. [2019-12-07 20:01:40,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:01:40,994 INFO L276 IsEmpty]: Start isEmpty. Operand 68320 states and 270263 transitions. [2019-12-07 20:01:41,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 20:01:41,000 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:01:41,000 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:01:41,000 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:01:41,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:01:41,001 INFO L82 PathProgramCache]: Analyzing trace with hash 846033422, now seen corresponding path program 1 times [2019-12-07 20:01:41,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:01:41,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736450734] [2019-12-07 20:01:41,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:01:41,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:01:41,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:01:41,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736450734] [2019-12-07 20:01:41,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:01:41,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:01:41,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774596714] [2019-12-07 20:01:41,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:01:41,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:01:41,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:01:41,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:01:41,028 INFO L87 Difference]: Start difference. First operand 68320 states and 270263 transitions. Second operand 3 states. [2019-12-07 20:01:41,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:01:41,144 INFO L93 Difference]: Finished difference Result 37458 states and 129514 transitions. [2019-12-07 20:01:41,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:01:41,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 20:01:41,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:01:41,211 INFO L225 Difference]: With dead ends: 37458 [2019-12-07 20:01:41,211 INFO L226 Difference]: Without dead ends: 37458 [2019-12-07 20:01:41,212 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 20:01:41,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37458 states. [2019-12-07 20:01:42,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37458 to 37458. [2019-12-07 20:01:42,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37458 states. [2019-12-07 20:01:42,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37458 states to 37458 states and 129514 transitions. [2019-12-07 20:01:42,110 INFO L78 Accepts]: Start accepts. Automaton has 37458 states and 129514 transitions. Word has length 19 [2019-12-07 20:01:42,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:01:42,110 INFO L462 AbstractCegarLoop]: Abstraction has 37458 states and 129514 transitions. [2019-12-07 20:01:42,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:01:42,110 INFO L276 IsEmpty]: Start isEmpty. Operand 37458 states and 129514 transitions. [2019-12-07 20:01:42,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 20:01:42,114 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:01:42,114 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:01:42,114 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:01:42,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:01:42,114 INFO L82 PathProgramCache]: Analyzing trace with hash -149145903, now seen corresponding path program 1 times [2019-12-07 20:01:42,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:01:42,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792047005] [2019-12-07 20:01:42,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:01:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:01:42,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:01:42,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792047005] [2019-12-07 20:01:42,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:01:42,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:01:42,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098652139] [2019-12-07 20:01:42,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:01:42,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:01:42,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:01:42,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:01:42,153 INFO L87 Difference]: Start difference. First operand 37458 states and 129514 transitions. Second operand 3 states. [2019-12-07 20:01:42,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:01:42,264 INFO L93 Difference]: Finished difference Result 37458 states and 127968 transitions. [2019-12-07 20:01:42,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:01:42,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 20:01:42,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:01:42,326 INFO L225 Difference]: With dead ends: 37458 [2019-12-07 20:01:42,327 INFO L226 Difference]: Without dead ends: 37458 [2019-12-07 20:01:42,327 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:01:42,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37458 states. [2019-12-07 20:01:43,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37458 to 37286. [2019-12-07 20:01:43,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37286 states. [2019-12-07 20:01:43,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37286 states to 37286 states and 127488 transitions. [2019-12-07 20:01:43,115 INFO L78 Accepts]: Start accepts. Automaton has 37286 states and 127488 transitions. Word has length 20 [2019-12-07 20:01:43,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:01:43,115 INFO L462 AbstractCegarLoop]: Abstraction has 37286 states and 127488 transitions. [2019-12-07 20:01:43,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:01:43,115 INFO L276 IsEmpty]: Start isEmpty. Operand 37286 states and 127488 transitions. [2019-12-07 20:01:43,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 20:01:43,118 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:01:43,118 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:01:43,118 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:01:43,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:01:43,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1241511635, now seen corresponding path program 1 times [2019-12-07 20:01:43,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:01:43,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509434311] [2019-12-07 20:01:43,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:01:43,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:01:43,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:01:43,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509434311] [2019-12-07 20:01:43,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:01:43,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:01:43,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160861874] [2019-12-07 20:01:43,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:01:43,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:01:43,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:01:43,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:01:43,163 INFO L87 Difference]: Start difference. First operand 37286 states and 127488 transitions. Second operand 4 states. [2019-12-07 20:01:43,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:01:43,274 INFO L93 Difference]: Finished difference Result 35252 states and 120251 transitions. [2019-12-07 20:01:43,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:01:43,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 20:01:43,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:01:43,334 INFO L225 Difference]: With dead ends: 35252 [2019-12-07 20:01:43,334 INFO L226 Difference]: Without dead ends: 35252 [2019-12-07 20:01:43,334 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:01:43,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35252 states. [2019-12-07 20:01:44,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35252 to 35252. [2019-12-07 20:01:44,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35252 states. [2019-12-07 20:01:44,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35252 states to 35252 states and 120251 transitions. [2019-12-07 20:01:44,083 INFO L78 Accepts]: Start accepts. Automaton has 35252 states and 120251 transitions. Word has length 20 [2019-12-07 20:01:44,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:01:44,083 INFO L462 AbstractCegarLoop]: Abstraction has 35252 states and 120251 transitions. [2019-12-07 20:01:44,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:01:44,083 INFO L276 IsEmpty]: Start isEmpty. Operand 35252 states and 120251 transitions. [2019-12-07 20:01:44,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 20:01:44,089 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:01:44,089 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:01:44,089 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:01:44,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:01:44,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1967693899, now seen corresponding path program 1 times [2019-12-07 20:01:44,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:01:44,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23175544] [2019-12-07 20:01:44,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:01:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:01:44,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:01:44,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23175544] [2019-12-07 20:01:44,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:01:44,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:01:44,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147169844] [2019-12-07 20:01:44,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:01:44,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:01:44,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:01:44,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:01:44,124 INFO L87 Difference]: Start difference. First operand 35252 states and 120251 transitions. Second operand 5 states. [2019-12-07 20:01:44,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:01:44,618 INFO L93 Difference]: Finished difference Result 42312 states and 142107 transitions. [2019-12-07 20:01:44,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 20:01:44,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-07 20:01:44,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:01:44,681 INFO L225 Difference]: With dead ends: 42312 [2019-12-07 20:01:44,681 INFO L226 Difference]: Without dead ends: 42285 [2019-12-07 20:01:44,682 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:01:45,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42285 states. [2019-12-07 20:01:45,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42285 to 35290. [2019-12-07 20:01:45,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35290 states. [2019-12-07 20:01:45,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35290 states to 35290 states and 120362 transitions. [2019-12-07 20:01:45,510 INFO L78 Accepts]: Start accepts. Automaton has 35290 states and 120362 transitions. Word has length 23 [2019-12-07 20:01:45,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:01:45,510 INFO L462 AbstractCegarLoop]: Abstraction has 35290 states and 120362 transitions. [2019-12-07 20:01:45,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:01:45,510 INFO L276 IsEmpty]: Start isEmpty. Operand 35290 states and 120362 transitions. [2019-12-07 20:01:45,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 20:01:45,541 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:01:45,541 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:01:45,542 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:01:45,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:01:45,542 INFO L82 PathProgramCache]: Analyzing trace with hash 880845463, now seen corresponding path program 1 times [2019-12-07 20:01:45,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:01:45,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963467970] [2019-12-07 20:01:45,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:01:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:01:45,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:01:45,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963467970] [2019-12-07 20:01:45,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:01:45,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:01:45,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933429609] [2019-12-07 20:01:45,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:01:45,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:01:45,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:01:45,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:01:45,601 INFO L87 Difference]: Start difference. First operand 35290 states and 120362 transitions. Second operand 5 states. [2019-12-07 20:01:45,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:01:45,839 INFO L93 Difference]: Finished difference Result 48737 states and 169295 transitions. [2019-12-07 20:01:45,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 20:01:45,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-12-07 20:01:45,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:01:45,917 INFO L225 Difference]: With dead ends: 48737 [2019-12-07 20:01:45,917 INFO L226 Difference]: Without dead ends: 48737 [2019-12-07 20:01:45,918 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:01:46,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48737 states. [2019-12-07 20:01:46,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48737 to 47415. [2019-12-07 20:01:46,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47415 states. [2019-12-07 20:01:46,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47415 states to 47415 states and 164985 transitions. [2019-12-07 20:01:46,875 INFO L78 Accepts]: Start accepts. Automaton has 47415 states and 164985 transitions. Word has length 35 [2019-12-07 20:01:46,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:01:46,875 INFO L462 AbstractCegarLoop]: Abstraction has 47415 states and 164985 transitions. [2019-12-07 20:01:46,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:01:46,875 INFO L276 IsEmpty]: Start isEmpty. Operand 47415 states and 164985 transitions. [2019-12-07 20:01:46,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 20:01:46,921 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:01:46,921 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:01:46,922 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:01:46,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:01:46,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1341472801, now seen corresponding path program 2 times [2019-12-07 20:01:46,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:01:46,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655742975] [2019-12-07 20:01:46,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:01:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:01:46,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:01:46,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655742975] [2019-12-07 20:01:46,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:01:46,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:01:46,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658869885] [2019-12-07 20:01:46,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 20:01:46,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:01:46,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 20:01:46,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:01:46,997 INFO L87 Difference]: Start difference. First operand 47415 states and 164985 transitions. Second operand 7 states. [2019-12-07 20:01:47,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:01:47,558 INFO L93 Difference]: Finished difference Result 70387 states and 243427 transitions. [2019-12-07 20:01:47,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 20:01:47,559 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-07 20:01:47,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:01:47,675 INFO L225 Difference]: With dead ends: 70387 [2019-12-07 20:01:47,676 INFO L226 Difference]: Without dead ends: 70387 [2019-12-07 20:01:47,676 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-12-07 20:01:48,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70387 states. [2019-12-07 20:01:48,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70387 to 53209. [2019-12-07 20:01:48,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53209 states. [2019-12-07 20:01:48,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53209 states to 53209 states and 185040 transitions. [2019-12-07 20:01:48,925 INFO L78 Accepts]: Start accepts. Automaton has 53209 states and 185040 transitions. Word has length 35 [2019-12-07 20:01:48,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:01:48,925 INFO L462 AbstractCegarLoop]: Abstraction has 53209 states and 185040 transitions. [2019-12-07 20:01:48,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 20:01:48,925 INFO L276 IsEmpty]: Start isEmpty. Operand 53209 states and 185040 transitions. [2019-12-07 20:01:48,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 20:01:48,968 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:01:48,968 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:01:48,969 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:01:48,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:01:48,969 INFO L82 PathProgramCache]: Analyzing trace with hash 2108335145, now seen corresponding path program 3 times [2019-12-07 20:01:48,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:01:48,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795720] [2019-12-07 20:01:48,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:01:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:01:49,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:01:49,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795720] [2019-12-07 20:01:49,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:01:49,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 20:01:49,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481511274] [2019-12-07 20:01:49,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 20:01:49,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:01:49,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 20:01:49,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:01:49,034 INFO L87 Difference]: Start difference. First operand 53209 states and 185040 transitions. Second operand 8 states. [2019-12-07 20:01:49,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:01:49,659 INFO L93 Difference]: Finished difference Result 92418 states and 315641 transitions. [2019-12-07 20:01:49,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 20:01:49,660 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-12-07 20:01:49,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:01:49,788 INFO L225 Difference]: With dead ends: 92418 [2019-12-07 20:01:49,789 INFO L226 Difference]: Without dead ends: 75278 [2019-12-07 20:01:49,789 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2019-12-07 20:01:50,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75278 states. [2019-12-07 20:01:51,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75278 to 56326. [2019-12-07 20:01:51,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56326 states. [2019-12-07 20:01:51,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56326 states to 56326 states and 194572 transitions. [2019-12-07 20:01:51,383 INFO L78 Accepts]: Start accepts. Automaton has 56326 states and 194572 transitions. Word has length 35 [2019-12-07 20:01:51,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:01:51,383 INFO L462 AbstractCegarLoop]: Abstraction has 56326 states and 194572 transitions. [2019-12-07 20:01:51,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 20:01:51,383 INFO L276 IsEmpty]: Start isEmpty. Operand 56326 states and 194572 transitions. [2019-12-07 20:01:51,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 20:01:51,430 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:01:51,430 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:01:51,430 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:01:51,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:01:51,431 INFO L82 PathProgramCache]: Analyzing trace with hash -417543669, now seen corresponding path program 4 times [2019-12-07 20:01:51,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:01:51,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148705387] [2019-12-07 20:01:51,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:01:51,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:01:51,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:01:51,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148705387] [2019-12-07 20:01:51,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:01:51,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 20:01:51,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836591538] [2019-12-07 20:01:51,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 20:01:51,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:01:51,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 20:01:51,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:01:51,506 INFO L87 Difference]: Start difference. First operand 56326 states and 194572 transitions. Second operand 9 states. [2019-12-07 20:01:52,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:01:52,322 INFO L93 Difference]: Finished difference Result 106325 states and 369464 transitions. [2019-12-07 20:01:52,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 20:01:52,323 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-12-07 20:01:52,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:01:52,516 INFO L225 Difference]: With dead ends: 106325 [2019-12-07 20:01:52,516 INFO L226 Difference]: Without dead ends: 101653 [2019-12-07 20:01:52,517 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2019-12-07 20:01:53,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101653 states. [2019-12-07 20:01:54,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101653 to 58386. [2019-12-07 20:01:54,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58386 states. [2019-12-07 20:01:54,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58386 states to 58386 states and 202224 transitions. [2019-12-07 20:01:54,128 INFO L78 Accepts]: Start accepts. Automaton has 58386 states and 202224 transitions. Word has length 35 [2019-12-07 20:01:54,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:01:54,128 INFO L462 AbstractCegarLoop]: Abstraction has 58386 states and 202224 transitions. [2019-12-07 20:01:54,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 20:01:54,128 INFO L276 IsEmpty]: Start isEmpty. Operand 58386 states and 202224 transitions. [2019-12-07 20:01:54,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 20:01:54,178 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:01:54,178 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] [2019-12-07 20:01:54,178 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:01:54,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:01:54,178 INFO L82 PathProgramCache]: Analyzing trace with hash 445785493, now seen corresponding path program 1 times [2019-12-07 20:01:54,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:01:54,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961401793] [2019-12-07 20:01:54,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:01:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:01:54,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:01:54,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961401793] [2019-12-07 20:01:54,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:01:54,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:01:54,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581473633] [2019-12-07 20:01:54,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:01:54,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:01:54,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:01:54,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:01:54,208 INFO L87 Difference]: Start difference. First operand 58386 states and 202224 transitions. Second operand 4 states. [2019-12-07 20:01:54,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:01:54,238 INFO L93 Difference]: Finished difference Result 8299 states and 24619 transitions. [2019-12-07 20:01:54,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:01:54,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-07 20:01:54,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:01:54,247 INFO L225 Difference]: With dead ends: 8299 [2019-12-07 20:01:54,247 INFO L226 Difference]: Without dead ends: 8299 [2019-12-07 20:01:54,247 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:01:54,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8299 states. [2019-12-07 20:01:54,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8299 to 7269. [2019-12-07 20:01:54,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7269 states. [2019-12-07 20:01:54,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7269 states to 7269 states and 21308 transitions. [2019-12-07 20:01:54,331 INFO L78 Accepts]: Start accepts. Automaton has 7269 states and 21308 transitions. Word has length 36 [2019-12-07 20:01:54,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:01:54,332 INFO L462 AbstractCegarLoop]: Abstraction has 7269 states and 21308 transitions. [2019-12-07 20:01:54,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:01:54,332 INFO L276 IsEmpty]: Start isEmpty. Operand 7269 states and 21308 transitions. [2019-12-07 20:01:54,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 20:01:54,337 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:01:54,337 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:01:54,338 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:01:54,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:01:54,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1596603272, now seen corresponding path program 1 times [2019-12-07 20:01:54,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:01:54,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693486675] [2019-12-07 20:01:54,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:01:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:01:54,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:01:54,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693486675] [2019-12-07 20:01:54,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:01:54,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 20:01:54,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096979872] [2019-12-07 20:01:54,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 20:01:54,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:01:54,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 20:01:54,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:01:54,533 INFO L87 Difference]: Start difference. First operand 7269 states and 21308 transitions. Second operand 9 states. [2019-12-07 20:01:55,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:01:55,267 INFO L93 Difference]: Finished difference Result 14826 states and 39378 transitions. [2019-12-07 20:01:55,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 20:01:55,268 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2019-12-07 20:01:55,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:01:55,281 INFO L225 Difference]: With dead ends: 14826 [2019-12-07 20:01:55,281 INFO L226 Difference]: Without dead ends: 14194 [2019-12-07 20:01:55,281 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2019-12-07 20:01:55,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14194 states. [2019-12-07 20:01:55,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14194 to 9810. [2019-12-07 20:01:55,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9810 states. [2019-12-07 20:01:55,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9810 states to 9810 states and 27792 transitions. [2019-12-07 20:01:55,419 INFO L78 Accepts]: Start accepts. Automaton has 9810 states and 27792 transitions. Word has length 47 [2019-12-07 20:01:55,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:01:55,419 INFO L462 AbstractCegarLoop]: Abstraction has 9810 states and 27792 transitions. [2019-12-07 20:01:55,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 20:01:55,419 INFO L276 IsEmpty]: Start isEmpty. Operand 9810 states and 27792 transitions. [2019-12-07 20:01:55,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 20:01:55,427 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:01:55,427 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:01:55,427 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:01:55,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:01:55,427 INFO L82 PathProgramCache]: Analyzing trace with hash -44720358, now seen corresponding path program 2 times [2019-12-07 20:01:55,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:01:55,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005833888] [2019-12-07 20:01:55,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:01:55,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:01:55,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:01:55,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005833888] [2019-12-07 20:01:55,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:01:55,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 20:01:55,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092311945] [2019-12-07 20:01:55,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 20:01:55,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:01:55,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 20:01:55,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-07 20:01:55,652 INFO L87 Difference]: Start difference. First operand 9810 states and 27792 transitions. Second operand 10 states. [2019-12-07 20:01:56,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:01:56,558 INFO L93 Difference]: Finished difference Result 15498 states and 40984 transitions. [2019-12-07 20:01:56,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 20:01:56,558 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2019-12-07 20:01:56,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:01:56,570 INFO L225 Difference]: With dead ends: 15498 [2019-12-07 20:01:56,570 INFO L226 Difference]: Without dead ends: 13134 [2019-12-07 20:01:56,571 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-12-07 20:01:56,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13134 states. [2019-12-07 20:01:56,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13134 to 10300. [2019-12-07 20:01:56,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10300 states. [2019-12-07 20:01:56,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10300 states to 10300 states and 28898 transitions. [2019-12-07 20:01:56,696 INFO L78 Accepts]: Start accepts. Automaton has 10300 states and 28898 transitions. Word has length 47 [2019-12-07 20:01:56,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:01:56,696 INFO L462 AbstractCegarLoop]: Abstraction has 10300 states and 28898 transitions. [2019-12-07 20:01:56,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 20:01:56,697 INFO L276 IsEmpty]: Start isEmpty. Operand 10300 states and 28898 transitions. [2019-12-07 20:01:56,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 20:01:56,704 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:01:56,704 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:01:56,704 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:01:56,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:01:56,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1138071248, now seen corresponding path program 3 times [2019-12-07 20:01:56,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:01:56,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199862868] [2019-12-07 20:01:56,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:01:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:01:56,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:01:56,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199862868] [2019-12-07 20:01:56,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:01:56,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 20:01:56,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669628069] [2019-12-07 20:01:56,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 20:01:56,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:01:56,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 20:01:56,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:01:56,915 INFO L87 Difference]: Start difference. First operand 10300 states and 28898 transitions. Second operand 9 states. [2019-12-07 20:01:57,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:01:57,951 INFO L93 Difference]: Finished difference Result 28280 states and 76837 transitions. [2019-12-07 20:01:57,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 20:01:57,952 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2019-12-07 20:01:57,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:01:57,980 INFO L225 Difference]: With dead ends: 28280 [2019-12-07 20:01:57,980 INFO L226 Difference]: Without dead ends: 27538 [2019-12-07 20:01:57,980 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2019-12-07 20:01:58,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27538 states. [2019-12-07 20:01:58,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27538 to 16426. [2019-12-07 20:01:58,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16426 states. [2019-12-07 20:01:58,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16426 states to 16426 states and 47572 transitions. [2019-12-07 20:01:58,243 INFO L78 Accepts]: Start accepts. Automaton has 16426 states and 47572 transitions. Word has length 47 [2019-12-07 20:01:58,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:01:58,243 INFO L462 AbstractCegarLoop]: Abstraction has 16426 states and 47572 transitions. [2019-12-07 20:01:58,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 20:01:58,243 INFO L276 IsEmpty]: Start isEmpty. Operand 16426 states and 47572 transitions. [2019-12-07 20:01:58,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 20:01:58,258 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:01:58,258 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:01:58,258 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:01:58,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:01:58,258 INFO L82 PathProgramCache]: Analyzing trace with hash 115757032, now seen corresponding path program 4 times [2019-12-07 20:01:58,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:01:58,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547862525] [2019-12-07 20:01:58,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:01:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:01:58,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:01:58,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547862525] [2019-12-07 20:01:58,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:01:58,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 20:01:58,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398455243] [2019-12-07 20:01:58,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 20:01:58,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:01:58,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 20:01:58,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-07 20:01:58,447 INFO L87 Difference]: Start difference. First operand 16426 states and 47572 transitions. Second operand 11 states. [2019-12-07 20:01:59,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:01:59,045 INFO L93 Difference]: Finished difference Result 24071 states and 67509 transitions. [2019-12-07 20:01:59,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 20:01:59,045 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2019-12-07 20:01:59,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:01:59,068 INFO L225 Difference]: With dead ends: 24071 [2019-12-07 20:01:59,068 INFO L226 Difference]: Without dead ends: 23130 [2019-12-07 20:01:59,069 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2019-12-07 20:01:59,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23130 states. [2019-12-07 20:01:59,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23130 to 17503. [2019-12-07 20:01:59,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17503 states. [2019-12-07 20:01:59,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17503 states to 17503 states and 50586 transitions. [2019-12-07 20:01:59,301 INFO L78 Accepts]: Start accepts. Automaton has 17503 states and 50586 transitions. Word has length 47 [2019-12-07 20:01:59,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:01:59,302 INFO L462 AbstractCegarLoop]: Abstraction has 17503 states and 50586 transitions. [2019-12-07 20:01:59,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 20:01:59,302 INFO L276 IsEmpty]: Start isEmpty. Operand 17503 states and 50586 transitions. [2019-12-07 20:01:59,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 20:01:59,317 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:01:59,317 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:01:59,317 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:01:59,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:01:59,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1030038662, now seen corresponding path program 5 times [2019-12-07 20:01:59,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:01:59,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256744840] [2019-12-07 20:01:59,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:01:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:01:59,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:01:59,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256744840] [2019-12-07 20:01:59,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:01:59,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:01:59,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162829080] [2019-12-07 20:01:59,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:01:59,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:01:59,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:01:59,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:01:59,349 INFO L87 Difference]: Start difference. First operand 17503 states and 50586 transitions. Second operand 5 states. [2019-12-07 20:01:59,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:01:59,400 INFO L93 Difference]: Finished difference Result 15266 states and 45353 transitions. [2019-12-07 20:01:59,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:01:59,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-07 20:01:59,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:01:59,411 INFO L225 Difference]: With dead ends: 15266 [2019-12-07 20:01:59,411 INFO L226 Difference]: Without dead ends: 10914 [2019-12-07 20:01:59,411 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:01:59,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10914 states. [2019-12-07 20:01:59,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10914 to 10459. [2019-12-07 20:01:59,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10459 states. [2019-12-07 20:01:59,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10459 states to 10459 states and 30509 transitions. [2019-12-07 20:01:59,533 INFO L78 Accepts]: Start accepts. Automaton has 10459 states and 30509 transitions. Word has length 47 [2019-12-07 20:01:59,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:01:59,534 INFO L462 AbstractCegarLoop]: Abstraction has 10459 states and 30509 transitions. [2019-12-07 20:01:59,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:01:59,534 INFO L276 IsEmpty]: Start isEmpty. Operand 10459 states and 30509 transitions. [2019-12-07 20:01:59,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 20:01:59,543 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:01:59,543 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:01:59,543 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:01:59,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:01:59,543 INFO L82 PathProgramCache]: Analyzing trace with hash -113248009, now seen corresponding path program 1 times [2019-12-07 20:01:59,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:01:59,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771321227] [2019-12-07 20:01:59,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:01:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:01:59,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:01:59,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771321227] [2019-12-07 20:01:59,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:01:59,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 20:01:59,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454022464] [2019-12-07 20:01:59,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 20:01:59,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:01:59,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 20:01:59,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:01:59,612 INFO L87 Difference]: Start difference. First operand 10459 states and 30509 transitions. Second operand 8 states. [2019-12-07 20:01:59,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:01:59,913 INFO L93 Difference]: Finished difference Result 17801 states and 50806 transitions. [2019-12-07 20:01:59,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 20:01:59,913 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2019-12-07 20:01:59,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:01:59,929 INFO L225 Difference]: With dead ends: 17801 [2019-12-07 20:01:59,929 INFO L226 Difference]: Without dead ends: 16008 [2019-12-07 20:01:59,930 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 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 20:01:59,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16008 states. [2019-12-07 20:02:00,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16008 to 14318. [2019-12-07 20:02:00,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14318 states. [2019-12-07 20:02:00,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14318 states to 14318 states and 41914 transitions. [2019-12-07 20:02:00,116 INFO L78 Accepts]: Start accepts. Automaton has 14318 states and 41914 transitions. Word has length 62 [2019-12-07 20:02:00,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:02:00,116 INFO L462 AbstractCegarLoop]: Abstraction has 14318 states and 41914 transitions. [2019-12-07 20:02:00,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 20:02:00,116 INFO L276 IsEmpty]: Start isEmpty. Operand 14318 states and 41914 transitions. [2019-12-07 20:02:00,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 20:02:00,129 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:02:00,129 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:02:00,129 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:02:00,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:02:00,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1931449045, now seen corresponding path program 2 times [2019-12-07 20:02:00,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:02:00,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778347492] [2019-12-07 20:02:00,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:02:00,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:02:00,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:02:00,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778347492] [2019-12-07 20:02:00,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:02:00,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:02:00,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645774312] [2019-12-07 20:02:00,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:02:00,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:02:00,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:02:00,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:02:00,164 INFO L87 Difference]: Start difference. First operand 14318 states and 41914 transitions. Second operand 4 states. [2019-12-07 20:02:00,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:02:00,212 INFO L93 Difference]: Finished difference Result 15061 states and 43600 transitions. [2019-12-07 20:02:00,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:02:00,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-07 20:02:00,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:02:00,218 INFO L225 Difference]: With dead ends: 15061 [2019-12-07 20:02:00,218 INFO L226 Difference]: Without dead ends: 4860 [2019-12-07 20:02:00,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 20:02:00,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4860 states. [2019-12-07 20:02:00,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4860 to 4833. [2019-12-07 20:02:00,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4833 states. [2019-12-07 20:02:00,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4833 states to 4833 states and 13233 transitions. [2019-12-07 20:02:00,266 INFO L78 Accepts]: Start accepts. Automaton has 4833 states and 13233 transitions. Word has length 62 [2019-12-07 20:02:00,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:02:00,266 INFO L462 AbstractCegarLoop]: Abstraction has 4833 states and 13233 transitions. [2019-12-07 20:02:00,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:02:00,266 INFO L276 IsEmpty]: Start isEmpty. Operand 4833 states and 13233 transitions. [2019-12-07 20:02:00,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 20:02:00,270 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:02:00,270 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:02:00,270 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:02:00,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:02:00,270 INFO L82 PathProgramCache]: Analyzing trace with hash 292970337, now seen corresponding path program 3 times [2019-12-07 20:02:00,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:02:00,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682713485] [2019-12-07 20:02:00,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:02:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:02:00,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:02:00,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682713485] [2019-12-07 20:02:00,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:02:00,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:02:00,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999108460] [2019-12-07 20:02:00,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:02:00,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:02:00,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:02:00,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:02:00,325 INFO L87 Difference]: Start difference. First operand 4833 states and 13233 transitions. Second operand 5 states. [2019-12-07 20:02:00,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:02:00,352 INFO L93 Difference]: Finished difference Result 5234 states and 14138 transitions. [2019-12-07 20:02:00,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:02:00,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-12-07 20:02:00,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:02:00,353 INFO L225 Difference]: With dead ends: 5234 [2019-12-07 20:02:00,353 INFO L226 Difference]: Without dead ends: 466 [2019-12-07 20:02:00,354 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:02:00,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-12-07 20:02:00,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2019-12-07 20:02:00,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-12-07 20:02:00,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 1012 transitions. [2019-12-07 20:02:00,357 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 1012 transitions. Word has length 62 [2019-12-07 20:02:00,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:02:00,358 INFO L462 AbstractCegarLoop]: Abstraction has 466 states and 1012 transitions. [2019-12-07 20:02:00,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:02:00,358 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 1012 transitions. [2019-12-07 20:02:00,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 20:02:00,358 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:02:00,358 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:02:00,358 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:02:00,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:02:00,359 INFO L82 PathProgramCache]: Analyzing trace with hash 799739627, now seen corresponding path program 1 times [2019-12-07 20:02:00,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:02:00,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956319231] [2019-12-07 20:02:00,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:02:00,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 20:02:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 20:02:00,423 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 20:02:00,423 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 20:02:00,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_106| 0 0))) (and (= v_~y$flush_delayed~0_334 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t65~0.base_69| 4) |v_#length_21|) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t65~0.base_69|)) (= v_~y$r_buff0_thd0~0_211 0) (= |v_#NULL.offset_7| 0) (= v_~y$w_buff0_used~0_972 0) (= v_~y$w_buff1~0_277 0) (= v_~y$read_delayed~0_7 0) (= v_~main$tmp_guard1~0_59 0) (= 0 v_~y$r_buff0_thd2~0_408) (= v_~y$r_buff1_thd0~0_314 0) (= v_~y$w_buff1_used~0_548 0) (= 0 |v_ULTIMATE.start_main_~#t65~0.offset_41|) (< 0 |v_#StackHeapBarrier_16|) (= v_~y$r_buff1_thd1~0_221 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t65~0.base_69| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t65~0.base_69|) |v_ULTIMATE.start_main_~#t65~0.offset_41| 0)) |v_#memory_int_19|) (= v_~__unbuffered_cnt~0_149 0) (= v_~y$r_buff0_thd1~0_150 0) (= v_~y$mem_tmp~0_266 0) (= 0 v_~__unbuffered_p0_EAX~0_59) (= v_~y~0_368 0) (= v_~main$tmp_guard0~0_20 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t65~0.base_69|) (= 0 v_~y$r_buff0_thd3~0_638) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 |v_#NULL.base_7|) (= 0 v_~weak$$choice0~0_253) (= v_~z~0_27 0) (= 0 v_~y$w_buff0~0_388) (= 0 v_~__unbuffered_p2_EAX~0_67) (= 0 v_~y$r_buff1_thd3~0_405) (= 0 v_~y$r_buff1_thd2~0_395) (= v_~__unbuffered_p1_EBX~0_68 0) (= v_~weak$$choice2~0_330 0) (= 0 v_~__unbuffered_p1_EAX~0_81) (= |v_#valid_104| (store .cse0 |v_ULTIMATE.start_main_~#t65~0.base_69| 1)) (= v_~__unbuffered_p2_EBX~0_61 0) (= v_~x~0_47 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_106|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_18|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ULTIMATE.start_main_~#t65~0.offset=|v_ULTIMATE.start_main_~#t65~0.offset_41|, #NULL.offset=|v_#NULL.offset_7|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_266, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_59, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_405, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_81, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_150, ~y$flush_delayed~0=v_~y$flush_delayed~0_334, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_67, ULTIMATE.start_main_~#t67~0.offset=|v_ULTIMATE.start_main_~#t67~0.offset_14|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_61, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_54|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_117|, ~weak$$choice0~0=v_~weak$$choice0~0_253, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_~#t65~0.base=|v_ULTIMATE.start_main_~#t65~0.base_69|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_40|, ~y$w_buff1~0=v_~y$w_buff1~0_277, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t66~0.offset=|v_ULTIMATE.start_main_~#t66~0.offset_41|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_408, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_149, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_314, ~x~0=v_~x~0_47, ULTIMATE.start_main_~#t66~0.base=|v_ULTIMATE.start_main_~#t66~0.base_70|, ~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_972, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_59, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_221, ~y$w_buff0~0=v_~y$w_buff0~0_388, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_638, ~y~0=v_~y~0_368, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_68, ULTIMATE.start_main_~#t67~0.base=|v_ULTIMATE.start_main_~#t67~0.base_43|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_74|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_28|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_395, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_478|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_43|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_211, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_330, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t65~0.offset, #NULL.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t67~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_~#t65~0.base, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t66~0.offset, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t66~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t67~0.base, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 20:02:00,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L835-1-->L837: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t66~0.base_12| 4)) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t66~0.base_12|) 0) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t66~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t66~0.base_12|) |v_ULTIMATE.start_main_~#t66~0.offset_10| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t66~0.base_12|)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t66~0.base_12| 1)) (= 0 |v_ULTIMATE.start_main_~#t66~0.offset_10|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t66~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t66~0.base=|v_ULTIMATE.start_main_~#t66~0.base_12|, ULTIMATE.start_main_~#t66~0.offset=|v_ULTIMATE.start_main_~#t66~0.offset_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_4|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t66~0.base, ULTIMATE.start_main_~#t66~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 20:02:00,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L837-1-->L839: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t67~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t67~0.base_11|) |v_ULTIMATE.start_main_~#t67~0.offset_9| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t67~0.base_11|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t67~0.base_11| 4) |v_#length_13|) (not (= |v_ULTIMATE.start_main_~#t67~0.base_11| 0)) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t67~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t67~0.offset_9| 0) (= (select |v_#valid_33| |v_ULTIMATE.start_main_~#t67~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t67~0.offset=|v_ULTIMATE.start_main_~#t67~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t67~0.base=|v_ULTIMATE.start_main_~#t67~0.base_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t67~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t67~0.base, #length] because there is no mapped edge [2019-12-07 20:02:00,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff1_used~0_65 v_~y$w_buff0_used~0_118) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_16)) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_16 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|) (= 1 v_~y$w_buff0~0_43) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_65 256) 0)) (not (= (mod v_~y$w_buff0_used~0_117 256) 0)))) 1 0) |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_16| v_P2Thread1of1ForFork0_~arg.offset_14) (= v_~y$w_buff0_used~0_117 1) (= v_~y$w_buff0~0_44 v_~y$w_buff1~0_29) (= |v_P2Thread1of1ForFork0_#in~arg.base_16| v_P2Thread1of1ForFork0_~arg.base_14)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff0~0=v_~y$w_buff0~0_44, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_16|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_14, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_16|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_43, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_14, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_16|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_16, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_65} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 20:02:00,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L797-2-->L797-4: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1881379034 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1881379034 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite28_Out1881379034| ~y$w_buff0~0_In1881379034) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite28_Out1881379034| ~y$w_buff1~0_In1881379034) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1881379034, ~y$w_buff1~0=~y$w_buff1~0_In1881379034, ~y$w_buff0~0=~y$w_buff0~0_In1881379034, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1881379034} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out1881379034|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1881379034, ~y$w_buff1~0=~y$w_buff1~0_In1881379034, ~y$w_buff0~0=~y$w_buff0~0_In1881379034, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1881379034} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 20:02:00,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [912] [912] L797-4-->L798: Formula: (= v_~y~0_64 |v_P2Thread1of1ForFork0_#t~ite28_6|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_6|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_5|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|, ~y~0=v_~y~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-07 20:02:00,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L802-->L803: Formula: (and (= v_~y$r_buff0_thd3~0_173 v_~y$r_buff0_thd3~0_172) (not (= 0 (mod v_~weak$$choice2~0_74 256)))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_173, ~weak$$choice2~0=v_~weak$$choice2~0_74} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_8|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_10|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_172, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_11|, ~weak$$choice2~0=v_~weak$$choice2~0_74} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 20:02:00,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L805-->L805-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1466535092 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite48_Out1466535092| ~y$mem_tmp~0_In1466535092)) (and .cse0 (= ~y~0_In1466535092 |P2Thread1of1ForFork0_#t~ite48_Out1466535092|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1466535092, ~y$flush_delayed~0=~y$flush_delayed~0_In1466535092, ~y~0=~y~0_In1466535092} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out1466535092|, ~y$mem_tmp~0=~y$mem_tmp~0_In1466535092, ~y$flush_delayed~0=~y$flush_delayed~0_In1466535092, ~y~0=~y~0_In1466535092} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 20:02:00,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_11| v_P0Thread1of1ForFork1_~arg.base_9) (= v_~__unbuffered_cnt~0_102 (+ v_~__unbuffered_cnt~0_103 1)) (= v_P0Thread1of1ForFork1_~arg.offset_9 |v_P0Thread1of1ForFork1_#in~arg.offset_11|) (= v_~z~0_15 1) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_~x~0_38 v_~__unbuffered_p0_EAX~0_22) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_38} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, ~z~0=v_~z~0_15, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_38, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_9} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 20:02:00,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L768-->L768-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-476693770 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite25_Out-476693770| ~y$mem_tmp~0_In-476693770)) (and (= |P1Thread1of1ForFork2_#t~ite25_Out-476693770| ~y~0_In-476693770) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-476693770, ~y$flush_delayed~0=~y$flush_delayed~0_In-476693770, ~y~0=~y~0_In-476693770} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-476693770, ~y$flush_delayed~0=~y$flush_delayed~0_In-476693770, ~y~0=~y~0_In-476693770, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-476693770|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 20:02:00,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~y~0_266 |v_P1Thread1of1ForFork2_#t~ite25_114|) (= v_~__unbuffered_cnt~0_136 (+ v_~__unbuffered_cnt~0_137 1)) (= v_~y$flush_delayed~0_286 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_137, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_114|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_286, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_136, ~y~0=v_~y~0_266, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_113|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 20:02:00,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1036713085 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1036713085 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out1036713085|)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1036713085 |P2Thread1of1ForFork0_#t~ite51_Out1036713085|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1036713085, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1036713085} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1036713085, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1036713085, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out1036713085|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 20:02:00,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L814-->L814-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1733356720 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In1733356720 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd3~0_In1733356720 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In1733356720 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite52_Out1733356720| ~y$w_buff1_used~0_In1733356720) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite52_Out1733356720| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1733356720, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1733356720, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1733356720, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1733356720} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1733356720, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1733356720, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1733356720, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out1733356720|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1733356720} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 20:02:00,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L815-->L816: Formula: (let ((.cse0 (= ~y$r_buff0_thd3~0_In-470299863 ~y$r_buff0_thd3~0_Out-470299863)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-470299863 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-470299863 256)))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (not .cse2) (= 0 ~y$r_buff0_thd3~0_Out-470299863) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-470299863, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-470299863} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-470299863, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-470299863, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-470299863|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 20:02:00,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L816-->L816-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In1998178906 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In1998178906 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In1998178906 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1998178906 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite54_Out1998178906|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~y$r_buff1_thd3~0_In1998178906 |P2Thread1of1ForFork0_#t~ite54_Out1998178906|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1998178906, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1998178906, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1998178906, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1998178906} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1998178906, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1998178906, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out1998178906|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1998178906, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1998178906} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 20:02:00,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L816-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= (+ v_~__unbuffered_cnt~0_89 1) v_~__unbuffered_cnt~0_88) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0) (= v_~y$r_buff1_thd3~0_178 |v_P2Thread1of1ForFork0_#t~ite54_30|)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_178, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 20:02:00,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L839-1-->L845: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_58) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 20:02:00,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [945] [945] L845-2-->L845-5: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In52050029 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In52050029 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite59_Out52050029| |ULTIMATE.start_main_#t~ite58_Out52050029|))) (or (and (or .cse0 .cse1) (= ~y~0_In52050029 |ULTIMATE.start_main_#t~ite58_Out52050029|) .cse2) (and (not .cse1) (not .cse0) (= ~y$w_buff1~0_In52050029 |ULTIMATE.start_main_#t~ite58_Out52050029|) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In52050029, ~y~0=~y~0_In52050029, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In52050029, ~y$w_buff1_used~0=~y$w_buff1_used~0_In52050029} OutVars{~y$w_buff1~0=~y$w_buff1~0_In52050029, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out52050029|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out52050029|, ~y~0=~y~0_In52050029, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In52050029, ~y$w_buff1_used~0=~y$w_buff1_used~0_In52050029} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 20:02:00,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L846-->L846-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-510652400 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-510652400 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite60_Out-510652400| 0) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-510652400 |ULTIMATE.start_main_#t~ite60_Out-510652400|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-510652400, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-510652400} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-510652400|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-510652400, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-510652400} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 20:02:00,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L847-->L847-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-545302995 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-545302995 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-545302995 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-545302995 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite61_Out-545302995|)) (and (= ~y$w_buff1_used~0_In-545302995 |ULTIMATE.start_main_#t~ite61_Out-545302995|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-545302995, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-545302995, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-545302995, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-545302995} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-545302995|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-545302995, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-545302995, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-545302995, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-545302995} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 20:02:00,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [963] [963] L848-->L848-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In496658361 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In496658361 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In496658361 |ULTIMATE.start_main_#t~ite62_Out496658361|)) (and (= |ULTIMATE.start_main_#t~ite62_Out496658361| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In496658361, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In496658361} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out496658361|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In496658361, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In496658361} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 20:02:00,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L849-->L849-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In1275084273 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1275084273 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In1275084273 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1275084273 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite63_Out1275084273|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In1275084273 |ULTIMATE.start_main_#t~ite63_Out1275084273|) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1275084273, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1275084273, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1275084273, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1275084273} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1275084273|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1275084273, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1275084273, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1275084273, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1275084273} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 20:02:00,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y$r_buff1_thd0~0_245 |v_ULTIMATE.start_main_#t~ite63_46|) (= v_~main$tmp_guard1~0_20 (ite (= (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_26) (= 1 v_~__unbuffered_p2_EAX~0_21) (= v_~__unbuffered_p1_EBX~0_25 0) (= 1 v_~__unbuffered_p1_EAX~0_47) (= v_~__unbuffered_p2_EBX~0_24 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_46|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_45|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_245, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 20:02:00,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 08:02:00 BasicIcfg [2019-12-07 20:02:00,520 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 20:02:00,520 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 20:02:00,520 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 20:02:00,520 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 20:02:00,521 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:01:21" (3/4) ... [2019-12-07 20:02:00,522 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 20:02:00,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_106| 0 0))) (and (= v_~y$flush_delayed~0_334 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t65~0.base_69| 4) |v_#length_21|) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t65~0.base_69|)) (= v_~y$r_buff0_thd0~0_211 0) (= |v_#NULL.offset_7| 0) (= v_~y$w_buff0_used~0_972 0) (= v_~y$w_buff1~0_277 0) (= v_~y$read_delayed~0_7 0) (= v_~main$tmp_guard1~0_59 0) (= 0 v_~y$r_buff0_thd2~0_408) (= v_~y$r_buff1_thd0~0_314 0) (= v_~y$w_buff1_used~0_548 0) (= 0 |v_ULTIMATE.start_main_~#t65~0.offset_41|) (< 0 |v_#StackHeapBarrier_16|) (= v_~y$r_buff1_thd1~0_221 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t65~0.base_69| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t65~0.base_69|) |v_ULTIMATE.start_main_~#t65~0.offset_41| 0)) |v_#memory_int_19|) (= v_~__unbuffered_cnt~0_149 0) (= v_~y$r_buff0_thd1~0_150 0) (= v_~y$mem_tmp~0_266 0) (= 0 v_~__unbuffered_p0_EAX~0_59) (= v_~y~0_368 0) (= v_~main$tmp_guard0~0_20 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t65~0.base_69|) (= 0 v_~y$r_buff0_thd3~0_638) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 |v_#NULL.base_7|) (= 0 v_~weak$$choice0~0_253) (= v_~z~0_27 0) (= 0 v_~y$w_buff0~0_388) (= 0 v_~__unbuffered_p2_EAX~0_67) (= 0 v_~y$r_buff1_thd3~0_405) (= 0 v_~y$r_buff1_thd2~0_395) (= v_~__unbuffered_p1_EBX~0_68 0) (= v_~weak$$choice2~0_330 0) (= 0 v_~__unbuffered_p1_EAX~0_81) (= |v_#valid_104| (store .cse0 |v_ULTIMATE.start_main_~#t65~0.base_69| 1)) (= v_~__unbuffered_p2_EBX~0_61 0) (= v_~x~0_47 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_106|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_18|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ULTIMATE.start_main_~#t65~0.offset=|v_ULTIMATE.start_main_~#t65~0.offset_41|, #NULL.offset=|v_#NULL.offset_7|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_266, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_59, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_405, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_81, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_150, ~y$flush_delayed~0=v_~y$flush_delayed~0_334, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_67, ULTIMATE.start_main_~#t67~0.offset=|v_ULTIMATE.start_main_~#t67~0.offset_14|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_61, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_54|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_117|, ~weak$$choice0~0=v_~weak$$choice0~0_253, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_~#t65~0.base=|v_ULTIMATE.start_main_~#t65~0.base_69|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_40|, ~y$w_buff1~0=v_~y$w_buff1~0_277, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t66~0.offset=|v_ULTIMATE.start_main_~#t66~0.offset_41|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_408, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_149, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_314, ~x~0=v_~x~0_47, ULTIMATE.start_main_~#t66~0.base=|v_ULTIMATE.start_main_~#t66~0.base_70|, ~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_972, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_59, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_221, ~y$w_buff0~0=v_~y$w_buff0~0_388, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_638, ~y~0=v_~y~0_368, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_68, ULTIMATE.start_main_~#t67~0.base=|v_ULTIMATE.start_main_~#t67~0.base_43|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_74|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_28|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_395, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_478|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_43|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_211, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_330, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t65~0.offset, #NULL.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t67~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_~#t65~0.base, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t66~0.offset, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t66~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t67~0.base, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 20:02:00,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L835-1-->L837: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t66~0.base_12| 4)) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t66~0.base_12|) 0) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t66~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t66~0.base_12|) |v_ULTIMATE.start_main_~#t66~0.offset_10| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t66~0.base_12|)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t66~0.base_12| 1)) (= 0 |v_ULTIMATE.start_main_~#t66~0.offset_10|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t66~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t66~0.base=|v_ULTIMATE.start_main_~#t66~0.base_12|, ULTIMATE.start_main_~#t66~0.offset=|v_ULTIMATE.start_main_~#t66~0.offset_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_4|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t66~0.base, ULTIMATE.start_main_~#t66~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 20:02:00,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L837-1-->L839: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t67~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t67~0.base_11|) |v_ULTIMATE.start_main_~#t67~0.offset_9| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t67~0.base_11|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t67~0.base_11| 4) |v_#length_13|) (not (= |v_ULTIMATE.start_main_~#t67~0.base_11| 0)) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t67~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t67~0.offset_9| 0) (= (select |v_#valid_33| |v_ULTIMATE.start_main_~#t67~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t67~0.offset=|v_ULTIMATE.start_main_~#t67~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t67~0.base=|v_ULTIMATE.start_main_~#t67~0.base_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t67~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t67~0.base, #length] because there is no mapped edge [2019-12-07 20:02:00,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff1_used~0_65 v_~y$w_buff0_used~0_118) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_16)) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_16 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|) (= 1 v_~y$w_buff0~0_43) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_65 256) 0)) (not (= (mod v_~y$w_buff0_used~0_117 256) 0)))) 1 0) |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_16| v_P2Thread1of1ForFork0_~arg.offset_14) (= v_~y$w_buff0_used~0_117 1) (= v_~y$w_buff0~0_44 v_~y$w_buff1~0_29) (= |v_P2Thread1of1ForFork0_#in~arg.base_16| v_P2Thread1of1ForFork0_~arg.base_14)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff0~0=v_~y$w_buff0~0_44, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_16|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_14, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_16|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_43, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_14, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_16|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_16, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_65} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 20:02:00,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L797-2-->L797-4: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1881379034 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1881379034 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite28_Out1881379034| ~y$w_buff0~0_In1881379034) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite28_Out1881379034| ~y$w_buff1~0_In1881379034) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1881379034, ~y$w_buff1~0=~y$w_buff1~0_In1881379034, ~y$w_buff0~0=~y$w_buff0~0_In1881379034, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1881379034} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out1881379034|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1881379034, ~y$w_buff1~0=~y$w_buff1~0_In1881379034, ~y$w_buff0~0=~y$w_buff0~0_In1881379034, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1881379034} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 20:02:00,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [912] [912] L797-4-->L798: Formula: (= v_~y~0_64 |v_P2Thread1of1ForFork0_#t~ite28_6|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_6|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_5|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|, ~y~0=v_~y~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-07 20:02:00,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L802-->L803: Formula: (and (= v_~y$r_buff0_thd3~0_173 v_~y$r_buff0_thd3~0_172) (not (= 0 (mod v_~weak$$choice2~0_74 256)))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_173, ~weak$$choice2~0=v_~weak$$choice2~0_74} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_8|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_10|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_172, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_11|, ~weak$$choice2~0=v_~weak$$choice2~0_74} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 20:02:00,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L805-->L805-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1466535092 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite48_Out1466535092| ~y$mem_tmp~0_In1466535092)) (and .cse0 (= ~y~0_In1466535092 |P2Thread1of1ForFork0_#t~ite48_Out1466535092|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1466535092, ~y$flush_delayed~0=~y$flush_delayed~0_In1466535092, ~y~0=~y~0_In1466535092} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out1466535092|, ~y$mem_tmp~0=~y$mem_tmp~0_In1466535092, ~y$flush_delayed~0=~y$flush_delayed~0_In1466535092, ~y~0=~y~0_In1466535092} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 20:02:00,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_11| v_P0Thread1of1ForFork1_~arg.base_9) (= v_~__unbuffered_cnt~0_102 (+ v_~__unbuffered_cnt~0_103 1)) (= v_P0Thread1of1ForFork1_~arg.offset_9 |v_P0Thread1of1ForFork1_#in~arg.offset_11|) (= v_~z~0_15 1) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_~x~0_38 v_~__unbuffered_p0_EAX~0_22) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_38} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, ~z~0=v_~z~0_15, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_38, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_9} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 20:02:00,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L768-->L768-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-476693770 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite25_Out-476693770| ~y$mem_tmp~0_In-476693770)) (and (= |P1Thread1of1ForFork2_#t~ite25_Out-476693770| ~y~0_In-476693770) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-476693770, ~y$flush_delayed~0=~y$flush_delayed~0_In-476693770, ~y~0=~y~0_In-476693770} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-476693770, ~y$flush_delayed~0=~y$flush_delayed~0_In-476693770, ~y~0=~y~0_In-476693770, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-476693770|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 20:02:00,534 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~y~0_266 |v_P1Thread1of1ForFork2_#t~ite25_114|) (= v_~__unbuffered_cnt~0_136 (+ v_~__unbuffered_cnt~0_137 1)) (= v_~y$flush_delayed~0_286 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_137, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_114|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_286, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_136, ~y~0=v_~y~0_266, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_113|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 20:02:00,534 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1036713085 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1036713085 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out1036713085|)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1036713085 |P2Thread1of1ForFork0_#t~ite51_Out1036713085|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1036713085, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1036713085} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1036713085, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1036713085, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out1036713085|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 20:02:00,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L814-->L814-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1733356720 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In1733356720 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd3~0_In1733356720 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In1733356720 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite52_Out1733356720| ~y$w_buff1_used~0_In1733356720) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite52_Out1733356720| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1733356720, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1733356720, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1733356720, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1733356720} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1733356720, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1733356720, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1733356720, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out1733356720|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1733356720} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 20:02:00,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L815-->L816: Formula: (let ((.cse0 (= ~y$r_buff0_thd3~0_In-470299863 ~y$r_buff0_thd3~0_Out-470299863)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-470299863 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-470299863 256)))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (not .cse2) (= 0 ~y$r_buff0_thd3~0_Out-470299863) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-470299863, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-470299863} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-470299863, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-470299863, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-470299863|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 20:02:00,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L816-->L816-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In1998178906 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In1998178906 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In1998178906 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1998178906 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite54_Out1998178906|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~y$r_buff1_thd3~0_In1998178906 |P2Thread1of1ForFork0_#t~ite54_Out1998178906|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1998178906, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1998178906, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1998178906, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1998178906} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1998178906, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1998178906, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out1998178906|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1998178906, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1998178906} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 20:02:00,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L816-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= (+ v_~__unbuffered_cnt~0_89 1) v_~__unbuffered_cnt~0_88) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0) (= v_~y$r_buff1_thd3~0_178 |v_P2Thread1of1ForFork0_#t~ite54_30|)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_178, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 20:02:00,536 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L839-1-->L845: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_58) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 20:02:00,536 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [945] [945] L845-2-->L845-5: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In52050029 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In52050029 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite59_Out52050029| |ULTIMATE.start_main_#t~ite58_Out52050029|))) (or (and (or .cse0 .cse1) (= ~y~0_In52050029 |ULTIMATE.start_main_#t~ite58_Out52050029|) .cse2) (and (not .cse1) (not .cse0) (= ~y$w_buff1~0_In52050029 |ULTIMATE.start_main_#t~ite58_Out52050029|) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In52050029, ~y~0=~y~0_In52050029, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In52050029, ~y$w_buff1_used~0=~y$w_buff1_used~0_In52050029} OutVars{~y$w_buff1~0=~y$w_buff1~0_In52050029, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out52050029|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out52050029|, ~y~0=~y~0_In52050029, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In52050029, ~y$w_buff1_used~0=~y$w_buff1_used~0_In52050029} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 20:02:00,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L846-->L846-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-510652400 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-510652400 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite60_Out-510652400| 0) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-510652400 |ULTIMATE.start_main_#t~ite60_Out-510652400|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-510652400, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-510652400} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-510652400|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-510652400, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-510652400} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 20:02:00,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L847-->L847-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-545302995 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-545302995 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-545302995 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-545302995 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite61_Out-545302995|)) (and (= ~y$w_buff1_used~0_In-545302995 |ULTIMATE.start_main_#t~ite61_Out-545302995|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-545302995, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-545302995, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-545302995, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-545302995} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-545302995|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-545302995, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-545302995, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-545302995, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-545302995} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 20:02:00,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [963] [963] L848-->L848-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In496658361 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In496658361 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In496658361 |ULTIMATE.start_main_#t~ite62_Out496658361|)) (and (= |ULTIMATE.start_main_#t~ite62_Out496658361| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In496658361, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In496658361} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out496658361|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In496658361, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In496658361} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 20:02:00,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L849-->L849-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In1275084273 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1275084273 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In1275084273 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1275084273 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite63_Out1275084273|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In1275084273 |ULTIMATE.start_main_#t~ite63_Out1275084273|) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1275084273, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1275084273, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1275084273, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1275084273} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1275084273|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1275084273, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1275084273, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1275084273, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1275084273} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 20:02:00,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y$r_buff1_thd0~0_245 |v_ULTIMATE.start_main_#t~ite63_46|) (= v_~main$tmp_guard1~0_20 (ite (= (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_26) (= 1 v_~__unbuffered_p2_EAX~0_21) (= v_~__unbuffered_p1_EBX~0_25 0) (= 1 v_~__unbuffered_p1_EAX~0_47) (= v_~__unbuffered_p2_EBX~0_24 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_46|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_45|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_245, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 20:02:00,599 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_5e18d660-d8a9-4223-8c6b-9204ed560cbb/bin/utaipan/witness.graphml [2019-12-07 20:02:00,599 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 20:02:00,600 INFO L168 Benchmark]: Toolchain (without parser) took 40193.49 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 938.8 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. [2019-12-07 20:02:00,600 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 960.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:02:00,601 INFO L168 Benchmark]: CACSL2BoogieTranslator took 390.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 938.8 MB in the beginning and 1.1 GB in the end (delta: -127.2 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2019-12-07 20:02:00,601 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.99 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:02:00,601 INFO L168 Benchmark]: Boogie Preprocessor took 27.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:02:00,601 INFO L168 Benchmark]: RCFGBuilder took 453.15 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: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. [2019-12-07 20:02:00,602 INFO L168 Benchmark]: TraceAbstraction took 39197.98 ms. Allocated memory was 1.1 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2019-12-07 20:02:00,602 INFO L168 Benchmark]: Witness Printer took 78.92 ms. Allocated memory is still 5.0 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:02:00,603 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 960.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 390.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 938.8 MB in the beginning and 1.1 GB in the end (delta: -127.2 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.99 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 27.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 453.15 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: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 39197.98 ms. Allocated memory was 1.1 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. * Witness Printer took 78.92 ms. Allocated memory is still 5.0 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 196 ProgramPointsBefore, 105 ProgramPointsAfterwards, 242 TransitionsBefore, 127 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 52 ConcurrentYvCompositions, 28 ChoiceCompositions, 9301 VarBasedMoverChecksPositive, 327 VarBasedMoverChecksNegative, 92 SemBasedMoverChecksPositive, 328 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 123368 CheckedPairsTotal, 129 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t65, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L837] FCALL, FORK 0 pthread_create(&t66, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t67, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L787] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L788] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L789] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L790] 3 y$r_buff0_thd3 = (_Bool)1 [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 y$flush_delayed = weak$$choice2 [L796] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L797] 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L799] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L799] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L800] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L800] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L801] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L801] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L805] 3 y = y$flush_delayed ? y$mem_tmp : y [L806] 3 y$flush_delayed = (_Bool)0 [L809] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L750] 2 x = 1 [L753] 2 __unbuffered_p1_EAX = x [L756] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 2 y$flush_delayed = weak$$choice2 [L759] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 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) [L761] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 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)) [L762] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 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)) [L763] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 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)) [L764] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 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)) [L765] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 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)) [L766] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 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)) [L767] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L814] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L845] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L845] 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) [L846] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L847] 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 [L848] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 187 locations, 2 error locations. Result: UNSAFE, OverallTime: 39.0s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5870 SDtfs, 7928 SDslu, 15503 SDs, 0 SdLazy, 5561 SolverSat, 324 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 223 GetRequests, 35 SyntacticMatches, 10 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68490occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 19.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 125134 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 815 NumberOfCodeBlocks, 815 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 730 ConstructedInterpolants, 0 QuantifiedInterpolants, 264382 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...