./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix032_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f39026c9-14f6-4ffc-ba83-b458e74d0a63/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f39026c9-14f6-4ffc-ba83-b458e74d0a63/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f39026c9-14f6-4ffc-ba83-b458e74d0a63/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f39026c9-14f6-4ffc-ba83-b458e74d0a63/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix032_power.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_f39026c9-14f6-4ffc-ba83-b458e74d0a63/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f39026c9-14f6-4ffc-ba83-b458e74d0a63/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 27a332b61d5f66b14b3f326393227d79560650d5 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:02:06,047 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:02:06,048 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:02:06,056 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:02:06,056 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:02:06,057 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:02:06,058 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:02:06,059 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:02:06,060 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:02:06,061 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:02:06,061 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:02:06,062 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:02:06,063 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:02:06,063 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:02:06,064 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:02:06,065 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:02:06,065 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:02:06,066 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:02:06,067 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:02:06,069 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:02:06,070 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:02:06,070 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:02:06,071 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:02:06,072 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:02:06,073 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:02:06,074 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:02:06,074 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:02:06,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:02:06,075 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:02:06,075 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:02:06,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:02:06,076 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:02:06,076 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:02:06,077 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:02:06,077 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:02:06,077 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:02:06,078 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:02:06,078 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:02:06,078 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:02:06,079 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:02:06,079 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:02:06,079 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f39026c9-14f6-4ffc-ba83-b458e74d0a63/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 20:02:06,089 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:02:06,090 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:02:06,090 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:02:06,090 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:02:06,091 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:02:06,091 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:02:06,091 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 20:02:06,091 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:02:06,091 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:02:06,091 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 20:02:06,091 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 20:02:06,092 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:02:06,092 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 20:02:06,092 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 20:02:06,092 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 20:02:06,093 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:02:06,093 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:02:06,093 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:02:06,093 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:02:06,093 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:02:06,093 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 20:02:06,093 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:02:06,093 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 20:02:06,094 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:02:06,094 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:02:06,094 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 20:02:06,094 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:02:06,094 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 20:02:06,094 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:02:06,094 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:02:06,094 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:02:06,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:02:06,095 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:02:06,095 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:02:06,095 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 20:02:06,095 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 20:02:06,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 20:02:06,095 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 20:02:06,096 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:02:06,096 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:02:06,096 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_f39026c9-14f6-4ffc-ba83-b458e74d0a63/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 -> 27a332b61d5f66b14b3f326393227d79560650d5 [2019-12-07 20:02:06,196 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:02:06,203 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:02:06,206 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:02:06,207 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:02:06,207 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:02:06,207 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f39026c9-14f6-4ffc-ba83-b458e74d0a63/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix032_power.oepc.i [2019-12-07 20:02:06,244 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f39026c9-14f6-4ffc-ba83-b458e74d0a63/bin/utaipan/data/48b211580/a0a7dcd6a947419083c2a8b88a9b9f21/FLAG688a146ef [2019-12-07 20:02:06,686 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:02:06,686 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f39026c9-14f6-4ffc-ba83-b458e74d0a63/sv-benchmarks/c/pthread-wmm/mix032_power.oepc.i [2019-12-07 20:02:06,696 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f39026c9-14f6-4ffc-ba83-b458e74d0a63/bin/utaipan/data/48b211580/a0a7dcd6a947419083c2a8b88a9b9f21/FLAG688a146ef [2019-12-07 20:02:06,704 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f39026c9-14f6-4ffc-ba83-b458e74d0a63/bin/utaipan/data/48b211580/a0a7dcd6a947419083c2a8b88a9b9f21 [2019-12-07 20:02:06,706 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:02:06,707 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:02:06,708 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:02:06,708 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:02:06,710 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:02:06,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:02:06" (1/1) ... [2019-12-07 20:02:06,712 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25138a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:02:06, skipping insertion in model container [2019-12-07 20:02:06,712 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:02:06" (1/1) ... [2019-12-07 20:02:06,717 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:02:06,745 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:02:06,988 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:02:06,996 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:02:07,040 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:02:07,086 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:02:07,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:02:07 WrapperNode [2019-12-07 20:02:07,087 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:02:07,087 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:02:07,088 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:02:07,088 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:02:07,093 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:02:07" (1/1) ... [2019-12-07 20:02:07,106 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:02:07" (1/1) ... [2019-12-07 20:02:07,125 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:02:07,125 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:02:07,125 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:02:07,125 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:02:07,132 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:02:07" (1/1) ... [2019-12-07 20:02:07,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:02:07" (1/1) ... [2019-12-07 20:02:07,135 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:02:07" (1/1) ... [2019-12-07 20:02:07,135 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:02:07" (1/1) ... [2019-12-07 20:02:07,143 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:02:07" (1/1) ... [2019-12-07 20:02:07,145 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:02:07" (1/1) ... [2019-12-07 20:02:07,148 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:02:07" (1/1) ... [2019-12-07 20:02:07,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:02:07,151 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:02:07,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:02:07,151 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:02:07,152 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:02:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f39026c9-14f6-4ffc-ba83-b458e74d0a63/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:02:07,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 20:02:07,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 20:02:07,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 20:02:07,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 20:02:07,194 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 20:02:07,194 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 20:02:07,194 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 20:02:07,194 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 20:02:07,195 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 20:02:07,195 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 20:02:07,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 20:02:07,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:02:07,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:02:07,196 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:02:07,564 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:02:07,564 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 20:02:07,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:02:07 BoogieIcfgContainer [2019-12-07 20:02:07,565 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:02:07,566 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:02:07,566 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:02:07,568 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:02:07,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:02:06" (1/3) ... [2019-12-07 20:02:07,569 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e6c36ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:02:07, skipping insertion in model container [2019-12-07 20:02:07,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:02:07" (2/3) ... [2019-12-07 20:02:07,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e6c36ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:02:07, skipping insertion in model container [2019-12-07 20:02:07,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:02:07" (3/3) ... [2019-12-07 20:02:07,571 INFO L109 eAbstractionObserver]: Analyzing ICFG mix032_power.oepc.i [2019-12-07 20:02:07,580 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 20:02:07,580 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:02:07,586 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 20:02:07,587 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 20:02:07,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,620 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,620 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,620 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,621 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,621 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,626 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,626 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,632 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,632 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:02:07,667 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 20:02:07,679 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:02:07,679 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 20:02:07,679 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:02:07,679 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:02:07,679 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:02:07,679 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:02:07,680 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:02:07,680 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:02:07,690 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 217 transitions [2019-12-07 20:02:07,691 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-07 20:02:07,754 INFO L134 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-07 20:02:07,754 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 20:02:07,764 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 702 event pairs. 9/174 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 20:02:07,780 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-07 20:02:07,811 INFO L134 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-07 20:02:07,811 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 20:02:07,817 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 702 event pairs. 9/174 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 20:02:07,832 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-07 20:02:07,833 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 20:02:10,776 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-12-07 20:02:10,975 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-07 20:02:11,094 INFO L206 etLargeBlockEncoding]: Checked pairs total: 83556 [2019-12-07 20:02:11,094 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-07 20:02:11,097 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 105 transitions [2019-12-07 20:02:28,969 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129602 states. [2019-12-07 20:02:28,971 INFO L276 IsEmpty]: Start isEmpty. Operand 129602 states. [2019-12-07 20:02:28,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 20:02:28,974 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:02:28,975 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 20:02:28,975 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:02:28,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:02:28,979 INFO L82 PathProgramCache]: Analyzing trace with hash 923865, now seen corresponding path program 1 times [2019-12-07 20:02:28,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:02:28,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171075262] [2019-12-07 20:02:28,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:02:29,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:02:29,114 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:29,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171075262] [2019-12-07 20:02:29,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:02:29,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 20:02:29,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596506913] [2019-12-07 20:02:29,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:02:29,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:02:29,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:02:29,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:02:29,131 INFO L87 Difference]: Start difference. First operand 129602 states. Second operand 3 states. [2019-12-07 20:02:30,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:02:30,007 INFO L93 Difference]: Finished difference Result 128376 states and 546782 transitions. [2019-12-07 20:02:30,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:02:30,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 20:02:30,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:02:30,525 INFO L225 Difference]: With dead ends: 128376 [2019-12-07 20:02:30,525 INFO L226 Difference]: Without dead ends: 120914 [2019-12-07 20:02:30,526 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:02:37,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120914 states. [2019-12-07 20:02:38,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120914 to 120914. [2019-12-07 20:02:38,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120914 states. [2019-12-07 20:02:39,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120914 states to 120914 states and 514358 transitions. [2019-12-07 20:02:39,481 INFO L78 Accepts]: Start accepts. Automaton has 120914 states and 514358 transitions. Word has length 3 [2019-12-07 20:02:39,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:02:39,481 INFO L462 AbstractCegarLoop]: Abstraction has 120914 states and 514358 transitions. [2019-12-07 20:02:39,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:02:39,481 INFO L276 IsEmpty]: Start isEmpty. Operand 120914 states and 514358 transitions. [2019-12-07 20:02:39,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 20:02:39,484 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:02:39,484 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:02:39,485 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:02:39,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:02:39,485 INFO L82 PathProgramCache]: Analyzing trace with hash 2102120012, now seen corresponding path program 1 times [2019-12-07 20:02:39,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:02:39,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968472370] [2019-12-07 20:02:39,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:02:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:02:39,548 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:39,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968472370] [2019-12-07 20:02:39,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:02:39,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:02:39,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665298543] [2019-12-07 20:02:39,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:02:39,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:02:39,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:02:39,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:02:39,550 INFO L87 Difference]: Start difference. First operand 120914 states and 514358 transitions. Second operand 4 states. [2019-12-07 20:02:40,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:02:40,516 INFO L93 Difference]: Finished difference Result 187704 states and 768206 transitions. [2019-12-07 20:02:40,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:02:40,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 20:02:40,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:02:41,010 INFO L225 Difference]: With dead ends: 187704 [2019-12-07 20:02:41,010 INFO L226 Difference]: Without dead ends: 187655 [2019-12-07 20:02:41,011 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:49,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187655 states. [2019-12-07 20:02:51,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187655 to 171775. [2019-12-07 20:02:51,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171775 states. [2019-12-07 20:02:52,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171775 states to 171775 states and 711726 transitions. [2019-12-07 20:02:52,330 INFO L78 Accepts]: Start accepts. Automaton has 171775 states and 711726 transitions. Word has length 11 [2019-12-07 20:02:52,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:02:52,330 INFO L462 AbstractCegarLoop]: Abstraction has 171775 states and 711726 transitions. [2019-12-07 20:02:52,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:02:52,330 INFO L276 IsEmpty]: Start isEmpty. Operand 171775 states and 711726 transitions. [2019-12-07 20:02:52,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 20:02:52,334 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:02:52,334 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:02:52,334 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:02:52,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:02:52,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1617299066, now seen corresponding path program 1 times [2019-12-07 20:02:52,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:02:52,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468184731] [2019-12-07 20:02:52,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:02:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:02:52,384 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:52,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468184731] [2019-12-07 20:02:52,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:02:52,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:02:52,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211977568] [2019-12-07 20:02:52,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:02:52,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:02:52,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:02:52,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:02:52,386 INFO L87 Difference]: Start difference. First operand 171775 states and 711726 transitions. Second operand 4 states. [2019-12-07 20:02:53,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:02:53,998 INFO L93 Difference]: Finished difference Result 242262 states and 982161 transitions. [2019-12-07 20:02:53,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:02:53,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 20:02:53,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:02:54,614 INFO L225 Difference]: With dead ends: 242262 [2019-12-07 20:02:54,615 INFO L226 Difference]: Without dead ends: 242206 [2019-12-07 20:02:54,615 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:03:04,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242206 states. [2019-12-07 20:03:06,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242206 to 205026. [2019-12-07 20:03:06,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205026 states. [2019-12-07 20:03:07,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205026 states to 205026 states and 845145 transitions. [2019-12-07 20:03:07,508 INFO L78 Accepts]: Start accepts. Automaton has 205026 states and 845145 transitions. Word has length 13 [2019-12-07 20:03:07,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:03:07,509 INFO L462 AbstractCegarLoop]: Abstraction has 205026 states and 845145 transitions. [2019-12-07 20:03:07,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:03:07,509 INFO L276 IsEmpty]: Start isEmpty. Operand 205026 states and 845145 transitions. [2019-12-07 20:03:07,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 20:03:07,517 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:03:07,517 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:03:07,517 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:03:07,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:03:07,518 INFO L82 PathProgramCache]: Analyzing trace with hash 947448332, now seen corresponding path program 1 times [2019-12-07 20:03:07,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:03:07,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634241620] [2019-12-07 20:03:07,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:03:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:03:07,571 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:03:07,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634241620] [2019-12-07 20:03:07,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:03:07,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:03:07,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387684194] [2019-12-07 20:03:07,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:03:07,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:03:07,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:03:07,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:03:07,572 INFO L87 Difference]: Start difference. First operand 205026 states and 845145 transitions. Second operand 5 states. [2019-12-07 20:03:09,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:03:09,412 INFO L93 Difference]: Finished difference Result 278815 states and 1138912 transitions. [2019-12-07 20:03:09,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 20:03:09,413 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 20:03:09,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:03:10,122 INFO L225 Difference]: With dead ends: 278815 [2019-12-07 20:03:10,122 INFO L226 Difference]: Without dead ends: 278815 [2019-12-07 20:03:10,123 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:03:17,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278815 states. [2019-12-07 20:03:23,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278815 to 233994. [2019-12-07 20:03:23,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233994 states. [2019-12-07 20:03:24,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233994 states to 233994 states and 963338 transitions. [2019-12-07 20:03:24,834 INFO L78 Accepts]: Start accepts. Automaton has 233994 states and 963338 transitions. Word has length 16 [2019-12-07 20:03:24,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:03:24,834 INFO L462 AbstractCegarLoop]: Abstraction has 233994 states and 963338 transitions. [2019-12-07 20:03:24,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:03:24,834 INFO L276 IsEmpty]: Start isEmpty. Operand 233994 states and 963338 transitions. [2019-12-07 20:03:24,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 20:03:24,848 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:03:24,848 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:03:24,848 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:03:24,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:03:24,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1320991791, now seen corresponding path program 1 times [2019-12-07 20:03:24,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:03:24,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456610381] [2019-12-07 20:03:24,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:03:24,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:03:24,894 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:03:24,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456610381] [2019-12-07 20:03:24,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:03:24,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:03:24,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399480111] [2019-12-07 20:03:24,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:03:24,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:03:24,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:03:24,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:03:24,895 INFO L87 Difference]: Start difference. First operand 233994 states and 963338 transitions. Second operand 3 states. [2019-12-07 20:03:25,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:03:25,867 INFO L93 Difference]: Finished difference Result 220624 states and 898795 transitions. [2019-12-07 20:03:25,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:03:25,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 20:03:25,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:03:26,452 INFO L225 Difference]: With dead ends: 220624 [2019-12-07 20:03:26,452 INFO L226 Difference]: Without dead ends: 220624 [2019-12-07 20:03:26,452 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:03:32,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220624 states. [2019-12-07 20:03:36,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220624 to 217410. [2019-12-07 20:03:36,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217410 states. [2019-12-07 20:03:36,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217410 states to 217410 states and 886869 transitions. [2019-12-07 20:03:36,902 INFO L78 Accepts]: Start accepts. Automaton has 217410 states and 886869 transitions. Word has length 18 [2019-12-07 20:03:36,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:03:36,902 INFO L462 AbstractCegarLoop]: Abstraction has 217410 states and 886869 transitions. [2019-12-07 20:03:36,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:03:36,902 INFO L276 IsEmpty]: Start isEmpty. Operand 217410 states and 886869 transitions. [2019-12-07 20:03:36,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 20:03:36,913 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:03:36,913 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:03:36,913 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:03:36,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:03:36,913 INFO L82 PathProgramCache]: Analyzing trace with hash 24190388, now seen corresponding path program 1 times [2019-12-07 20:03:36,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:03:36,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781498878] [2019-12-07 20:03:36,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:03:36,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:03:36,955 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:03:36,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781498878] [2019-12-07 20:03:36,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:03:36,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:03:36,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119309907] [2019-12-07 20:03:36,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:03:36,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:03:36,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:03:36,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:03:36,957 INFO L87 Difference]: Start difference. First operand 217410 states and 886869 transitions. Second operand 3 states. [2019-12-07 20:03:37,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:03:37,075 INFO L93 Difference]: Finished difference Result 39275 states and 126331 transitions. [2019-12-07 20:03:37,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:03:37,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 20:03:37,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:03:37,133 INFO L225 Difference]: With dead ends: 39275 [2019-12-07 20:03:37,133 INFO L226 Difference]: Without dead ends: 39275 [2019-12-07 20:03:37,133 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:03:37,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39275 states. [2019-12-07 20:03:39,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39275 to 39275. [2019-12-07 20:03:39,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39275 states. [2019-12-07 20:03:39,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39275 states to 39275 states and 126331 transitions. [2019-12-07 20:03:39,746 INFO L78 Accepts]: Start accepts. Automaton has 39275 states and 126331 transitions. Word has length 18 [2019-12-07 20:03:39,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:03:39,747 INFO L462 AbstractCegarLoop]: Abstraction has 39275 states and 126331 transitions. [2019-12-07 20:03:39,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:03:39,747 INFO L276 IsEmpty]: Start isEmpty. Operand 39275 states and 126331 transitions. [2019-12-07 20:03:39,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 20:03:39,751 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:03:39,751 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:03:39,751 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:03:39,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:03:39,751 INFO L82 PathProgramCache]: Analyzing trace with hash -282717849, now seen corresponding path program 1 times [2019-12-07 20:03:39,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:03:39,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413144651] [2019-12-07 20:03:39,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:03:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:03:39,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:03:39,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413144651] [2019-12-07 20:03:39,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:03:39,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:03:39,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813702350] [2019-12-07 20:03:39,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:03:39,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:03:39,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:03:39,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:03:39,807 INFO L87 Difference]: Start difference. First operand 39275 states and 126331 transitions. Second operand 6 states. [2019-12-07 20:03:40,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:03:40,433 INFO L93 Difference]: Finished difference Result 59427 states and 186833 transitions. [2019-12-07 20:03:40,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 20:03:40,433 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 20:03:40,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:03:40,518 INFO L225 Difference]: With dead ends: 59427 [2019-12-07 20:03:40,518 INFO L226 Difference]: Without dead ends: 59420 [2019-12-07 20:03:40,519 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 20:03:40,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59420 states. [2019-12-07 20:03:41,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59420 to 39235. [2019-12-07 20:03:41,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39235 states. [2019-12-07 20:03:41,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39235 states to 39235 states and 125505 transitions. [2019-12-07 20:03:41,298 INFO L78 Accepts]: Start accepts. Automaton has 39235 states and 125505 transitions. Word has length 22 [2019-12-07 20:03:41,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:03:41,298 INFO L462 AbstractCegarLoop]: Abstraction has 39235 states and 125505 transitions. [2019-12-07 20:03:41,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:03:41,298 INFO L276 IsEmpty]: Start isEmpty. Operand 39235 states and 125505 transitions. [2019-12-07 20:03:41,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 20:03:41,306 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:03:41,306 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:03:41,306 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:03:41,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:03:41,306 INFO L82 PathProgramCache]: Analyzing trace with hash -71664384, now seen corresponding path program 1 times [2019-12-07 20:03:41,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:03:41,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130211221] [2019-12-07 20:03:41,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:03:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:03:41,354 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:03:41,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130211221] [2019-12-07 20:03:41,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:03:41,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:03:41,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603269128] [2019-12-07 20:03:41,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:03:41,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:03:41,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:03:41,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:03:41,356 INFO L87 Difference]: Start difference. First operand 39235 states and 125505 transitions. Second operand 5 states. [2019-12-07 20:03:41,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:03:41,747 INFO L93 Difference]: Finished difference Result 55542 states and 174417 transitions. [2019-12-07 20:03:41,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 20:03:41,747 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 20:03:41,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:03:41,828 INFO L225 Difference]: With dead ends: 55542 [2019-12-07 20:03:41,828 INFO L226 Difference]: Without dead ends: 55529 [2019-12-07 20:03:41,829 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:03:42,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55529 states. [2019-12-07 20:03:42,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55529 to 47173. [2019-12-07 20:03:42,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47173 states. [2019-12-07 20:03:42,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47173 states to 47173 states and 150323 transitions. [2019-12-07 20:03:42,699 INFO L78 Accepts]: Start accepts. Automaton has 47173 states and 150323 transitions. Word has length 25 [2019-12-07 20:03:42,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:03:42,699 INFO L462 AbstractCegarLoop]: Abstraction has 47173 states and 150323 transitions. [2019-12-07 20:03:42,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:03:42,700 INFO L276 IsEmpty]: Start isEmpty. Operand 47173 states and 150323 transitions. [2019-12-07 20:03:42,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 20:03:42,711 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:03:42,712 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:03:42,712 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:03:42,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:03:42,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1418175430, now seen corresponding path program 1 times [2019-12-07 20:03:42,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:03:42,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159645263] [2019-12-07 20:03:42,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:03:42,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:03:42,733 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:03:42,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159645263] [2019-12-07 20:03:42,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:03:42,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:03:42,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545733936] [2019-12-07 20:03:42,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:03:42,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:03:42,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:03:42,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:03:42,734 INFO L87 Difference]: Start difference. First operand 47173 states and 150323 transitions. Second operand 3 states. [2019-12-07 20:03:42,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:03:42,926 INFO L93 Difference]: Finished difference Result 67630 states and 212546 transitions. [2019-12-07 20:03:42,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:03:42,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 20:03:42,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:03:43,022 INFO L225 Difference]: With dead ends: 67630 [2019-12-07 20:03:43,022 INFO L226 Difference]: Without dead ends: 67630 [2019-12-07 20:03:43,022 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:03:43,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67630 states. [2019-12-07 20:03:43,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67630 to 52544. [2019-12-07 20:03:43,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52544 states. [2019-12-07 20:03:44,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52544 states to 52544 states and 165778 transitions. [2019-12-07 20:03:44,002 INFO L78 Accepts]: Start accepts. Automaton has 52544 states and 165778 transitions. Word has length 27 [2019-12-07 20:03:44,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:03:44,002 INFO L462 AbstractCegarLoop]: Abstraction has 52544 states and 165778 transitions. [2019-12-07 20:03:44,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:03:44,002 INFO L276 IsEmpty]: Start isEmpty. Operand 52544 states and 165778 transitions. [2019-12-07 20:03:44,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 20:03:44,017 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:03:44,017 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:03:44,017 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:03:44,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:03:44,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1834697800, now seen corresponding path program 1 times [2019-12-07 20:03:44,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:03:44,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532773153] [2019-12-07 20:03:44,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:03:44,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:03:44,061 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:03:44,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532773153] [2019-12-07 20:03:44,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:03:44,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:03:44,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907230145] [2019-12-07 20:03:44,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:03:44,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:03:44,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:03:44,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:03:44,062 INFO L87 Difference]: Start difference. First operand 52544 states and 165778 transitions. Second operand 6 states. [2019-12-07 20:03:44,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:03:44,592 INFO L93 Difference]: Finished difference Result 73956 states and 228925 transitions. [2019-12-07 20:03:44,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 20:03:44,593 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-07 20:03:44,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:03:44,702 INFO L225 Difference]: With dead ends: 73956 [2019-12-07 20:03:44,703 INFO L226 Difference]: Without dead ends: 73914 [2019-12-07 20:03:44,703 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 20:03:45,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73914 states. [2019-12-07 20:03:45,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73914 to 54503. [2019-12-07 20:03:45,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54503 states. [2019-12-07 20:03:45,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54503 states to 54503 states and 171706 transitions. [2019-12-07 20:03:45,757 INFO L78 Accepts]: Start accepts. Automaton has 54503 states and 171706 transitions. Word has length 27 [2019-12-07 20:03:45,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:03:45,757 INFO L462 AbstractCegarLoop]: Abstraction has 54503 states and 171706 transitions. [2019-12-07 20:03:45,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:03:45,758 INFO L276 IsEmpty]: Start isEmpty. Operand 54503 states and 171706 transitions. [2019-12-07 20:03:45,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 20:03:45,778 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:03:45,778 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:03:45,779 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:03:45,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:03:45,779 INFO L82 PathProgramCache]: Analyzing trace with hash -197713206, now seen corresponding path program 1 times [2019-12-07 20:03:45,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:03:45,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260195215] [2019-12-07 20:03:45,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:03:45,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:03:45,818 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:03:45,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260195215] [2019-12-07 20:03:45,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:03:45,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:03:45,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425028800] [2019-12-07 20:03:45,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:03:45,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:03:45,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:03:45,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:03:45,820 INFO L87 Difference]: Start difference. First operand 54503 states and 171706 transitions. Second operand 4 states. [2019-12-07 20:03:45,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:03:45,890 INFO L93 Difference]: Finished difference Result 21175 states and 63903 transitions. [2019-12-07 20:03:45,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:03:45,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-12-07 20:03:45,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:03:45,912 INFO L225 Difference]: With dead ends: 21175 [2019-12-07 20:03:45,913 INFO L226 Difference]: Without dead ends: 21175 [2019-12-07 20:03:45,913 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:03:45,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21175 states. [2019-12-07 20:03:46,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21175 to 19838. [2019-12-07 20:03:46,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19838 states. [2019-12-07 20:03:46,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19838 states to 19838 states and 59880 transitions. [2019-12-07 20:03:46,198 INFO L78 Accepts]: Start accepts. Automaton has 19838 states and 59880 transitions. Word has length 29 [2019-12-07 20:03:46,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:03:46,198 INFO L462 AbstractCegarLoop]: Abstraction has 19838 states and 59880 transitions. [2019-12-07 20:03:46,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:03:46,199 INFO L276 IsEmpty]: Start isEmpty. Operand 19838 states and 59880 transitions. [2019-12-07 20:03:46,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 20:03:46,214 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:03:46,214 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:03:46,214 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:03:46,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:03:46,214 INFO L82 PathProgramCache]: Analyzing trace with hash -2065332723, now seen corresponding path program 1 times [2019-12-07 20:03:46,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:03:46,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197847352] [2019-12-07 20:03:46,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:03:46,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:03:46,269 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:03:46,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197847352] [2019-12-07 20:03:46,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:03:46,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:03:46,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129740819] [2019-12-07 20:03:46,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 20:03:46,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:03:46,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 20:03:46,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:03:46,270 INFO L87 Difference]: Start difference. First operand 19838 states and 59880 transitions. Second operand 7 states. [2019-12-07 20:03:46,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:03:46,913 INFO L93 Difference]: Finished difference Result 27351 states and 80470 transitions. [2019-12-07 20:03:46,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 20:03:46,913 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-07 20:03:46,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:03:46,942 INFO L225 Difference]: With dead ends: 27351 [2019-12-07 20:03:46,942 INFO L226 Difference]: Without dead ends: 27351 [2019-12-07 20:03:46,943 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-07 20:03:47,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27351 states. [2019-12-07 20:03:47,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27351 to 19289. [2019-12-07 20:03:47,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19289 states. [2019-12-07 20:03:47,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19289 states to 19289 states and 58283 transitions. [2019-12-07 20:03:47,267 INFO L78 Accepts]: Start accepts. Automaton has 19289 states and 58283 transitions. Word has length 33 [2019-12-07 20:03:47,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:03:47,268 INFO L462 AbstractCegarLoop]: Abstraction has 19289 states and 58283 transitions. [2019-12-07 20:03:47,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 20:03:47,268 INFO L276 IsEmpty]: Start isEmpty. Operand 19289 states and 58283 transitions. [2019-12-07 20:03:47,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 20:03:47,283 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:03:47,283 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] [2019-12-07 20:03:47,283 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:03:47,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:03:47,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1854368583, now seen corresponding path program 1 times [2019-12-07 20:03:47,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:03:47,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028685891] [2019-12-07 20:03:47,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:03:47,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:03:47,310 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:03:47,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028685891] [2019-12-07 20:03:47,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:03:47,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:03:47,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077812885] [2019-12-07 20:03:47,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:03:47,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:03:47,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:03:47,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:03:47,311 INFO L87 Difference]: Start difference. First operand 19289 states and 58283 transitions. Second operand 3 states. [2019-12-07 20:03:47,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:03:47,361 INFO L93 Difference]: Finished difference Result 18421 states and 54862 transitions. [2019-12-07 20:03:47,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:03:47,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-07 20:03:47,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:03:47,381 INFO L225 Difference]: With dead ends: 18421 [2019-12-07 20:03:47,382 INFO L226 Difference]: Without dead ends: 18421 [2019-12-07 20:03:47,382 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:03:47,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18421 states. [2019-12-07 20:03:47,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18421 to 18147. [2019-12-07 20:03:47,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18147 states. [2019-12-07 20:03:47,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18147 states to 18147 states and 54094 transitions. [2019-12-07 20:03:47,654 INFO L78 Accepts]: Start accepts. Automaton has 18147 states and 54094 transitions. Word has length 40 [2019-12-07 20:03:47,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:03:47,655 INFO L462 AbstractCegarLoop]: Abstraction has 18147 states and 54094 transitions. [2019-12-07 20:03:47,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:03:47,655 INFO L276 IsEmpty]: Start isEmpty. Operand 18147 states and 54094 transitions. [2019-12-07 20:03:47,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 20:03:47,669 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:03:47,669 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] [2019-12-07 20:03:47,669 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:03:47,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:03:47,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1843753540, now seen corresponding path program 1 times [2019-12-07 20:03:47,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:03:47,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952619477] [2019-12-07 20:03:47,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:03:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:03:47,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:03:47,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952619477] [2019-12-07 20:03:47,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:03:47,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:03:47,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949393471] [2019-12-07 20:03:47,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:03:47,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:03:47,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:03:47,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:03:47,708 INFO L87 Difference]: Start difference. First operand 18147 states and 54094 transitions. Second operand 5 states. [2019-12-07 20:03:47,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:03:47,761 INFO L93 Difference]: Finished difference Result 16651 states and 50821 transitions. [2019-12-07 20:03:47,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:03:47,761 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-07 20:03:47,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:03:47,779 INFO L225 Difference]: With dead ends: 16651 [2019-12-07 20:03:47,779 INFO L226 Difference]: Without dead ends: 16651 [2019-12-07 20:03:47,779 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:03:47,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16651 states. [2019-12-07 20:03:47,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16651 to 15033. [2019-12-07 20:03:47,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15033 states. [2019-12-07 20:03:48,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15033 states to 15033 states and 46041 transitions. [2019-12-07 20:03:48,003 INFO L78 Accepts]: Start accepts. Automaton has 15033 states and 46041 transitions. Word has length 41 [2019-12-07 20:03:48,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:03:48,004 INFO L462 AbstractCegarLoop]: Abstraction has 15033 states and 46041 transitions. [2019-12-07 20:03:48,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:03:48,004 INFO L276 IsEmpty]: Start isEmpty. Operand 15033 states and 46041 transitions. [2019-12-07 20:03:48,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 20:03:48,017 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:03:48,017 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:03:48,018 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:03:48,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:03:48,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1628177899, now seen corresponding path program 1 times [2019-12-07 20:03:48,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:03:48,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045676444] [2019-12-07 20:03:48,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:03:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:03:48,049 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:03:48,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045676444] [2019-12-07 20:03:48,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:03:48,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:03:48,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946755215] [2019-12-07 20:03:48,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:03:48,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:03:48,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:03:48,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:03:48,050 INFO L87 Difference]: Start difference. First operand 15033 states and 46041 transitions. Second operand 3 states. [2019-12-07 20:03:48,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:03:48,116 INFO L93 Difference]: Finished difference Result 19008 states and 57236 transitions. [2019-12-07 20:03:48,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:03:48,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 20:03:48,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:03:48,136 INFO L225 Difference]: With dead ends: 19008 [2019-12-07 20:03:48,136 INFO L226 Difference]: Without dead ends: 19008 [2019-12-07 20:03:48,137 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:03:48,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19008 states. [2019-12-07 20:03:48,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19008 to 14578. [2019-12-07 20:03:48,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14578 states. [2019-12-07 20:03:48,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14578 states to 14578 states and 44075 transitions. [2019-12-07 20:03:48,372 INFO L78 Accepts]: Start accepts. Automaton has 14578 states and 44075 transitions. Word has length 66 [2019-12-07 20:03:48,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:03:48,373 INFO L462 AbstractCegarLoop]: Abstraction has 14578 states and 44075 transitions. [2019-12-07 20:03:48,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:03:48,373 INFO L276 IsEmpty]: Start isEmpty. Operand 14578 states and 44075 transitions. [2019-12-07 20:03:48,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 20:03:48,384 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:03:48,384 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:03:48,384 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:03:48,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:03:48,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1017702190, now seen corresponding path program 1 times [2019-12-07 20:03:48,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:03:48,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122431362] [2019-12-07 20:03:48,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:03:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:03:48,422 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:03:48,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122431362] [2019-12-07 20:03:48,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:03:48,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:03:48,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545576398] [2019-12-07 20:03:48,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:03:48,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:03:48,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:03:48,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:03:48,423 INFO L87 Difference]: Start difference. First operand 14578 states and 44075 transitions. Second operand 3 states. [2019-12-07 20:03:48,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:03:48,496 INFO L93 Difference]: Finished difference Result 17447 states and 52826 transitions. [2019-12-07 20:03:48,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:03:48,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 20:03:48,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:03:48,514 INFO L225 Difference]: With dead ends: 17447 [2019-12-07 20:03:48,514 INFO L226 Difference]: Without dead ends: 17447 [2019-12-07 20:03:48,514 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:03:48,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17447 states. [2019-12-07 20:03:48,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17447 to 13814. [2019-12-07 20:03:48,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13814 states. [2019-12-07 20:03:48,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13814 states to 13814 states and 42123 transitions. [2019-12-07 20:03:48,735 INFO L78 Accepts]: Start accepts. Automaton has 13814 states and 42123 transitions. Word has length 66 [2019-12-07 20:03:48,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:03:48,735 INFO L462 AbstractCegarLoop]: Abstraction has 13814 states and 42123 transitions. [2019-12-07 20:03:48,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:03:48,735 INFO L276 IsEmpty]: Start isEmpty. Operand 13814 states and 42123 transitions. [2019-12-07 20:03:48,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 20:03:48,746 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:03:48,746 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:03:48,746 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:03:48,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:03:48,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1992119349, now seen corresponding path program 1 times [2019-12-07 20:03:48,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:03:48,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593300560] [2019-12-07 20:03:48,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:03:48,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:03:48,801 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:03:48,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593300560] [2019-12-07 20:03:48,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:03:48,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:03:48,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113495920] [2019-12-07 20:03:48,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:03:48,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:03:48,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:03:48,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:03:48,803 INFO L87 Difference]: Start difference. First operand 13814 states and 42123 transitions. Second operand 4 states. [2019-12-07 20:03:48,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:03:48,877 INFO L93 Difference]: Finished difference Result 13629 states and 41400 transitions. [2019-12-07 20:03:48,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:03:48,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-07 20:03:48,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:03:48,891 INFO L225 Difference]: With dead ends: 13629 [2019-12-07 20:03:48,891 INFO L226 Difference]: Without dead ends: 13629 [2019-12-07 20:03:48,891 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:03:48,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13629 states. [2019-12-07 20:03:49,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13629 to 12149. [2019-12-07 20:03:49,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12149 states. [2019-12-07 20:03:49,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12149 states to 12149 states and 36824 transitions. [2019-12-07 20:03:49,070 INFO L78 Accepts]: Start accepts. Automaton has 12149 states and 36824 transitions. Word has length 67 [2019-12-07 20:03:49,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:03:49,070 INFO L462 AbstractCegarLoop]: Abstraction has 12149 states and 36824 transitions. [2019-12-07 20:03:49,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:03:49,071 INFO L276 IsEmpty]: Start isEmpty. Operand 12149 states and 36824 transitions. [2019-12-07 20:03:49,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 20:03:49,079 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:03:49,079 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:03:49,079 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:03:49,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:03:49,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1668578459, now seen corresponding path program 1 times [2019-12-07 20:03:49,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:03:49,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075506544] [2019-12-07 20:03:49,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:03:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:03:49,151 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:03:49,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075506544] [2019-12-07 20:03:49,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:03:49,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:03:49,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618115290] [2019-12-07 20:03:49,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:03:49,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:03:49,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:03:49,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:03:49,153 INFO L87 Difference]: Start difference. First operand 12149 states and 36824 transitions. Second operand 4 states. [2019-12-07 20:03:49,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:03:49,219 INFO L93 Difference]: Finished difference Result 21564 states and 65449 transitions. [2019-12-07 20:03:49,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:03:49,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-07 20:03:49,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:03:49,238 INFO L225 Difference]: With dead ends: 21564 [2019-12-07 20:03:49,238 INFO L226 Difference]: Without dead ends: 18769 [2019-12-07 20:03:49,238 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:03:49,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18769 states. [2019-12-07 20:03:49,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18769 to 11596. [2019-12-07 20:03:49,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11596 states. [2019-12-07 20:03:49,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11596 states to 11596 states and 35089 transitions. [2019-12-07 20:03:49,448 INFO L78 Accepts]: Start accepts. Automaton has 11596 states and 35089 transitions. Word has length 67 [2019-12-07 20:03:49,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:03:49,448 INFO L462 AbstractCegarLoop]: Abstraction has 11596 states and 35089 transitions. [2019-12-07 20:03:49,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:03:49,448 INFO L276 IsEmpty]: Start isEmpty. Operand 11596 states and 35089 transitions. [2019-12-07 20:03:49,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 20:03:49,457 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:03:49,457 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:03:49,457 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:03:49,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:03:49,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1376638825, now seen corresponding path program 2 times [2019-12-07 20:03:49,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:03:49,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213317379] [2019-12-07 20:03:49,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:03:49,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:03:49,549 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:03:49,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213317379] [2019-12-07 20:03:49,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:03:49,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:03:49,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339373539] [2019-12-07 20:03:49,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:03:49,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:03:49,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:03:49,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:03:49,551 INFO L87 Difference]: Start difference. First operand 11596 states and 35089 transitions. Second operand 5 states. [2019-12-07 20:03:49,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:03:49,616 INFO L93 Difference]: Finished difference Result 19502 states and 59264 transitions. [2019-12-07 20:03:49,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:03:49,616 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-07 20:03:49,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:03:49,625 INFO L225 Difference]: With dead ends: 19502 [2019-12-07 20:03:49,625 INFO L226 Difference]: Without dead ends: 8705 [2019-12-07 20:03:49,625 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:03:49,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8705 states. [2019-12-07 20:03:49,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8705 to 8705. [2019-12-07 20:03:49,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8705 states. [2019-12-07 20:03:49,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8705 states to 8705 states and 26532 transitions. [2019-12-07 20:03:49,760 INFO L78 Accepts]: Start accepts. Automaton has 8705 states and 26532 transitions. Word has length 67 [2019-12-07 20:03:49,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:03:49,760 INFO L462 AbstractCegarLoop]: Abstraction has 8705 states and 26532 transitions. [2019-12-07 20:03:49,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:03:49,761 INFO L276 IsEmpty]: Start isEmpty. Operand 8705 states and 26532 transitions. [2019-12-07 20:03:49,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 20:03:49,767 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:03:49,767 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:03:49,767 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:03:49,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:03:49,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1541701607, now seen corresponding path program 3 times [2019-12-07 20:03:49,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:03:49,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134309001] [2019-12-07 20:03:49,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:03:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:03:49,837 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:03:49,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134309001] [2019-12-07 20:03:49,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:03:49,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:03:49,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014897187] [2019-12-07 20:03:49,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:03:49,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:03:49,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:03:49,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:03:49,838 INFO L87 Difference]: Start difference. First operand 8705 states and 26532 transitions. Second operand 4 states. [2019-12-07 20:03:49,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:03:49,921 INFO L93 Difference]: Finished difference Result 15378 states and 47132 transitions. [2019-12-07 20:03:49,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:03:49,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-07 20:03:49,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:03:49,937 INFO L225 Difference]: With dead ends: 15378 [2019-12-07 20:03:49,937 INFO L226 Difference]: Without dead ends: 12938 [2019-12-07 20:03:49,937 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:03:50,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12938 states. [2019-12-07 20:03:50,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12938 to 8474. [2019-12-07 20:03:50,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8474 states. [2019-12-07 20:03:50,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8474 states to 8474 states and 25844 transitions. [2019-12-07 20:03:50,094 INFO L78 Accepts]: Start accepts. Automaton has 8474 states and 25844 transitions. Word has length 67 [2019-12-07 20:03:50,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:03:50,094 INFO L462 AbstractCegarLoop]: Abstraction has 8474 states and 25844 transitions. [2019-12-07 20:03:50,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:03:50,094 INFO L276 IsEmpty]: Start isEmpty. Operand 8474 states and 25844 transitions. [2019-12-07 20:03:50,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 20:03:50,100 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:03:50,100 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:03:50,100 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:03:50,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:03:50,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1209323901, now seen corresponding path program 4 times [2019-12-07 20:03:50,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:03:50,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926598381] [2019-12-07 20:03:50,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:03:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:03:50,177 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:03:50,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926598381] [2019-12-07 20:03:50,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:03:50,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:03:50,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313204227] [2019-12-07 20:03:50,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:03:50,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:03:50,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:03:50,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:03:50,178 INFO L87 Difference]: Start difference. First operand 8474 states and 25844 transitions. Second operand 5 states. [2019-12-07 20:03:50,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:03:50,226 INFO L93 Difference]: Finished difference Result 14965 states and 45907 transitions. [2019-12-07 20:03:50,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:03:50,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-07 20:03:50,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:03:50,233 INFO L225 Difference]: With dead ends: 14965 [2019-12-07 20:03:50,233 INFO L226 Difference]: Without dead ends: 6996 [2019-12-07 20:03:50,233 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:03:50,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6996 states. [2019-12-07 20:03:50,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6996 to 6996. [2019-12-07 20:03:50,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6996 states. [2019-12-07 20:03:50,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6996 states to 6996 states and 21488 transitions. [2019-12-07 20:03:50,342 INFO L78 Accepts]: Start accepts. Automaton has 6996 states and 21488 transitions. Word has length 67 [2019-12-07 20:03:50,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:03:50,342 INFO L462 AbstractCegarLoop]: Abstraction has 6996 states and 21488 transitions. [2019-12-07 20:03:50,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:03:50,342 INFO L276 IsEmpty]: Start isEmpty. Operand 6996 states and 21488 transitions. [2019-12-07 20:03:50,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 20:03:50,347 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:03:50,347 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:03:50,347 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:03:50,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:03:50,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1000943315, now seen corresponding path program 5 times [2019-12-07 20:03:50,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:03:50,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864971433] [2019-12-07 20:03:50,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:03:50,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:03:50,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:03:50,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864971433] [2019-12-07 20:03:50,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:03:50,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 20:03:50,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774889008] [2019-12-07 20:03:50,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 20:03:50,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:03:50,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 20:03:50,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-07 20:03:50,513 INFO L87 Difference]: Start difference. First operand 6996 states and 21488 transitions. Second operand 11 states. [2019-12-07 20:03:51,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:03:51,439 INFO L93 Difference]: Finished difference Result 15096 states and 45177 transitions. [2019-12-07 20:03:51,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 20:03:51,440 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 20:03:51,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:03:51,449 INFO L225 Difference]: With dead ends: 15096 [2019-12-07 20:03:51,449 INFO L226 Difference]: Without dead ends: 9766 [2019-12-07 20:03:51,449 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=577, Unknown=0, NotChecked=0, Total=702 [2019-12-07 20:03:51,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9766 states. [2019-12-07 20:03:51,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9766 to 8415. [2019-12-07 20:03:51,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8415 states. [2019-12-07 20:03:51,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8415 states to 8415 states and 25525 transitions. [2019-12-07 20:03:51,581 INFO L78 Accepts]: Start accepts. Automaton has 8415 states and 25525 transitions. Word has length 67 [2019-12-07 20:03:51,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:03:51,581 INFO L462 AbstractCegarLoop]: Abstraction has 8415 states and 25525 transitions. [2019-12-07 20:03:51,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 20:03:51,581 INFO L276 IsEmpty]: Start isEmpty. Operand 8415 states and 25525 transitions. [2019-12-07 20:03:51,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 20:03:51,587 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:03:51,587 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:51,587 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:03:51,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:03:51,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1387520431, now seen corresponding path program 6 times [2019-12-07 20:03:51,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:03:51,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011797490] [2019-12-07 20:03:51,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:03:51,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:03:51,711 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:03:51,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011797490] [2019-12-07 20:03:51,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:03:51,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 20:03:51,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883899513] [2019-12-07 20:03:51,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 20:03:51,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:03:51,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 20:03:51,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 20:03:51,712 INFO L87 Difference]: Start difference. First operand 8415 states and 25525 transitions. Second operand 10 states. [2019-12-07 20:03:52,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:03:52,587 INFO L93 Difference]: Finished difference Result 18036 states and 53296 transitions. [2019-12-07 20:03:52,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 20:03:52,588 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-07 20:03:52,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:03:52,599 INFO L225 Difference]: With dead ends: 18036 [2019-12-07 20:03:52,599 INFO L226 Difference]: Without dead ends: 12346 [2019-12-07 20:03:52,600 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2019-12-07 20:03:52,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12346 states. [2019-12-07 20:03:52,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12346 to 8856. [2019-12-07 20:03:52,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8856 states. [2019-12-07 20:03:52,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8856 states to 8856 states and 26631 transitions. [2019-12-07 20:03:52,748 INFO L78 Accepts]: Start accepts. Automaton has 8856 states and 26631 transitions. Word has length 67 [2019-12-07 20:03:52,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:03:52,748 INFO L462 AbstractCegarLoop]: Abstraction has 8856 states and 26631 transitions. [2019-12-07 20:03:52,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 20:03:52,748 INFO L276 IsEmpty]: Start isEmpty. Operand 8856 states and 26631 transitions. [2019-12-07 20:03:52,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 20:03:52,754 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:03:52,755 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:03:52,755 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:03:52,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:03:52,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1156359029, now seen corresponding path program 7 times [2019-12-07 20:03:52,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:03:52,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771434683] [2019-12-07 20:03:52,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:03:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:03:52,879 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:03:52,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771434683] [2019-12-07 20:03:52,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:03:52,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 20:03:52,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659152895] [2019-12-07 20:03:52,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 20:03:52,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:03:52,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 20:03:52,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 20:03:52,880 INFO L87 Difference]: Start difference. First operand 8856 states and 26631 transitions. Second operand 11 states. [2019-12-07 20:03:53,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:03:53,734 INFO L93 Difference]: Finished difference Result 14065 states and 41426 transitions. [2019-12-07 20:03:53,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 20:03:53,735 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 20:03:53,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:03:53,745 INFO L225 Difference]: With dead ends: 14065 [2019-12-07 20:03:53,745 INFO L226 Difference]: Without dead ends: 11242 [2019-12-07 20:03:53,745 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2019-12-07 20:03:53,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11242 states. [2019-12-07 20:03:53,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11242 to 8568. [2019-12-07 20:03:53,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8568 states. [2019-12-07 20:03:53,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8568 states to 8568 states and 25791 transitions. [2019-12-07 20:03:53,887 INFO L78 Accepts]: Start accepts. Automaton has 8568 states and 25791 transitions. Word has length 67 [2019-12-07 20:03:53,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:03:53,887 INFO L462 AbstractCegarLoop]: Abstraction has 8568 states and 25791 transitions. [2019-12-07 20:03:53,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 20:03:53,887 INFO L276 IsEmpty]: Start isEmpty. Operand 8568 states and 25791 transitions. [2019-12-07 20:03:53,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 20:03:53,893 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:03:53,893 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:03:53,893 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:03:53,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:03:53,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1555205525, now seen corresponding path program 8 times [2019-12-07 20:03:53,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:03:53,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415978164] [2019-12-07 20:03:53,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:03:53,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:03:54,066 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:03:54,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415978164] [2019-12-07 20:03:54,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:03:54,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 20:03:54,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928723741] [2019-12-07 20:03:54,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 20:03:54,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:03:54,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 20:03:54,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 20:03:54,067 INFO L87 Difference]: Start difference. First operand 8568 states and 25791 transitions. Second operand 11 states. [2019-12-07 20:03:54,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:03:54,638 INFO L93 Difference]: Finished difference Result 15129 states and 44988 transitions. [2019-12-07 20:03:54,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 20:03:54,639 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 20:03:54,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:03:54,654 INFO L225 Difference]: With dead ends: 15129 [2019-12-07 20:03:54,654 INFO L226 Difference]: Without dead ends: 12766 [2019-12-07 20:03:54,654 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=751, Unknown=0, NotChecked=0, Total=930 [2019-12-07 20:03:54,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12766 states. [2019-12-07 20:03:54,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12766 to 10684. [2019-12-07 20:03:54,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10684 states. [2019-12-07 20:03:54,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10684 states to 10684 states and 32162 transitions. [2019-12-07 20:03:54,824 INFO L78 Accepts]: Start accepts. Automaton has 10684 states and 32162 transitions. Word has length 67 [2019-12-07 20:03:54,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:03:54,824 INFO L462 AbstractCegarLoop]: Abstraction has 10684 states and 32162 transitions. [2019-12-07 20:03:54,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 20:03:54,824 INFO L276 IsEmpty]: Start isEmpty. Operand 10684 states and 32162 transitions. [2019-12-07 20:03:54,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 20:03:54,832 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:03:54,832 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:03:54,832 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:03:54,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:03:54,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1250353067, now seen corresponding path program 9 times [2019-12-07 20:03:54,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:03:54,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915295469] [2019-12-07 20:03:54,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:03:54,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:03:55,489 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:03:55,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915295469] [2019-12-07 20:03:55,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:03:55,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-07 20:03:55,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209571188] [2019-12-07 20:03:55,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 20:03:55,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:03:55,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 20:03:55,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2019-12-07 20:03:55,490 INFO L87 Difference]: Start difference. First operand 10684 states and 32162 transitions. Second operand 18 states. [2019-12-07 20:03:59,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:03:59,125 INFO L93 Difference]: Finished difference Result 12303 states and 36562 transitions. [2019-12-07 20:03:59,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-07 20:03:59,125 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-12-07 20:03:59,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:03:59,136 INFO L225 Difference]: With dead ends: 12303 [2019-12-07 20:03:59,136 INFO L226 Difference]: Without dead ends: 11940 [2019-12-07 20:03:59,137 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=292, Invalid=1600, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 20:03:59,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11940 states. [2019-12-07 20:03:59,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11940 to 10916. [2019-12-07 20:03:59,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10916 states. [2019-12-07 20:03:59,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10916 states to 10916 states and 32781 transitions. [2019-12-07 20:03:59,299 INFO L78 Accepts]: Start accepts. Automaton has 10916 states and 32781 transitions. Word has length 67 [2019-12-07 20:03:59,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:03:59,299 INFO L462 AbstractCegarLoop]: Abstraction has 10916 states and 32781 transitions. [2019-12-07 20:03:59,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 20:03:59,299 INFO L276 IsEmpty]: Start isEmpty. Operand 10916 states and 32781 transitions. [2019-12-07 20:03:59,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 20:03:59,308 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:03:59,308 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:03:59,308 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:03:59,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:03:59,308 INFO L82 PathProgramCache]: Analyzing trace with hash -2005796147, now seen corresponding path program 10 times [2019-12-07 20:03:59,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:03:59,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623293598] [2019-12-07 20:03:59,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:03:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:03:59,906 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:03:59,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623293598] [2019-12-07 20:03:59,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:03:59,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-07 20:03:59,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56936348] [2019-12-07 20:03:59,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 20:03:59,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:03:59,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 20:03:59,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2019-12-07 20:03:59,908 INFO L87 Difference]: Start difference. First operand 10916 states and 32781 transitions. Second operand 21 states. [2019-12-07 20:04:04,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:04:04,762 INFO L93 Difference]: Finished difference Result 14534 states and 42133 transitions. [2019-12-07 20:04:04,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-12-07 20:04:04,762 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2019-12-07 20:04:04,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:04:04,774 INFO L225 Difference]: With dead ends: 14534 [2019-12-07 20:04:04,774 INFO L226 Difference]: Without dead ends: 13135 [2019-12-07 20:04:04,775 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 978 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=571, Invalid=3461, Unknown=0, NotChecked=0, Total=4032 [2019-12-07 20:04:04,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13135 states. [2019-12-07 20:04:04,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13135 to 11620. [2019-12-07 20:04:04,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11620 states. [2019-12-07 20:04:04,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11620 states to 11620 states and 34541 transitions. [2019-12-07 20:04:04,947 INFO L78 Accepts]: Start accepts. Automaton has 11620 states and 34541 transitions. Word has length 67 [2019-12-07 20:04:04,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:04:04,948 INFO L462 AbstractCegarLoop]: Abstraction has 11620 states and 34541 transitions. [2019-12-07 20:04:04,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 20:04:04,948 INFO L276 IsEmpty]: Start isEmpty. Operand 11620 states and 34541 transitions. [2019-12-07 20:04:04,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 20:04:04,957 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:04:04,957 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:04:04,957 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:04:04,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:04:04,957 INFO L82 PathProgramCache]: Analyzing trace with hash 305803543, now seen corresponding path program 11 times [2019-12-07 20:04:04,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:04:04,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905244819] [2019-12-07 20:04:04,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:04:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:04:05,083 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:04:05,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905244819] [2019-12-07 20:04:05,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:04:05,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 20:04:05,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381256776] [2019-12-07 20:04:05,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 20:04:05,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:04:05,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 20:04:05,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 20:04:05,084 INFO L87 Difference]: Start difference. First operand 11620 states and 34541 transitions. Second operand 11 states. [2019-12-07 20:04:05,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:04:05,751 INFO L93 Difference]: Finished difference Result 14696 states and 42948 transitions. [2019-12-07 20:04:05,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 20:04:05,752 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 20:04:05,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:04:05,765 INFO L225 Difference]: With dead ends: 14696 [2019-12-07 20:04:05,765 INFO L226 Difference]: Without dead ends: 14054 [2019-12-07 20:04:05,765 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2019-12-07 20:04:05,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14054 states. [2019-12-07 20:04:05,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14054 to 11309. [2019-12-07 20:04:05,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11309 states. [2019-12-07 20:04:05,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11309 states to 11309 states and 33708 transitions. [2019-12-07 20:04:05,943 INFO L78 Accepts]: Start accepts. Automaton has 11309 states and 33708 transitions. Word has length 67 [2019-12-07 20:04:05,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:04:05,943 INFO L462 AbstractCegarLoop]: Abstraction has 11309 states and 33708 transitions. [2019-12-07 20:04:05,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 20:04:05,944 INFO L276 IsEmpty]: Start isEmpty. Operand 11309 states and 33708 transitions. [2019-12-07 20:04:05,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 20:04:05,952 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:04:05,952 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:04:05,952 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:04:05,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:04:05,952 INFO L82 PathProgramCache]: Analyzing trace with hash -849605617, now seen corresponding path program 12 times [2019-12-07 20:04:05,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:04:05,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100959530] [2019-12-07 20:04:05,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:04:05,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:04:06,342 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:04:06,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100959530] [2019-12-07 20:04:06,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:04:06,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 20:04:06,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750932669] [2019-12-07 20:04:06,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 20:04:06,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:04:06,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 20:04:06,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2019-12-07 20:04:06,343 INFO L87 Difference]: Start difference. First operand 11309 states and 33708 transitions. Second operand 16 states. [2019-12-07 20:04:07,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:04:07,631 INFO L93 Difference]: Finished difference Result 13076 states and 38057 transitions. [2019-12-07 20:04:07,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 20:04:07,631 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-07 20:04:07,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:04:07,644 INFO L225 Difference]: With dead ends: 13076 [2019-12-07 20:04:07,645 INFO L226 Difference]: Without dead ends: 12855 [2019-12-07 20:04:07,645 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=169, Invalid=953, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 20:04:07,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12855 states. [2019-12-07 20:04:07,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12855 to 11452. [2019-12-07 20:04:07,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11452 states. [2019-12-07 20:04:07,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11452 states to 11452 states and 33611 transitions. [2019-12-07 20:04:07,809 INFO L78 Accepts]: Start accepts. Automaton has 11452 states and 33611 transitions. Word has length 67 [2019-12-07 20:04:07,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:04:07,809 INFO L462 AbstractCegarLoop]: Abstraction has 11452 states and 33611 transitions. [2019-12-07 20:04:07,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 20:04:07,809 INFO L276 IsEmpty]: Start isEmpty. Operand 11452 states and 33611 transitions. [2019-12-07 20:04:07,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 20:04:07,818 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:04:07,818 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:04:07,818 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:04:07,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:04:07,819 INFO L82 PathProgramCache]: Analyzing trace with hash -493186175, now seen corresponding path program 13 times [2019-12-07 20:04:07,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:04:07,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901220976] [2019-12-07 20:04:07,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:04:07,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:04:07,945 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:04:07,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901220976] [2019-12-07 20:04:07,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:04:07,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 20:04:07,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768434129] [2019-12-07 20:04:07,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 20:04:07,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:04:07,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 20:04:07,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 20:04:07,946 INFO L87 Difference]: Start difference. First operand 11452 states and 33611 transitions. Second operand 11 states. [2019-12-07 20:04:08,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:04:08,456 INFO L93 Difference]: Finished difference Result 13668 states and 39544 transitions. [2019-12-07 20:04:08,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 20:04:08,456 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 20:04:08,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:04:08,465 INFO L225 Difference]: With dead ends: 13668 [2019-12-07 20:04:08,465 INFO L226 Difference]: Without dead ends: 9901 [2019-12-07 20:04:08,466 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2019-12-07 20:04:08,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9901 states. [2019-12-07 20:04:08,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9901 to 7725. [2019-12-07 20:04:08,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7725 states. [2019-12-07 20:04:08,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7725 states to 7725 states and 22673 transitions. [2019-12-07 20:04:08,589 INFO L78 Accepts]: Start accepts. Automaton has 7725 states and 22673 transitions. Word has length 67 [2019-12-07 20:04:08,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:04:08,589 INFO L462 AbstractCegarLoop]: Abstraction has 7725 states and 22673 transitions. [2019-12-07 20:04:08,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 20:04:08,589 INFO L276 IsEmpty]: Start isEmpty. Operand 7725 states and 22673 transitions. [2019-12-07 20:04:08,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 20:04:08,595 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:04:08,595 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:08,595 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:04:08,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:04:08,595 INFO L82 PathProgramCache]: Analyzing trace with hash -945042827, now seen corresponding path program 14 times [2019-12-07 20:04:08,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:04:08,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933351154] [2019-12-07 20:04:08,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:04:08,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:04:08,714 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:04:08,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933351154] [2019-12-07 20:04:08,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:04:08,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 20:04:08,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563158499] [2019-12-07 20:04:08,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 20:04:08,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:04:08,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 20:04:08,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 20:04:08,715 INFO L87 Difference]: Start difference. First operand 7725 states and 22673 transitions. Second operand 11 states. [2019-12-07 20:04:09,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:04:09,122 INFO L93 Difference]: Finished difference Result 9949 states and 28621 transitions. [2019-12-07 20:04:09,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 20:04:09,122 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 20:04:09,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:04:09,130 INFO L225 Difference]: With dead ends: 9949 [2019-12-07 20:04:09,130 INFO L226 Difference]: Without dead ends: 9554 [2019-12-07 20:04:09,131 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=618, Unknown=0, NotChecked=0, Total=756 [2019-12-07 20:04:09,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9554 states. [2019-12-07 20:04:09,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9554 to 7469. [2019-12-07 20:04:09,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7469 states. [2019-12-07 20:04:09,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7469 states to 7469 states and 21985 transitions. [2019-12-07 20:04:09,246 INFO L78 Accepts]: Start accepts. Automaton has 7469 states and 21985 transitions. Word has length 67 [2019-12-07 20:04:09,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:04:09,247 INFO L462 AbstractCegarLoop]: Abstraction has 7469 states and 21985 transitions. [2019-12-07 20:04:09,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 20:04:09,247 INFO L276 IsEmpty]: Start isEmpty. Operand 7469 states and 21985 transitions. [2019-12-07 20:04:09,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 20:04:09,252 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:04:09,252 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:04:09,252 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:04:09,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:04:09,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1748623595, now seen corresponding path program 15 times [2019-12-07 20:04:09,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:04:09,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902695675] [2019-12-07 20:04:09,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:04:09,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 20:04:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 20:04:09,324 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 20:04:09,324 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 20:04:09,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] ULTIMATE.startENTRY-->L842: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= v_~b$r_buff1_thd0~0_230 0) (= v_~b$w_buff1~0_176 0) (= v_~b$mem_tmp~0_20 0) (= v_~weak$$choice2~0_144 0) (= 0 v_~b$r_buff1_thd3~0_337) (= 0 v_~b$read_delayed~0_7) (= 0 v_~b$r_buff0_thd2~0_182) (= (select .cse0 |v_ULTIMATE.start_main_~#t849~0.base_25|) 0) (= 0 v_~__unbuffered_p0_EAX~0_176) (= v_~__unbuffered_p1_EBX~0_38 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t849~0.base_25| 4)) (= v_~main$tmp_guard1~0_34 0) (= v_~y~0_19 0) (= 0 v_~__unbuffered_p1_EAX~0_38) (= v_~b$r_buff0_thd0~0_204 0) (< 0 |v_#StackHeapBarrier_17|) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t849~0.base_25|) (= 0 v_~b$r_buff1_thd1~0_215) (= v_~a~0_14 0) (= 0 v_~x~0_124) (= 0 v_~b$r_buff0_thd3~0_395) (= v_~__unbuffered_p2_EBX~0_38 0) (= v_~b$read_delayed_var~0.offset_7 0) (= v_~z~0_23 0) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p2_EAX~0_34) (= 0 v_~b$w_buff0_used~0_787) (= 0 |v_ULTIMATE.start_main_~#t849~0.offset_17|) (= |v_#NULL.offset_4| 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t849~0.base_25| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t849~0.base_25|) |v_ULTIMATE.start_main_~#t849~0.offset_17| 0)) |v_#memory_int_23|) (= 0 v_~b$w_buff0~0_250) (= v_~__unbuffered_cnt~0_137 0) (= 0 v_~b$w_buff1_used~0_450) (= 0 v_~b$r_buff1_thd2~0_222) (= 0 v_~weak$$choice0~0_13) (= v_~b~0_186 0) (= v_~main$tmp_guard0~0_24 0) (= v_~b$flush_delayed~0_35 0) (= 0 v_~b$read_delayed_var~0.base_7) (= 0 v_~b$r_buff0_thd1~0_323) (= (store .cse0 |v_ULTIMATE.start_main_~#t849~0.base_25| 1) |v_#valid_65|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_395, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_215, ~b$read_delayed_var~0.offset=v_~b$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_35|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_245|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_51|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_787, ~a~0=v_~a~0_14, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_68|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_176, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ULTIMATE.start_main_~#t849~0.base=|v_ULTIMATE.start_main_~#t849~0.base_25|, #length=|v_#length_25|, ~b$w_buff0~0=v_~b$w_buff0~0_250, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_204, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_182, ~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_38, ~b$flush_delayed~0=v_~b$flush_delayed~0_35, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~b$read_delayed~0=v_~b$read_delayed~0_7, ULTIMATE.start_main_~#t850~0.offset=|v_ULTIMATE.start_main_~#t850~0.offset_17|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~b$w_buff1~0=v_~b$w_buff1~0_176, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_137, ~x~0=v_~x~0_124, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_323, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_37|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ULTIMATE.start_main_~#t850~0.base=|v_ULTIMATE.start_main_~#t850~0.base_21|, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_450, ULTIMATE.start_main_~#t849~0.offset=|v_ULTIMATE.start_main_~#t849~0.offset_17|, ~y~0=v_~y~0_19, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_222, ULTIMATE.start_main_~#t851~0.offset=|v_ULTIMATE.start_main_~#t851~0.offset_17|, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_230, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_38, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, #NULL.base=|v_#NULL.base_4|, ~b$read_delayed_var~0.base=v_~b$read_delayed_var~0.base_7, ~b~0=v_~b~0_186, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t851~0.base=|v_ULTIMATE.start_main_~#t851~0.base_21|, ~z~0=v_~z~0_23, ~weak$$choice2~0=v_~weak$$choice2~0_144, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_337} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, ~b$r_buff1_thd1~0, ~b$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ~b$w_buff0_used~0, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t849~0.base, #length, ~b$w_buff0~0, ~__unbuffered_p2_EAX~0, ~b$r_buff0_thd0~0, ~b$r_buff0_thd2~0, ~b$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~b$flush_delayed~0, ULTIMATE.start_main_#t~nondet45, ~b$read_delayed~0, ULTIMATE.start_main_~#t850~0.offset, ~weak$$choice0~0, ~b$w_buff1~0, ~__unbuffered_cnt~0, ~x~0, ~b$r_buff0_thd1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t850~0.base, ~b$w_buff1_used~0, ULTIMATE.start_main_~#t849~0.offset, ~y~0, ~b$r_buff1_thd2~0, ULTIMATE.start_main_~#t851~0.offset, ~b$r_buff1_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~main$tmp_guard0~0, #NULL.base, ~b$read_delayed_var~0.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t851~0.base, ~z~0, ~weak$$choice2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-07 20:04:09,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L842-1-->L844: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t850~0.base_10| 4) |v_#length_13|) (not (= 0 |v_ULTIMATE.start_main_~#t850~0.base_10|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t850~0.base_10| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t850~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t850~0.base_10|) |v_ULTIMATE.start_main_~#t850~0.offset_9| 1)) |v_#memory_int_11|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t850~0.base_10|) 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t850~0.base_10|) (= |v_ULTIMATE.start_main_~#t850~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t850~0.base=|v_ULTIMATE.start_main_~#t850~0.base_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t850~0.offset=|v_ULTIMATE.start_main_~#t850~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t850~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t850~0.offset] because there is no mapped edge [2019-12-07 20:04:09,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L844-1-->L846: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t851~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t851~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t851~0.base_13|) |v_ULTIMATE.start_main_~#t851~0.offset_11| 2)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t851~0.offset_11| 0) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t851~0.base_13|)) (not (= |v_ULTIMATE.start_main_~#t851~0.base_13| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t851~0.base_13| 4)) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t851~0.base_13| 1) |v_#valid_36|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t851~0.base=|v_ULTIMATE.start_main_~#t851~0.base_13|, ULTIMATE.start_main_~#t851~0.offset=|v_ULTIMATE.start_main_~#t851~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t851~0.base, ULTIMATE.start_main_~#t851~0.offset] because there is no mapped edge [2019-12-07 20:04:09,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L4-->L754: Formula: (and (= 1 ~b$r_buff0_thd1~0_Out1182082107) (= ~x~0_In1182082107 ~__unbuffered_p0_EAX~0_Out1182082107) (= ~b$r_buff1_thd1~0_Out1182082107 ~b$r_buff0_thd1~0_In1182082107) (= ~b$r_buff0_thd2~0_In1182082107 ~b$r_buff1_thd2~0_Out1182082107) (= ~b$r_buff1_thd3~0_Out1182082107 ~b$r_buff0_thd3~0_In1182082107) (not (= P0Thread1of1ForFork2___VERIFIER_assert_~expression_In1182082107 0)) (= ~b$r_buff1_thd0~0_Out1182082107 ~b$r_buff0_thd0~0_In1182082107)) InVars {~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1182082107, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1182082107, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1182082107, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In1182082107, ~x~0=~x~0_In1182082107, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1182082107} OutVars{~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out1182082107, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1182082107, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out1182082107, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1182082107, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_Out1182082107, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_Out1182082107, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In1182082107, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_Out1182082107, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_Out1182082107, ~x~0=~x~0_In1182082107, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1182082107} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~__unbuffered_p0_EAX~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-07 20:04:09,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L780-2-->L780-4: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff1_used~0_In-1240431919 256))) (.cse1 (= (mod ~b$r_buff1_thd2~0_In-1240431919 256) 0))) (or (and (not .cse0) (= ~b$w_buff1~0_In-1240431919 |P1Thread1of1ForFork0_#t~ite9_Out-1240431919|) (not .cse1)) (and (= ~b~0_In-1240431919 |P1Thread1of1ForFork0_#t~ite9_Out-1240431919|) (or .cse0 .cse1)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In-1240431919, ~b~0=~b~0_In-1240431919, ~b$w_buff1~0=~b$w_buff1~0_In-1240431919, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-1240431919} OutVars{~b$w_buff1_used~0=~b$w_buff1_used~0_In-1240431919, ~b~0=~b~0_In-1240431919, ~b$w_buff1~0=~b$w_buff1~0_In-1240431919, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out-1240431919|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-1240431919} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-07 20:04:09,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L780-4-->L781: Formula: (= v_~b~0_66 |v_P1Thread1of1ForFork0_#t~ite9_32|) InVars {P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_32|} OutVars{~b~0=v_~b~0_66, P1Thread1of1ForFork0_#t~ite10=|v_P1Thread1of1ForFork0_#t~ite10_51|, P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_31|} AuxVars[] AssignedVars[~b~0, P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-07 20:04:09,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd2~0_In306413555 256) 0)) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In306413555 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite11_Out306413555| ~b$w_buff0_used~0_In306413555) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite11_Out306413555| 0) (not .cse1) (not .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In306413555, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In306413555} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In306413555, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In306413555, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out306413555|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-07 20:04:09,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L782-->L782-2: Formula: (let ((.cse2 (= 0 (mod ~b$r_buff0_thd2~0_In1483486921 256))) (.cse3 (= (mod ~b$w_buff0_used~0_In1483486921 256) 0)) (.cse0 (= 0 (mod ~b$r_buff1_thd2~0_In1483486921 256))) (.cse1 (= (mod ~b$w_buff1_used~0_In1483486921 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite12_Out1483486921| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~b$w_buff1_used~0_In1483486921 |P1Thread1of1ForFork0_#t~ite12_Out1483486921|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1483486921, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1483486921, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1483486921, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1483486921} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1483486921, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1483486921, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1483486921, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out1483486921|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1483486921} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-07 20:04:09,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In1188056702 256) 0)) (.cse1 (= 0 (mod ~b$r_buff0_thd2~0_In1188056702 256)))) (or (and (or .cse0 .cse1) (= ~b$r_buff0_thd2~0_In1188056702 |P1Thread1of1ForFork0_#t~ite13_Out1188056702|)) (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite13_Out1188056702|) (not .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1188056702, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1188056702} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1188056702, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1188056702, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out1188056702|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-07 20:04:09,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L784-->L784-2: Formula: (let ((.cse0 (= (mod ~b$r_buff0_thd2~0_In1676235401 256) 0)) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In1676235401 256))) (.cse2 (= 0 (mod ~b$r_buff1_thd2~0_In1676235401 256))) (.cse3 (= (mod ~b$w_buff1_used~0_In1676235401 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite14_Out1676235401| ~b$r_buff1_thd2~0_In1676235401) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite14_Out1676235401| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1676235401, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1676235401, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1676235401, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1676235401} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1676235401, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1676235401, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1676235401, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out1676235401|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1676235401} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-07 20:04:09,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L784-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= v_~b$r_buff1_thd2~0_85 |v_P1Thread1of1ForFork0_#t~ite14_30|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_30|} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_29|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_85, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#t~ite14, P1Thread1of1ForFork0_#res.offset, ~b$r_buff1_thd2~0, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 20:04:09,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L808-->L808-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1111859283 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite21_Out-1111859283| ~b$w_buff0~0_In-1111859283) (= |P2Thread1of1ForFork1_#t~ite20_In-1111859283| |P2Thread1of1ForFork1_#t~ite20_Out-1111859283|)) (and (= |P2Thread1of1ForFork1_#t~ite20_Out-1111859283| ~b$w_buff0~0_In-1111859283) (= |P2Thread1of1ForFork1_#t~ite21_Out-1111859283| |P2Thread1of1ForFork1_#t~ite20_Out-1111859283|) (let ((.cse1 (= (mod ~b$r_buff0_thd3~0_In-1111859283 256) 0))) (or (= (mod ~b$w_buff0_used~0_In-1111859283 256) 0) (and .cse1 (= (mod ~b$w_buff1_used~0_In-1111859283 256) 0)) (and (= (mod ~b$r_buff1_thd3~0_In-1111859283 256) 0) .cse1))) .cse0))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1111859283, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1111859283, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In-1111859283|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1111859283, ~b$w_buff0~0=~b$w_buff0~0_In-1111859283, ~weak$$choice2~0=~weak$$choice2~0_In-1111859283, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1111859283} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1111859283, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1111859283, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out-1111859283|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out-1111859283|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1111859283, ~b$w_buff0~0=~b$w_buff0~0_In-1111859283, ~weak$$choice2~0=~weak$$choice2~0_In-1111859283, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1111859283} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 20:04:09,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L810-->L810-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-402086033 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite27_Out-402086033| ~b$w_buff0_used~0_In-402086033) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite26_In-402086033| |P2Thread1of1ForFork1_#t~ite26_Out-402086033|)) (and .cse0 (let ((.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In-402086033 256)))) (or (and .cse1 (= 0 (mod ~b$r_buff1_thd3~0_In-402086033 256))) (= (mod ~b$w_buff0_used~0_In-402086033 256) 0) (and .cse1 (= (mod ~b$w_buff1_used~0_In-402086033 256) 0)))) (= |P2Thread1of1ForFork1_#t~ite26_Out-402086033| ~b$w_buff0_used~0_In-402086033) (= |P2Thread1of1ForFork1_#t~ite26_Out-402086033| |P2Thread1of1ForFork1_#t~ite27_Out-402086033|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-402086033, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-402086033, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In-402086033|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-402086033, ~weak$$choice2~0=~weak$$choice2~0_In-402086033, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-402086033} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-402086033, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out-402086033|, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-402086033, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out-402086033|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-402086033, ~weak$$choice2~0=~weak$$choice2~0_In-402086033, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-402086033} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-07 20:04:09,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L812-->L813: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~b$r_buff0_thd3~0_79 v_~b$r_buff0_thd3~0_78)) InVars {~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_79, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_78, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_6|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, P2Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 20:04:09,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L815-->L819: Formula: (and (= v_~b$flush_delayed~0_7 0) (not (= (mod v_~b$flush_delayed~0_8 256) 0)) (= v_~b~0_30 v_~b$mem_tmp~0_5)) InVars {~b$mem_tmp~0=v_~b$mem_tmp~0_5, ~b$flush_delayed~0=v_~b$flush_delayed~0_8} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_5, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_5|, ~b~0=v_~b~0_30, ~b$flush_delayed~0=v_~b$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, ~b~0, ~b$flush_delayed~0] because there is no mapped edge [2019-12-07 20:04:09,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L819-2-->L819-4: Formula: (let ((.cse1 (= (mod ~b$w_buff1_used~0_In1334245686 256) 0)) (.cse0 (= 0 (mod ~b$r_buff1_thd3~0_In1334245686 256)))) (or (and (not .cse0) (not .cse1) (= ~b$w_buff1~0_In1334245686 |P2Thread1of1ForFork1_#t~ite38_Out1334245686|)) (and (= |P2Thread1of1ForFork1_#t~ite38_Out1334245686| ~b~0_In1334245686) (or .cse1 .cse0)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In1334245686, ~b~0=~b~0_In1334245686, ~b$w_buff1~0=~b$w_buff1~0_In1334245686, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1334245686} OutVars{P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out1334245686|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1334245686, ~b~0=~b~0_In1334245686, ~b$w_buff1~0=~b$w_buff1~0_In1334245686, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1334245686} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-07 20:04:09,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L819-4-->L820: Formula: (= v_~b~0_46 |v_P2Thread1of1ForFork1_#t~ite38_10|) InVars {P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_10|} OutVars{P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_9|, ~b~0=v_~b~0_46, P2Thread1of1ForFork1_#t~ite39=|v_P2Thread1of1ForFork1_#t~ite39_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38, ~b~0, P2Thread1of1ForFork1_#t~ite39] because there is no mapped edge [2019-12-07 20:04:09,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L820-->L820-2: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff0_used~0_In66964350 256))) (.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In66964350 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite40_Out66964350|) (not .cse1)) (and (or .cse0 .cse1) (= ~b$w_buff0_used~0_In66964350 |P2Thread1of1ForFork1_#t~ite40_Out66964350|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In66964350, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In66964350} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In66964350, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In66964350, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out66964350|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-07 20:04:09,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd3~0_In827850325 256) 0)) (.cse0 (= (mod ~b$w_buff0_used~0_In827850325 256) 0)) (.cse2 (= (mod ~b$w_buff1_used~0_In827850325 256) 0)) (.cse3 (= 0 (mod ~b$r_buff1_thd3~0_In827850325 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite41_Out827850325| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite41_Out827850325| ~b$w_buff1_used~0_In827850325) (or .cse2 .cse3)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In827850325, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In827850325, ~b$w_buff1_used~0=~b$w_buff1_used~0_In827850325, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In827850325} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In827850325, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In827850325, ~b$w_buff1_used~0=~b$w_buff1_used~0_In827850325, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out827850325|, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In827850325} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-07 20:04:09,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff0_thd3~0_In1955613805 256))) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In1955613805 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite42_Out1955613805|)) (and (= ~b$r_buff0_thd3~0_In1955613805 |P2Thread1of1ForFork1_#t~ite42_Out1955613805|) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1955613805, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1955613805} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1955613805, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1955613805, P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out1955613805|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-07 20:04:09,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff1_thd3~0_In-153703239 256))) (.cse0 (= 0 (mod ~b$w_buff1_used~0_In-153703239 256))) (.cse3 (= 0 (mod ~b$r_buff0_thd3~0_In-153703239 256))) (.cse2 (= (mod ~b$w_buff0_used~0_In-153703239 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite43_Out-153703239| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork1_#t~ite43_Out-153703239| ~b$r_buff1_thd3~0_In-153703239) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-153703239, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-153703239, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-153703239, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-153703239} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-153703239, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-153703239, P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out-153703239|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-153703239, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-153703239} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-07 20:04:09,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L823-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= |v_P2Thread1of1ForFork1_#t~ite43_42| v_~b$r_buff1_thd3~0_140) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_41|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_140, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~b$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 20:04:09,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L755-->L755-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd1~0_In-1868177639 256) 0)) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In-1868177639 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork2_#t~ite5_Out-1868177639|) (not .cse1)) (and (or .cse1 .cse0) (= ~b$w_buff0_used~0_In-1868177639 |P0Thread1of1ForFork2_#t~ite5_Out-1868177639|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1868177639, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1868177639} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1868177639, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1868177639, P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out-1868177639|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-07 20:04:09,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L756-->L756-2: Formula: (let ((.cse3 (= 0 (mod ~b$r_buff1_thd1~0_In-208666100 256))) (.cse2 (= (mod ~b$w_buff1_used~0_In-208666100 256) 0)) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In-208666100 256))) (.cse1 (= (mod ~b$r_buff0_thd1~0_In-208666100 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite6_Out-208666100| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork2_#t~ite6_Out-208666100| ~b$w_buff1_used~0_In-208666100) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-208666100, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-208666100, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-208666100, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-208666100} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-208666100, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-208666100, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-208666100, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-208666100, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out-208666100|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-07 20:04:09,339 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L757-->L758: Formula: (let ((.cse0 (= ~b$r_buff0_thd1~0_Out454041950 ~b$r_buff0_thd1~0_In454041950)) (.cse2 (= 0 (mod ~b$w_buff0_used~0_In454041950 256))) (.cse1 (= (mod ~b$r_buff0_thd1~0_In454041950 256) 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (not .cse2) (not .cse1) (= 0 ~b$r_buff0_thd1~0_Out454041950)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In454041950, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In454041950} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In454041950, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out454041950, P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out454041950|} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-07 20:04:09,339 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L758-->L758-2: Formula: (let ((.cse1 (= (mod ~b$w_buff1_used~0_In-829101287 256) 0)) (.cse0 (= (mod ~b$r_buff1_thd1~0_In-829101287 256) 0)) (.cse2 (= 0 (mod ~b$w_buff0_used~0_In-829101287 256))) (.cse3 (= 0 (mod ~b$r_buff0_thd1~0_In-829101287 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite8_Out-829101287| ~b$r_buff1_thd1~0_In-829101287) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork2_#t~ite8_Out-829101287|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-829101287, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-829101287, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-829101287, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-829101287} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-829101287, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-829101287, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-829101287, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-829101287, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-829101287|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-07 20:04:09,339 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L758-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite8_34| v_~b$r_buff1_thd1~0_103) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|)) InVars {P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} OutVars{~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_103, P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_33|, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[~b$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 20:04:09,339 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L846-1-->L852: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_33) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 20:04:09,339 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L852-2-->L852-4: Formula: (let ((.cse1 (= (mod ~b$r_buff1_thd0~0_In1410848416 256) 0)) (.cse0 (= (mod ~b$w_buff1_used~0_In1410848416 256) 0))) (or (and (not .cse0) (= ~b$w_buff1~0_In1410848416 |ULTIMATE.start_main_#t~ite47_Out1410848416|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite47_Out1410848416| ~b~0_In1410848416) (or .cse1 .cse0)))) InVars {~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In1410848416, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1410848416, ~b~0=~b~0_In1410848416, ~b$w_buff1~0=~b$w_buff1~0_In1410848416} OutVars{~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In1410848416, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1410848416, ~b~0=~b~0_In1410848416, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1410848416|, ~b$w_buff1~0=~b$w_buff1~0_In1410848416} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 20:04:09,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L852-4-->L853: Formula: (= v_~b~0_51 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{~b~0=v_~b~0_51, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~b~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 20:04:09,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L853-->L853-2: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff0_thd0~0_In-200448399 256))) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In-200448399 256)))) (or (and (or .cse0 .cse1) (= ~b$w_buff0_used~0_In-200448399 |ULTIMATE.start_main_#t~ite49_Out-200448399|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out-200448399|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-200448399, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-200448399} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-200448399, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-200448399|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-200448399} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 20:04:09,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L854-->L854-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd0~0_In-25299357 256) 0)) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In-25299357 256))) (.cse2 (= 0 (mod ~b$r_buff1_thd0~0_In-25299357 256))) (.cse3 (= 0 (mod ~b$w_buff1_used~0_In-25299357 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite50_Out-25299357| ~b$w_buff1_used~0_In-25299357) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite50_Out-25299357| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-25299357, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-25299357, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-25299357, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-25299357} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-25299357|, ~b$w_buff0_used~0=~b$w_buff0_used~0_In-25299357, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-25299357, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-25299357, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-25299357} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 20:04:09,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L855-->L855-2: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff0_thd0~0_In1361233912 256))) (.cse1 (= (mod ~b$w_buff0_used~0_In1361233912 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out1361233912|)) (and (= |ULTIMATE.start_main_#t~ite51_Out1361233912| ~b$r_buff0_thd0~0_In1361233912) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1361233912, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1361233912} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1361233912, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1361233912|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1361233912} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 20:04:09,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L856-->L856-2: Formula: (let ((.cse3 (= 0 (mod ~b$w_buff1_used~0_In-1815825877 256))) (.cse2 (= (mod ~b$r_buff1_thd0~0_In-1815825877 256) 0)) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In-1815825877 256))) (.cse1 (= (mod ~b$r_buff0_thd0~0_In-1815825877 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite52_Out-1815825877|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out-1815825877| ~b$r_buff1_thd0~0_In-1815825877)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1815825877, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-1815825877, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1815825877, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1815825877} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1815825877, ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1815825877|, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-1815825877, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1815825877, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1815825877} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 20:04:09,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L856-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~b$r_buff1_thd0~0_185 |v_ULTIMATE.start_main_#t~ite52_39|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (ite (= (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_19) (= v_~__unbuffered_p1_EBX~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_20) (= 0 v_~__unbuffered_p0_EAX~0_139) (= v_~__unbuffered_p2_EBX~0_26 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_18) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_139, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_139, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_185, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~b$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 20:04:09,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 08:04:09 BasicIcfg [2019-12-07 20:04:09,395 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 20:04:09,396 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 20:04:09,396 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 20:04:09,396 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 20:04:09,396 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:02:07" (3/4) ... [2019-12-07 20:04:09,398 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 20:04:09,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] ULTIMATE.startENTRY-->L842: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= v_~b$r_buff1_thd0~0_230 0) (= v_~b$w_buff1~0_176 0) (= v_~b$mem_tmp~0_20 0) (= v_~weak$$choice2~0_144 0) (= 0 v_~b$r_buff1_thd3~0_337) (= 0 v_~b$read_delayed~0_7) (= 0 v_~b$r_buff0_thd2~0_182) (= (select .cse0 |v_ULTIMATE.start_main_~#t849~0.base_25|) 0) (= 0 v_~__unbuffered_p0_EAX~0_176) (= v_~__unbuffered_p1_EBX~0_38 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t849~0.base_25| 4)) (= v_~main$tmp_guard1~0_34 0) (= v_~y~0_19 0) (= 0 v_~__unbuffered_p1_EAX~0_38) (= v_~b$r_buff0_thd0~0_204 0) (< 0 |v_#StackHeapBarrier_17|) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t849~0.base_25|) (= 0 v_~b$r_buff1_thd1~0_215) (= v_~a~0_14 0) (= 0 v_~x~0_124) (= 0 v_~b$r_buff0_thd3~0_395) (= v_~__unbuffered_p2_EBX~0_38 0) (= v_~b$read_delayed_var~0.offset_7 0) (= v_~z~0_23 0) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p2_EAX~0_34) (= 0 v_~b$w_buff0_used~0_787) (= 0 |v_ULTIMATE.start_main_~#t849~0.offset_17|) (= |v_#NULL.offset_4| 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t849~0.base_25| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t849~0.base_25|) |v_ULTIMATE.start_main_~#t849~0.offset_17| 0)) |v_#memory_int_23|) (= 0 v_~b$w_buff0~0_250) (= v_~__unbuffered_cnt~0_137 0) (= 0 v_~b$w_buff1_used~0_450) (= 0 v_~b$r_buff1_thd2~0_222) (= 0 v_~weak$$choice0~0_13) (= v_~b~0_186 0) (= v_~main$tmp_guard0~0_24 0) (= v_~b$flush_delayed~0_35 0) (= 0 v_~b$read_delayed_var~0.base_7) (= 0 v_~b$r_buff0_thd1~0_323) (= (store .cse0 |v_ULTIMATE.start_main_~#t849~0.base_25| 1) |v_#valid_65|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_395, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_215, ~b$read_delayed_var~0.offset=v_~b$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_35|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_245|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_51|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_787, ~a~0=v_~a~0_14, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_68|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_176, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ULTIMATE.start_main_~#t849~0.base=|v_ULTIMATE.start_main_~#t849~0.base_25|, #length=|v_#length_25|, ~b$w_buff0~0=v_~b$w_buff0~0_250, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_204, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_182, ~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_38, ~b$flush_delayed~0=v_~b$flush_delayed~0_35, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~b$read_delayed~0=v_~b$read_delayed~0_7, ULTIMATE.start_main_~#t850~0.offset=|v_ULTIMATE.start_main_~#t850~0.offset_17|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~b$w_buff1~0=v_~b$w_buff1~0_176, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_137, ~x~0=v_~x~0_124, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_323, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_37|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ULTIMATE.start_main_~#t850~0.base=|v_ULTIMATE.start_main_~#t850~0.base_21|, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_450, ULTIMATE.start_main_~#t849~0.offset=|v_ULTIMATE.start_main_~#t849~0.offset_17|, ~y~0=v_~y~0_19, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_222, ULTIMATE.start_main_~#t851~0.offset=|v_ULTIMATE.start_main_~#t851~0.offset_17|, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_230, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_38, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, #NULL.base=|v_#NULL.base_4|, ~b$read_delayed_var~0.base=v_~b$read_delayed_var~0.base_7, ~b~0=v_~b~0_186, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t851~0.base=|v_ULTIMATE.start_main_~#t851~0.base_21|, ~z~0=v_~z~0_23, ~weak$$choice2~0=v_~weak$$choice2~0_144, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_337} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, ~b$r_buff1_thd1~0, ~b$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ~b$w_buff0_used~0, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t849~0.base, #length, ~b$w_buff0~0, ~__unbuffered_p2_EAX~0, ~b$r_buff0_thd0~0, ~b$r_buff0_thd2~0, ~b$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~b$flush_delayed~0, ULTIMATE.start_main_#t~nondet45, ~b$read_delayed~0, ULTIMATE.start_main_~#t850~0.offset, ~weak$$choice0~0, ~b$w_buff1~0, ~__unbuffered_cnt~0, ~x~0, ~b$r_buff0_thd1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t850~0.base, ~b$w_buff1_used~0, ULTIMATE.start_main_~#t849~0.offset, ~y~0, ~b$r_buff1_thd2~0, ULTIMATE.start_main_~#t851~0.offset, ~b$r_buff1_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~main$tmp_guard0~0, #NULL.base, ~b$read_delayed_var~0.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t851~0.base, ~z~0, ~weak$$choice2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-07 20:04:09,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L842-1-->L844: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t850~0.base_10| 4) |v_#length_13|) (not (= 0 |v_ULTIMATE.start_main_~#t850~0.base_10|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t850~0.base_10| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t850~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t850~0.base_10|) |v_ULTIMATE.start_main_~#t850~0.offset_9| 1)) |v_#memory_int_11|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t850~0.base_10|) 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t850~0.base_10|) (= |v_ULTIMATE.start_main_~#t850~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t850~0.base=|v_ULTIMATE.start_main_~#t850~0.base_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t850~0.offset=|v_ULTIMATE.start_main_~#t850~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t850~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t850~0.offset] because there is no mapped edge [2019-12-07 20:04:09,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L844-1-->L846: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t851~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t851~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t851~0.base_13|) |v_ULTIMATE.start_main_~#t851~0.offset_11| 2)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t851~0.offset_11| 0) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t851~0.base_13|)) (not (= |v_ULTIMATE.start_main_~#t851~0.base_13| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t851~0.base_13| 4)) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t851~0.base_13| 1) |v_#valid_36|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t851~0.base=|v_ULTIMATE.start_main_~#t851~0.base_13|, ULTIMATE.start_main_~#t851~0.offset=|v_ULTIMATE.start_main_~#t851~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t851~0.base, ULTIMATE.start_main_~#t851~0.offset] because there is no mapped edge [2019-12-07 20:04:09,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L4-->L754: Formula: (and (= 1 ~b$r_buff0_thd1~0_Out1182082107) (= ~x~0_In1182082107 ~__unbuffered_p0_EAX~0_Out1182082107) (= ~b$r_buff1_thd1~0_Out1182082107 ~b$r_buff0_thd1~0_In1182082107) (= ~b$r_buff0_thd2~0_In1182082107 ~b$r_buff1_thd2~0_Out1182082107) (= ~b$r_buff1_thd3~0_Out1182082107 ~b$r_buff0_thd3~0_In1182082107) (not (= P0Thread1of1ForFork2___VERIFIER_assert_~expression_In1182082107 0)) (= ~b$r_buff1_thd0~0_Out1182082107 ~b$r_buff0_thd0~0_In1182082107)) InVars {~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1182082107, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1182082107, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1182082107, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In1182082107, ~x~0=~x~0_In1182082107, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1182082107} OutVars{~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out1182082107, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1182082107, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out1182082107, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1182082107, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_Out1182082107, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_Out1182082107, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In1182082107, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_Out1182082107, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_Out1182082107, ~x~0=~x~0_In1182082107, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1182082107} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~__unbuffered_p0_EAX~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-07 20:04:09,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L780-2-->L780-4: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff1_used~0_In-1240431919 256))) (.cse1 (= (mod ~b$r_buff1_thd2~0_In-1240431919 256) 0))) (or (and (not .cse0) (= ~b$w_buff1~0_In-1240431919 |P1Thread1of1ForFork0_#t~ite9_Out-1240431919|) (not .cse1)) (and (= ~b~0_In-1240431919 |P1Thread1of1ForFork0_#t~ite9_Out-1240431919|) (or .cse0 .cse1)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In-1240431919, ~b~0=~b~0_In-1240431919, ~b$w_buff1~0=~b$w_buff1~0_In-1240431919, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-1240431919} OutVars{~b$w_buff1_used~0=~b$w_buff1_used~0_In-1240431919, ~b~0=~b~0_In-1240431919, ~b$w_buff1~0=~b$w_buff1~0_In-1240431919, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out-1240431919|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-1240431919} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-07 20:04:09,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L780-4-->L781: Formula: (= v_~b~0_66 |v_P1Thread1of1ForFork0_#t~ite9_32|) InVars {P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_32|} OutVars{~b~0=v_~b~0_66, P1Thread1of1ForFork0_#t~ite10=|v_P1Thread1of1ForFork0_#t~ite10_51|, P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_31|} AuxVars[] AssignedVars[~b~0, P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-07 20:04:09,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd2~0_In306413555 256) 0)) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In306413555 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite11_Out306413555| ~b$w_buff0_used~0_In306413555) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite11_Out306413555| 0) (not .cse1) (not .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In306413555, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In306413555} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In306413555, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In306413555, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out306413555|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-07 20:04:09,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L782-->L782-2: Formula: (let ((.cse2 (= 0 (mod ~b$r_buff0_thd2~0_In1483486921 256))) (.cse3 (= (mod ~b$w_buff0_used~0_In1483486921 256) 0)) (.cse0 (= 0 (mod ~b$r_buff1_thd2~0_In1483486921 256))) (.cse1 (= (mod ~b$w_buff1_used~0_In1483486921 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite12_Out1483486921| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~b$w_buff1_used~0_In1483486921 |P1Thread1of1ForFork0_#t~ite12_Out1483486921|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1483486921, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1483486921, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1483486921, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1483486921} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1483486921, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1483486921, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1483486921, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out1483486921|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1483486921} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-07 20:04:09,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In1188056702 256) 0)) (.cse1 (= 0 (mod ~b$r_buff0_thd2~0_In1188056702 256)))) (or (and (or .cse0 .cse1) (= ~b$r_buff0_thd2~0_In1188056702 |P1Thread1of1ForFork0_#t~ite13_Out1188056702|)) (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite13_Out1188056702|) (not .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1188056702, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1188056702} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1188056702, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1188056702, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out1188056702|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-07 20:04:09,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L784-->L784-2: Formula: (let ((.cse0 (= (mod ~b$r_buff0_thd2~0_In1676235401 256) 0)) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In1676235401 256))) (.cse2 (= 0 (mod ~b$r_buff1_thd2~0_In1676235401 256))) (.cse3 (= (mod ~b$w_buff1_used~0_In1676235401 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite14_Out1676235401| ~b$r_buff1_thd2~0_In1676235401) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite14_Out1676235401| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1676235401, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1676235401, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1676235401, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1676235401} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1676235401, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1676235401, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1676235401, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out1676235401|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1676235401} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-07 20:04:09,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L784-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= v_~b$r_buff1_thd2~0_85 |v_P1Thread1of1ForFork0_#t~ite14_30|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_30|} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_29|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_85, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#t~ite14, P1Thread1of1ForFork0_#res.offset, ~b$r_buff1_thd2~0, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 20:04:09,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L808-->L808-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1111859283 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite21_Out-1111859283| ~b$w_buff0~0_In-1111859283) (= |P2Thread1of1ForFork1_#t~ite20_In-1111859283| |P2Thread1of1ForFork1_#t~ite20_Out-1111859283|)) (and (= |P2Thread1of1ForFork1_#t~ite20_Out-1111859283| ~b$w_buff0~0_In-1111859283) (= |P2Thread1of1ForFork1_#t~ite21_Out-1111859283| |P2Thread1of1ForFork1_#t~ite20_Out-1111859283|) (let ((.cse1 (= (mod ~b$r_buff0_thd3~0_In-1111859283 256) 0))) (or (= (mod ~b$w_buff0_used~0_In-1111859283 256) 0) (and .cse1 (= (mod ~b$w_buff1_used~0_In-1111859283 256) 0)) (and (= (mod ~b$r_buff1_thd3~0_In-1111859283 256) 0) .cse1))) .cse0))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1111859283, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1111859283, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In-1111859283|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1111859283, ~b$w_buff0~0=~b$w_buff0~0_In-1111859283, ~weak$$choice2~0=~weak$$choice2~0_In-1111859283, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1111859283} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1111859283, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1111859283, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out-1111859283|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out-1111859283|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1111859283, ~b$w_buff0~0=~b$w_buff0~0_In-1111859283, ~weak$$choice2~0=~weak$$choice2~0_In-1111859283, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1111859283} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 20:04:09,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L810-->L810-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-402086033 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite27_Out-402086033| ~b$w_buff0_used~0_In-402086033) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite26_In-402086033| |P2Thread1of1ForFork1_#t~ite26_Out-402086033|)) (and .cse0 (let ((.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In-402086033 256)))) (or (and .cse1 (= 0 (mod ~b$r_buff1_thd3~0_In-402086033 256))) (= (mod ~b$w_buff0_used~0_In-402086033 256) 0) (and .cse1 (= (mod ~b$w_buff1_used~0_In-402086033 256) 0)))) (= |P2Thread1of1ForFork1_#t~ite26_Out-402086033| ~b$w_buff0_used~0_In-402086033) (= |P2Thread1of1ForFork1_#t~ite26_Out-402086033| |P2Thread1of1ForFork1_#t~ite27_Out-402086033|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-402086033, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-402086033, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In-402086033|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-402086033, ~weak$$choice2~0=~weak$$choice2~0_In-402086033, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-402086033} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-402086033, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out-402086033|, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-402086033, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out-402086033|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-402086033, ~weak$$choice2~0=~weak$$choice2~0_In-402086033, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-402086033} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-07 20:04:09,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L812-->L813: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~b$r_buff0_thd3~0_79 v_~b$r_buff0_thd3~0_78)) InVars {~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_79, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_78, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_6|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, P2Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 20:04:09,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L815-->L819: Formula: (and (= v_~b$flush_delayed~0_7 0) (not (= (mod v_~b$flush_delayed~0_8 256) 0)) (= v_~b~0_30 v_~b$mem_tmp~0_5)) InVars {~b$mem_tmp~0=v_~b$mem_tmp~0_5, ~b$flush_delayed~0=v_~b$flush_delayed~0_8} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_5, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_5|, ~b~0=v_~b~0_30, ~b$flush_delayed~0=v_~b$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, ~b~0, ~b$flush_delayed~0] because there is no mapped edge [2019-12-07 20:04:09,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L819-2-->L819-4: Formula: (let ((.cse1 (= (mod ~b$w_buff1_used~0_In1334245686 256) 0)) (.cse0 (= 0 (mod ~b$r_buff1_thd3~0_In1334245686 256)))) (or (and (not .cse0) (not .cse1) (= ~b$w_buff1~0_In1334245686 |P2Thread1of1ForFork1_#t~ite38_Out1334245686|)) (and (= |P2Thread1of1ForFork1_#t~ite38_Out1334245686| ~b~0_In1334245686) (or .cse1 .cse0)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In1334245686, ~b~0=~b~0_In1334245686, ~b$w_buff1~0=~b$w_buff1~0_In1334245686, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1334245686} OutVars{P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out1334245686|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1334245686, ~b~0=~b~0_In1334245686, ~b$w_buff1~0=~b$w_buff1~0_In1334245686, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1334245686} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-07 20:04:09,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L819-4-->L820: Formula: (= v_~b~0_46 |v_P2Thread1of1ForFork1_#t~ite38_10|) InVars {P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_10|} OutVars{P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_9|, ~b~0=v_~b~0_46, P2Thread1of1ForFork1_#t~ite39=|v_P2Thread1of1ForFork1_#t~ite39_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38, ~b~0, P2Thread1of1ForFork1_#t~ite39] because there is no mapped edge [2019-12-07 20:04:09,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L820-->L820-2: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff0_used~0_In66964350 256))) (.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In66964350 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite40_Out66964350|) (not .cse1)) (and (or .cse0 .cse1) (= ~b$w_buff0_used~0_In66964350 |P2Thread1of1ForFork1_#t~ite40_Out66964350|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In66964350, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In66964350} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In66964350, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In66964350, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out66964350|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-07 20:04:09,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd3~0_In827850325 256) 0)) (.cse0 (= (mod ~b$w_buff0_used~0_In827850325 256) 0)) (.cse2 (= (mod ~b$w_buff1_used~0_In827850325 256) 0)) (.cse3 (= 0 (mod ~b$r_buff1_thd3~0_In827850325 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite41_Out827850325| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite41_Out827850325| ~b$w_buff1_used~0_In827850325) (or .cse2 .cse3)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In827850325, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In827850325, ~b$w_buff1_used~0=~b$w_buff1_used~0_In827850325, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In827850325} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In827850325, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In827850325, ~b$w_buff1_used~0=~b$w_buff1_used~0_In827850325, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out827850325|, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In827850325} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-07 20:04:09,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff0_thd3~0_In1955613805 256))) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In1955613805 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite42_Out1955613805|)) (and (= ~b$r_buff0_thd3~0_In1955613805 |P2Thread1of1ForFork1_#t~ite42_Out1955613805|) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1955613805, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1955613805} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1955613805, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1955613805, P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out1955613805|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-07 20:04:09,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff1_thd3~0_In-153703239 256))) (.cse0 (= 0 (mod ~b$w_buff1_used~0_In-153703239 256))) (.cse3 (= 0 (mod ~b$r_buff0_thd3~0_In-153703239 256))) (.cse2 (= (mod ~b$w_buff0_used~0_In-153703239 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite43_Out-153703239| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork1_#t~ite43_Out-153703239| ~b$r_buff1_thd3~0_In-153703239) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-153703239, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-153703239, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-153703239, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-153703239} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-153703239, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-153703239, P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out-153703239|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-153703239, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-153703239} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-07 20:04:09,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L823-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= |v_P2Thread1of1ForFork1_#t~ite43_42| v_~b$r_buff1_thd3~0_140) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_41|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_140, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~b$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 20:04:09,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L755-->L755-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd1~0_In-1868177639 256) 0)) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In-1868177639 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork2_#t~ite5_Out-1868177639|) (not .cse1)) (and (or .cse1 .cse0) (= ~b$w_buff0_used~0_In-1868177639 |P0Thread1of1ForFork2_#t~ite5_Out-1868177639|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1868177639, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1868177639} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1868177639, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1868177639, P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out-1868177639|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-07 20:04:09,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L756-->L756-2: Formula: (let ((.cse3 (= 0 (mod ~b$r_buff1_thd1~0_In-208666100 256))) (.cse2 (= (mod ~b$w_buff1_used~0_In-208666100 256) 0)) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In-208666100 256))) (.cse1 (= (mod ~b$r_buff0_thd1~0_In-208666100 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite6_Out-208666100| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork2_#t~ite6_Out-208666100| ~b$w_buff1_used~0_In-208666100) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-208666100, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-208666100, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-208666100, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-208666100} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-208666100, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-208666100, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-208666100, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-208666100, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out-208666100|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-07 20:04:09,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L757-->L758: Formula: (let ((.cse0 (= ~b$r_buff0_thd1~0_Out454041950 ~b$r_buff0_thd1~0_In454041950)) (.cse2 (= 0 (mod ~b$w_buff0_used~0_In454041950 256))) (.cse1 (= (mod ~b$r_buff0_thd1~0_In454041950 256) 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (not .cse2) (not .cse1) (= 0 ~b$r_buff0_thd1~0_Out454041950)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In454041950, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In454041950} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In454041950, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out454041950, P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out454041950|} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-07 20:04:09,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L758-->L758-2: Formula: (let ((.cse1 (= (mod ~b$w_buff1_used~0_In-829101287 256) 0)) (.cse0 (= (mod ~b$r_buff1_thd1~0_In-829101287 256) 0)) (.cse2 (= 0 (mod ~b$w_buff0_used~0_In-829101287 256))) (.cse3 (= 0 (mod ~b$r_buff0_thd1~0_In-829101287 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite8_Out-829101287| ~b$r_buff1_thd1~0_In-829101287) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork2_#t~ite8_Out-829101287|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-829101287, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-829101287, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-829101287, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-829101287} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-829101287, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-829101287, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-829101287, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-829101287, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-829101287|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-07 20:04:09,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L758-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite8_34| v_~b$r_buff1_thd1~0_103) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|)) InVars {P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} OutVars{~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_103, P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_33|, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[~b$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 20:04:09,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L846-1-->L852: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_33) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 20:04:09,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L852-2-->L852-4: Formula: (let ((.cse1 (= (mod ~b$r_buff1_thd0~0_In1410848416 256) 0)) (.cse0 (= (mod ~b$w_buff1_used~0_In1410848416 256) 0))) (or (and (not .cse0) (= ~b$w_buff1~0_In1410848416 |ULTIMATE.start_main_#t~ite47_Out1410848416|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite47_Out1410848416| ~b~0_In1410848416) (or .cse1 .cse0)))) InVars {~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In1410848416, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1410848416, ~b~0=~b~0_In1410848416, ~b$w_buff1~0=~b$w_buff1~0_In1410848416} OutVars{~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In1410848416, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1410848416, ~b~0=~b~0_In1410848416, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1410848416|, ~b$w_buff1~0=~b$w_buff1~0_In1410848416} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 20:04:09,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L852-4-->L853: Formula: (= v_~b~0_51 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{~b~0=v_~b~0_51, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~b~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 20:04:09,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L853-->L853-2: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff0_thd0~0_In-200448399 256))) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In-200448399 256)))) (or (and (or .cse0 .cse1) (= ~b$w_buff0_used~0_In-200448399 |ULTIMATE.start_main_#t~ite49_Out-200448399|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out-200448399|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-200448399, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-200448399} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-200448399, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-200448399|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-200448399} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 20:04:09,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L854-->L854-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd0~0_In-25299357 256) 0)) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In-25299357 256))) (.cse2 (= 0 (mod ~b$r_buff1_thd0~0_In-25299357 256))) (.cse3 (= 0 (mod ~b$w_buff1_used~0_In-25299357 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite50_Out-25299357| ~b$w_buff1_used~0_In-25299357) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite50_Out-25299357| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-25299357, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-25299357, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-25299357, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-25299357} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-25299357|, ~b$w_buff0_used~0=~b$w_buff0_used~0_In-25299357, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-25299357, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-25299357, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-25299357} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 20:04:09,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L855-->L855-2: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff0_thd0~0_In1361233912 256))) (.cse1 (= (mod ~b$w_buff0_used~0_In1361233912 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out1361233912|)) (and (= |ULTIMATE.start_main_#t~ite51_Out1361233912| ~b$r_buff0_thd0~0_In1361233912) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1361233912, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1361233912} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1361233912, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1361233912|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1361233912} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 20:04:09,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L856-->L856-2: Formula: (let ((.cse3 (= 0 (mod ~b$w_buff1_used~0_In-1815825877 256))) (.cse2 (= (mod ~b$r_buff1_thd0~0_In-1815825877 256) 0)) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In-1815825877 256))) (.cse1 (= (mod ~b$r_buff0_thd0~0_In-1815825877 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite52_Out-1815825877|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out-1815825877| ~b$r_buff1_thd0~0_In-1815825877)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1815825877, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-1815825877, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1815825877, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1815825877} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1815825877, ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1815825877|, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-1815825877, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1815825877, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1815825877} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 20:04:09,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L856-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~b$r_buff1_thd0~0_185 |v_ULTIMATE.start_main_#t~ite52_39|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (ite (= (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_19) (= v_~__unbuffered_p1_EBX~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_20) (= 0 v_~__unbuffered_p0_EAX~0_139) (= v_~__unbuffered_p2_EBX~0_26 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_18) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_139, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_139, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_185, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~b$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 20:04:09,461 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f39026c9-14f6-4ffc-ba83-b458e74d0a63/bin/utaipan/witness.graphml [2019-12-07 20:04:09,461 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 20:04:09,462 INFO L168 Benchmark]: Toolchain (without parser) took 122755.03 ms. Allocated memory was 1.0 GB in the beginning and 7.3 GB in the end (delta: 6.3 GB). Free memory was 939.3 MB in the beginning and 5.7 GB in the end (delta: -4.7 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-12-07 20:04:09,462 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:04:09,463 INFO L168 Benchmark]: CACSL2BoogieTranslator took 379.48 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -115.9 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 20:04:09,463 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.60 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:04:09,463 INFO L168 Benchmark]: Boogie Preprocessor took 25.49 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:04:09,463 INFO L168 Benchmark]: RCFGBuilder took 414.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 987.1 MB in the end (delta: 62.7 MB). Peak memory consumption was 62.7 MB. Max. memory is 11.5 GB. [2019-12-07 20:04:09,463 INFO L168 Benchmark]: TraceAbstraction took 121829.64 ms. Allocated memory was 1.1 GB in the beginning and 7.3 GB in the end (delta: 6.2 GB). Free memory was 987.1 MB in the beginning and 5.7 GB in the end (delta: -4.7 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-12-07 20:04:09,464 INFO L168 Benchmark]: Witness Printer took 65.30 ms. Allocated memory is still 7.3 GB. Free memory was 5.7 GB in the beginning and 5.7 GB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. [2019-12-07 20:04:09,465 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.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 379.48 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -115.9 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.60 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.49 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 414.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 987.1 MB in the end (delta: 62.7 MB). Peak memory consumption was 62.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 121829.64 ms. Allocated memory was 1.1 GB in the beginning and 7.3 GB in the end (delta: 6.2 GB). Free memory was 987.1 MB in the beginning and 5.7 GB in the end (delta: -4.7 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 65.30 ms. Allocated memory is still 7.3 GB. Free memory was 5.7 GB in the beginning and 5.7 GB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.4s, 180 ProgramPointsBefore, 96 ProgramPointsAfterwards, 217 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 32 ChoiceCompositions, 7698 VarBasedMoverChecksPositive, 261 VarBasedMoverChecksNegative, 64 SemBasedMoverChecksPositive, 271 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 83556 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L842] FCALL, FORK 0 pthread_create(&t849, ((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, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t850, ((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, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L846] FCALL, FORK 0 pthread_create(&t851, ((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, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L739] 1 b$w_buff1 = b$w_buff0 [L740] 1 b$w_buff0 = 1 [L741] 1 b$w_buff1_used = b$w_buff0_used [L742] 1 b$w_buff0_used = (_Bool)1 [L754] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L768] 2 x = 1 [L771] 2 y = 1 [L774] 2 __unbuffered_p1_EAX = y [L777] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L780] 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L754] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L781] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L782] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L783] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 3 z = 1 [L797] 3 a = 1 [L800] 3 __unbuffered_p2_EAX = a [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 b$flush_delayed = weak$$choice2 [L806] 3 b$mem_tmp = b 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, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) VAL [!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$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, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L808] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L809] EXPR 3 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$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, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1))=0, x=1, y=1, z=1] [L809] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L810] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L811] EXPR 3 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_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, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L811] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_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, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L813] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EBX = b 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, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L819] 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) 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, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L820] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L821] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L822] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L755] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L756] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L852] 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) 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, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L853] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L854] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L855] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 121.6s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 27.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6140 SDtfs, 8625 SDslu, 23498 SDs, 0 SdLazy, 18425 SolverSat, 414 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 447 GetRequests, 43 SyntacticMatches, 21 SemanticMatches, 383 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2327 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=233994occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 68.4s AutomataMinimizationTime, 31 MinimizatonAttempts, 217149 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1527 NumberOfCodeBlocks, 1527 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1429 ConstructedInterpolants, 0 QuantifiedInterpolants, 859399 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...