./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix032_tso.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_49ba22cf-636f-44c9-89b0-9a9c1d73edb6/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_49ba22cf-636f-44c9-89b0-9a9c1d73edb6/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_49ba22cf-636f-44c9-89b0-9a9c1d73edb6/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_49ba22cf-636f-44c9-89b0-9a9c1d73edb6/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix032_tso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_49ba22cf-636f-44c9-89b0-9a9c1d73edb6/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_49ba22cf-636f-44c9-89b0-9a9c1d73edb6/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 32c5e647cdda24ef669e766bcb94fa71ef89c591 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:13:10,140 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:13:10,141 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:13:10,149 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:13:10,149 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:13:10,150 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:13:10,151 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:13:10,152 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:13:10,153 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:13:10,154 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:13:10,154 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:13:10,155 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:13:10,155 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:13:10,156 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:13:10,157 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:13:10,157 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:13:10,158 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:13:10,159 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:13:10,160 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:13:10,161 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:13:10,162 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:13:10,163 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:13:10,164 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:13:10,164 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:13:10,166 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:13:10,166 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:13:10,166 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:13:10,166 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:13:10,167 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:13:10,167 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:13:10,167 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:13:10,168 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:13:10,168 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:13:10,169 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:13:10,169 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:13:10,170 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:13:10,170 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:13:10,170 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:13:10,170 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:13:10,171 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:13:10,171 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:13:10,172 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_49ba22cf-636f-44c9-89b0-9a9c1d73edb6/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 20:13:10,182 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:13:10,182 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:13:10,182 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:13:10,182 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:13:10,183 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:13:10,183 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:13:10,183 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 20:13:10,183 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:13:10,183 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:13:10,183 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 20:13:10,183 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 20:13:10,183 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:13:10,184 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 20:13:10,184 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 20:13:10,184 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 20:13:10,184 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:13:10,184 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:13:10,184 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:13:10,185 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:13:10,185 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:13:10,185 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 20:13:10,185 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:13:10,185 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 20:13:10,185 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:13:10,185 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:13:10,185 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 20:13:10,185 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:13:10,185 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 20:13:10,186 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:13:10,186 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:13:10,186 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:13:10,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:13:10,186 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:13:10,186 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:13:10,186 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 20:13:10,186 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 20:13:10,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 20:13:10,186 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 20:13:10,187 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:13:10,187 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:13:10,187 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_49ba22cf-636f-44c9-89b0-9a9c1d73edb6/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 -> 32c5e647cdda24ef669e766bcb94fa71ef89c591 [2019-12-07 20:13:10,284 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:13:10,293 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:13:10,295 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:13:10,296 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:13:10,296 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:13:10,296 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_49ba22cf-636f-44c9-89b0-9a9c1d73edb6/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix032_tso.oepc.i [2019-12-07 20:13:10,333 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_49ba22cf-636f-44c9-89b0-9a9c1d73edb6/bin/utaipan/data/1900aaee7/78d68a578494444d91fcbe8e737f50c7/FLAG9ab6bdb80 [2019-12-07 20:13:10,860 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:13:10,860 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_49ba22cf-636f-44c9-89b0-9a9c1d73edb6/sv-benchmarks/c/pthread-wmm/mix032_tso.oepc.i [2019-12-07 20:13:10,871 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_49ba22cf-636f-44c9-89b0-9a9c1d73edb6/bin/utaipan/data/1900aaee7/78d68a578494444d91fcbe8e737f50c7/FLAG9ab6bdb80 [2019-12-07 20:13:11,366 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_49ba22cf-636f-44c9-89b0-9a9c1d73edb6/bin/utaipan/data/1900aaee7/78d68a578494444d91fcbe8e737f50c7 [2019-12-07 20:13:11,369 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:13:11,370 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:13:11,370 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:13:11,371 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:13:11,373 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:13:11,374 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:13:11" (1/1) ... [2019-12-07 20:13:11,376 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f87f835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:13:11, skipping insertion in model container [2019-12-07 20:13:11,376 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:13:11" (1/1) ... [2019-12-07 20:13:11,381 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:13:11,412 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:13:11,666 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:13:11,675 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:13:11,718 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:13:11,764 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:13:11,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:13:11 WrapperNode [2019-12-07 20:13:11,765 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:13:11,765 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:13:11,765 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:13:11,765 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:13:11,771 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:13:11" (1/1) ... [2019-12-07 20:13:11,785 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:13:11" (1/1) ... [2019-12-07 20:13:11,803 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:13:11,804 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:13:11,804 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:13:11,804 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:13:11,810 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:13:11" (1/1) ... [2019-12-07 20:13:11,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:13:11" (1/1) ... [2019-12-07 20:13:11,814 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:13:11" (1/1) ... [2019-12-07 20:13:11,814 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:13:11" (1/1) ... [2019-12-07 20:13:11,822 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:13:11" (1/1) ... [2019-12-07 20:13:11,825 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:13:11" (1/1) ... [2019-12-07 20:13:11,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:13:11" (1/1) ... [2019-12-07 20:13:11,831 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:13:11,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:13:11,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:13:11,831 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:13:11,832 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:13:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49ba22cf-636f-44c9-89b0-9a9c1d73edb6/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:13:11,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 20:13:11,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 20:13:11,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 20:13:11,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 20:13:11,873 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 20:13:11,873 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 20:13:11,873 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 20:13:11,874 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 20:13:11,874 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 20:13:11,874 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 20:13:11,874 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 20:13:11,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:13:11,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:13:11,876 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:13:12,255 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:13:12,255 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 20:13:12,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:13:12 BoogieIcfgContainer [2019-12-07 20:13:12,256 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:13:12,257 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:13:12,257 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:13:12,259 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:13:12,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:13:11" (1/3) ... [2019-12-07 20:13:12,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d5c561b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:13:12, skipping insertion in model container [2019-12-07 20:13:12,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:13:11" (2/3) ... [2019-12-07 20:13:12,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d5c561b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:13:12, skipping insertion in model container [2019-12-07 20:13:12,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:13:12" (3/3) ... [2019-12-07 20:13:12,261 INFO L109 eAbstractionObserver]: Analyzing ICFG mix032_tso.oepc.i [2019-12-07 20:13:12,268 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 20:13:12,268 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:13:12,273 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 20:13:12,274 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 20:13:12,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,304 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,304 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,304 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,304 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,304 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,309 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,309 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,314 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,315 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:12,342 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 20:13:12,355 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:13:12,355 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 20:13:12,355 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:13:12,355 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:13:12,355 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:13:12,355 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:13:12,355 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:13:12,355 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:13:12,367 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 217 transitions [2019-12-07 20:13:12,368 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-07 20:13:12,434 INFO L134 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-07 20:13:12,434 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 20:13:12,444 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:13:12,461 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-07 20:13:12,499 INFO L134 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-07 20:13:12,499 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 20:13:12,505 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:13:12,523 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-07 20:13:12,523 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 20:13:15,474 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-12-07 20:13:15,657 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-07 20:13:15,758 INFO L206 etLargeBlockEncoding]: Checked pairs total: 83556 [2019-12-07 20:13:15,758 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-07 20:13:15,761 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 105 transitions [2019-12-07 20:13:34,765 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129602 states. [2019-12-07 20:13:34,766 INFO L276 IsEmpty]: Start isEmpty. Operand 129602 states. [2019-12-07 20:13:34,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 20:13:34,771 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:13:34,771 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 20:13:34,772 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:13:34,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:13:34,777 INFO L82 PathProgramCache]: Analyzing trace with hash 923865, now seen corresponding path program 1 times [2019-12-07 20:13:34,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:13:34,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904521619] [2019-12-07 20:13:34,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:13:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:13:34,927 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:13:34,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904521619] [2019-12-07 20:13:34,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:13:34,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 20:13:34,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514673092] [2019-12-07 20:13:34,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:13:34,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:13:34,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:13:34,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:13:34,946 INFO L87 Difference]: Start difference. First operand 129602 states. Second operand 3 states. [2019-12-07 20:13:35,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:13:35,866 INFO L93 Difference]: Finished difference Result 128376 states and 546782 transitions. [2019-12-07 20:13:35,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:13:35,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 20:13:35,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:13:36,344 INFO L225 Difference]: With dead ends: 128376 [2019-12-07 20:13:36,344 INFO L226 Difference]: Without dead ends: 120914 [2019-12-07 20:13:36,345 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:13:43,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120914 states. [2019-12-07 20:13:44,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120914 to 120914. [2019-12-07 20:13:44,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120914 states. [2019-12-07 20:13:45,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120914 states to 120914 states and 514358 transitions. [2019-12-07 20:13:45,216 INFO L78 Accepts]: Start accepts. Automaton has 120914 states and 514358 transitions. Word has length 3 [2019-12-07 20:13:45,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:13:45,216 INFO L462 AbstractCegarLoop]: Abstraction has 120914 states and 514358 transitions. [2019-12-07 20:13:45,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:13:45,216 INFO L276 IsEmpty]: Start isEmpty. Operand 120914 states and 514358 transitions. [2019-12-07 20:13:45,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 20:13:45,220 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:13:45,221 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:13:45,221 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:13:45,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:13:45,221 INFO L82 PathProgramCache]: Analyzing trace with hash 2102120012, now seen corresponding path program 1 times [2019-12-07 20:13:45,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:13:45,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264193875] [2019-12-07 20:13:45,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:13:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:13:45,291 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:13:45,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264193875] [2019-12-07 20:13:45,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:13:45,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:13:45,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897217954] [2019-12-07 20:13:45,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:13:45,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:13:45,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:13:45,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:13:45,293 INFO L87 Difference]: Start difference. First operand 120914 states and 514358 transitions. Second operand 4 states. [2019-12-07 20:13:46,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:13:46,619 INFO L93 Difference]: Finished difference Result 187704 states and 768206 transitions. [2019-12-07 20:13:46,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:13:46,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 20:13:46,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:13:47,122 INFO L225 Difference]: With dead ends: 187704 [2019-12-07 20:13:47,122 INFO L226 Difference]: Without dead ends: 187655 [2019-12-07 20:13:47,123 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:13:53,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187655 states. [2019-12-07 20:13:57,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187655 to 171775. [2019-12-07 20:13:57,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171775 states. [2019-12-07 20:13:58,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171775 states to 171775 states and 711726 transitions. [2019-12-07 20:13:58,682 INFO L78 Accepts]: Start accepts. Automaton has 171775 states and 711726 transitions. Word has length 11 [2019-12-07 20:13:58,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:13:58,682 INFO L462 AbstractCegarLoop]: Abstraction has 171775 states and 711726 transitions. [2019-12-07 20:13:58,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:13:58,682 INFO L276 IsEmpty]: Start isEmpty. Operand 171775 states and 711726 transitions. [2019-12-07 20:13:58,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 20:13:58,686 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:13:58,686 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:13:58,686 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:13:58,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:13:58,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1617299066, now seen corresponding path program 1 times [2019-12-07 20:13:58,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:13:58,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347528228] [2019-12-07 20:13:58,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:13:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:13:58,736 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:13:58,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347528228] [2019-12-07 20:13:58,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:13:58,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:13:58,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296119180] [2019-12-07 20:13:58,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:13:58,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:13:58,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:13:58,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:13:58,738 INFO L87 Difference]: Start difference. First operand 171775 states and 711726 transitions. Second operand 4 states. [2019-12-07 20:14:00,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:14:00,024 INFO L93 Difference]: Finished difference Result 242262 states and 982161 transitions. [2019-12-07 20:14:00,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:14:00,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 20:14:00,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:14:00,663 INFO L225 Difference]: With dead ends: 242262 [2019-12-07 20:14:00,663 INFO L226 Difference]: Without dead ends: 242206 [2019-12-07 20:14:00,663 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:14:08,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242206 states. [2019-12-07 20:14:13,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242206 to 205026. [2019-12-07 20:14:13,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205026 states. [2019-12-07 20:14:14,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205026 states to 205026 states and 845145 transitions. [2019-12-07 20:14:14,884 INFO L78 Accepts]: Start accepts. Automaton has 205026 states and 845145 transitions. Word has length 13 [2019-12-07 20:14:14,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:14:14,885 INFO L462 AbstractCegarLoop]: Abstraction has 205026 states and 845145 transitions. [2019-12-07 20:14:14,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:14:14,885 INFO L276 IsEmpty]: Start isEmpty. Operand 205026 states and 845145 transitions. [2019-12-07 20:14:14,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 20:14:14,894 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:14:14,894 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:14:14,894 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:14:14,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:14:14,895 INFO L82 PathProgramCache]: Analyzing trace with hash 947448332, now seen corresponding path program 1 times [2019-12-07 20:14:14,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:14:14,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880872737] [2019-12-07 20:14:14,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:14:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:14:14,947 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:14:14,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880872737] [2019-12-07 20:14:14,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:14:14,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:14:14,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165537577] [2019-12-07 20:14:14,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:14:14,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:14:14,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:14:14,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:14:14,949 INFO L87 Difference]: Start difference. First operand 205026 states and 845145 transitions. Second operand 5 states. [2019-12-07 20:14:16,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:14:16,441 INFO L93 Difference]: Finished difference Result 278815 states and 1138912 transitions. [2019-12-07 20:14:16,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 20:14:16,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 20:14:16,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:14:17,167 INFO L225 Difference]: With dead ends: 278815 [2019-12-07 20:14:17,167 INFO L226 Difference]: Without dead ends: 278815 [2019-12-07 20:14:17,168 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:14:28,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278815 states. [2019-12-07 20:14:31,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278815 to 233994. [2019-12-07 20:14:31,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233994 states. [2019-12-07 20:14:32,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233994 states to 233994 states and 963338 transitions. [2019-12-07 20:14:32,572 INFO L78 Accepts]: Start accepts. Automaton has 233994 states and 963338 transitions. Word has length 16 [2019-12-07 20:14:32,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:14:32,572 INFO L462 AbstractCegarLoop]: Abstraction has 233994 states and 963338 transitions. [2019-12-07 20:14:32,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:14:32,573 INFO L276 IsEmpty]: Start isEmpty. Operand 233994 states and 963338 transitions. [2019-12-07 20:14:32,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 20:14:32,587 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:14:32,587 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:14:32,587 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:14:32,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:14:32,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1320991791, now seen corresponding path program 1 times [2019-12-07 20:14:32,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:14:32,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112496498] [2019-12-07 20:14:32,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:14:32,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:14:32,623 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:14:32,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112496498] [2019-12-07 20:14:32,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:14:32,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:14:32,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595401144] [2019-12-07 20:14:32,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:14:32,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:14:32,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:14:32,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:14:32,624 INFO L87 Difference]: Start difference. First operand 233994 states and 963338 transitions. Second operand 3 states. [2019-12-07 20:14:33,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:14:33,645 INFO L93 Difference]: Finished difference Result 220624 states and 898795 transitions. [2019-12-07 20:14:33,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:14:33,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 20:14:33,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:14:34,235 INFO L225 Difference]: With dead ends: 220624 [2019-12-07 20:14:34,235 INFO L226 Difference]: Without dead ends: 220624 [2019-12-07 20:14:34,235 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:14:41,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220624 states. [2019-12-07 20:14:44,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220624 to 217410. [2019-12-07 20:14:44,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217410 states. [2019-12-07 20:14:45,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217410 states to 217410 states and 886869 transitions. [2019-12-07 20:14:45,097 INFO L78 Accepts]: Start accepts. Automaton has 217410 states and 886869 transitions. Word has length 18 [2019-12-07 20:14:45,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:14:45,097 INFO L462 AbstractCegarLoop]: Abstraction has 217410 states and 886869 transitions. [2019-12-07 20:14:45,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:14:45,097 INFO L276 IsEmpty]: Start isEmpty. Operand 217410 states and 886869 transitions. [2019-12-07 20:14:45,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 20:14:45,107 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:14:45,108 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:14:45,108 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:14:45,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:14:45,108 INFO L82 PathProgramCache]: Analyzing trace with hash 24190388, now seen corresponding path program 1 times [2019-12-07 20:14:45,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:14:45,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50814966] [2019-12-07 20:14:45,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:14:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:14:45,143 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:14:45,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50814966] [2019-12-07 20:14:45,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:14:45,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:14:45,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072173497] [2019-12-07 20:14:45,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:14:45,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:14:45,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:14:45,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:14:45,145 INFO L87 Difference]: Start difference. First operand 217410 states and 886869 transitions. Second operand 3 states. [2019-12-07 20:14:45,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:14:45,265 INFO L93 Difference]: Finished difference Result 39275 states and 126331 transitions. [2019-12-07 20:14:45,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:14:45,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 20:14:45,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:14:45,321 INFO L225 Difference]: With dead ends: 39275 [2019-12-07 20:14:45,321 INFO L226 Difference]: Without dead ends: 39275 [2019-12-07 20:14:45,321 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:14:45,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39275 states. [2019-12-07 20:14:45,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39275 to 39275. [2019-12-07 20:14:45,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39275 states. [2019-12-07 20:14:45,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39275 states to 39275 states and 126331 transitions. [2019-12-07 20:14:45,999 INFO L78 Accepts]: Start accepts. Automaton has 39275 states and 126331 transitions. Word has length 18 [2019-12-07 20:14:45,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:14:46,000 INFO L462 AbstractCegarLoop]: Abstraction has 39275 states and 126331 transitions. [2019-12-07 20:14:46,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:14:46,000 INFO L276 IsEmpty]: Start isEmpty. Operand 39275 states and 126331 transitions. [2019-12-07 20:14:46,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 20:14:46,005 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:14:46,005 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:14:46,005 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:14:46,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:14:46,005 INFO L82 PathProgramCache]: Analyzing trace with hash -282717849, now seen corresponding path program 1 times [2019-12-07 20:14:46,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:14:46,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154130336] [2019-12-07 20:14:46,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:14:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:14:46,054 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:14:46,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154130336] [2019-12-07 20:14:46,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:14:46,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:14:46,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67278999] [2019-12-07 20:14:46,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:14:46,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:14:46,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:14:46,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:14:46,055 INFO L87 Difference]: Start difference. First operand 39275 states and 126331 transitions. Second operand 6 states. [2019-12-07 20:14:46,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:14:46,663 INFO L93 Difference]: Finished difference Result 59427 states and 186833 transitions. [2019-12-07 20:14:46,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 20:14:46,664 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 20:14:46,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:14:46,750 INFO L225 Difference]: With dead ends: 59427 [2019-12-07 20:14:46,750 INFO L226 Difference]: Without dead ends: 59420 [2019-12-07 20:14:46,750 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:14:47,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59420 states. [2019-12-07 20:14:48,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59420 to 39235. [2019-12-07 20:14:48,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39235 states. [2019-12-07 20:14:48,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39235 states to 39235 states and 125505 transitions. [2019-12-07 20:14:48,672 INFO L78 Accepts]: Start accepts. Automaton has 39235 states and 125505 transitions. Word has length 22 [2019-12-07 20:14:48,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:14:48,672 INFO L462 AbstractCegarLoop]: Abstraction has 39235 states and 125505 transitions. [2019-12-07 20:14:48,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:14:48,672 INFO L276 IsEmpty]: Start isEmpty. Operand 39235 states and 125505 transitions. [2019-12-07 20:14:48,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 20:14:48,681 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:14:48,681 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:14:48,681 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:14:48,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:14:48,681 INFO L82 PathProgramCache]: Analyzing trace with hash -71664384, now seen corresponding path program 1 times [2019-12-07 20:14:48,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:14:48,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679301474] [2019-12-07 20:14:48,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:14:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:14:48,728 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:14:48,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679301474] [2019-12-07 20:14:48,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:14:48,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:14:48,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226173361] [2019-12-07 20:14:48,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:14:48,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:14:48,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:14:48,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:14:48,729 INFO L87 Difference]: Start difference. First operand 39235 states and 125505 transitions. Second operand 5 states. [2019-12-07 20:14:49,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:14:49,129 INFO L93 Difference]: Finished difference Result 55542 states and 174417 transitions. [2019-12-07 20:14:49,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 20:14:49,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 20:14:49,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:14:49,212 INFO L225 Difference]: With dead ends: 55542 [2019-12-07 20:14:49,212 INFO L226 Difference]: Without dead ends: 55529 [2019-12-07 20:14:49,212 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 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:14:49,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55529 states. [2019-12-07 20:14:49,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55529 to 47173. [2019-12-07 20:14:49,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47173 states. [2019-12-07 20:14:50,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47173 states to 47173 states and 150323 transitions. [2019-12-07 20:14:50,083 INFO L78 Accepts]: Start accepts. Automaton has 47173 states and 150323 transitions. Word has length 25 [2019-12-07 20:14:50,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:14:50,083 INFO L462 AbstractCegarLoop]: Abstraction has 47173 states and 150323 transitions. [2019-12-07 20:14:50,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:14:50,083 INFO L276 IsEmpty]: Start isEmpty. Operand 47173 states and 150323 transitions. [2019-12-07 20:14:50,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 20:14:50,096 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:14:50,096 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:14:50,096 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:14:50,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:14:50,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1418175430, now seen corresponding path program 1 times [2019-12-07 20:14:50,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:14:50,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137958304] [2019-12-07 20:14:50,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:14:50,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:14:50,125 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:14:50,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137958304] [2019-12-07 20:14:50,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:14:50,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:14:50,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556671852] [2019-12-07 20:14:50,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:14:50,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:14:50,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:14:50,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:14:50,126 INFO L87 Difference]: Start difference. First operand 47173 states and 150323 transitions. Second operand 3 states. [2019-12-07 20:14:50,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:14:50,324 INFO L93 Difference]: Finished difference Result 67630 states and 212546 transitions. [2019-12-07 20:14:50,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:14:50,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 20:14:50,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:14:50,426 INFO L225 Difference]: With dead ends: 67630 [2019-12-07 20:14:50,426 INFO L226 Difference]: Without dead ends: 67630 [2019-12-07 20:14:50,427 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:14:50,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67630 states. [2019-12-07 20:14:51,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67630 to 52544. [2019-12-07 20:14:51,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52544 states. [2019-12-07 20:14:51,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52544 states to 52544 states and 165778 transitions. [2019-12-07 20:14:51,517 INFO L78 Accepts]: Start accepts. Automaton has 52544 states and 165778 transitions. Word has length 27 [2019-12-07 20:14:51,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:14:51,517 INFO L462 AbstractCegarLoop]: Abstraction has 52544 states and 165778 transitions. [2019-12-07 20:14:51,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:14:51,518 INFO L276 IsEmpty]: Start isEmpty. Operand 52544 states and 165778 transitions. [2019-12-07 20:14:51,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 20:14:51,533 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:14:51,533 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:14:51,534 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:14:51,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:14:51,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1834697800, now seen corresponding path program 1 times [2019-12-07 20:14:51,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:14:51,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724684789] [2019-12-07 20:14:51,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:14:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:14:51,577 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:14:51,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724684789] [2019-12-07 20:14:51,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:14:51,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:14:51,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514512319] [2019-12-07 20:14:51,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:14:51,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:14:51,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:14:51,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:14:51,579 INFO L87 Difference]: Start difference. First operand 52544 states and 165778 transitions. Second operand 6 states. [2019-12-07 20:14:52,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:14:52,126 INFO L93 Difference]: Finished difference Result 73956 states and 228925 transitions. [2019-12-07 20:14:52,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 20:14:52,127 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-07 20:14:52,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:14:52,231 INFO L225 Difference]: With dead ends: 73956 [2019-12-07 20:14:52,231 INFO L226 Difference]: Without dead ends: 73914 [2019-12-07 20:14:52,232 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:14:52,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73914 states. [2019-12-07 20:14:53,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73914 to 54503. [2019-12-07 20:14:53,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54503 states. [2019-12-07 20:14:53,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54503 states to 54503 states and 171706 transitions. [2019-12-07 20:14:53,310 INFO L78 Accepts]: Start accepts. Automaton has 54503 states and 171706 transitions. Word has length 27 [2019-12-07 20:14:53,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:14:53,310 INFO L462 AbstractCegarLoop]: Abstraction has 54503 states and 171706 transitions. [2019-12-07 20:14:53,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:14:53,310 INFO L276 IsEmpty]: Start isEmpty. Operand 54503 states and 171706 transitions. [2019-12-07 20:14:53,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 20:14:53,340 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:14:53,340 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:14:53,341 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:14:53,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:14:53,341 INFO L82 PathProgramCache]: Analyzing trace with hash -197713206, now seen corresponding path program 1 times [2019-12-07 20:14:53,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:14:53,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126870999] [2019-12-07 20:14:53,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:14:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:14:53,377 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:14:53,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126870999] [2019-12-07 20:14:53,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:14:53,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:14:53,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71675275] [2019-12-07 20:14:53,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:14:53,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:14:53,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:14:53,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:14:53,378 INFO L87 Difference]: Start difference. First operand 54503 states and 171706 transitions. Second operand 4 states. [2019-12-07 20:14:53,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:14:53,438 INFO L93 Difference]: Finished difference Result 21175 states and 63903 transitions. [2019-12-07 20:14:53,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:14:53,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-12-07 20:14:53,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:14:53,463 INFO L225 Difference]: With dead ends: 21175 [2019-12-07 20:14:53,463 INFO L226 Difference]: Without dead ends: 21175 [2019-12-07 20:14:53,463 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:14:53,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21175 states. [2019-12-07 20:14:53,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21175 to 19838. [2019-12-07 20:14:53,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19838 states. [2019-12-07 20:14:53,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19838 states to 19838 states and 59880 transitions. [2019-12-07 20:14:53,837 INFO L78 Accepts]: Start accepts. Automaton has 19838 states and 59880 transitions. Word has length 29 [2019-12-07 20:14:53,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:14:53,837 INFO L462 AbstractCegarLoop]: Abstraction has 19838 states and 59880 transitions. [2019-12-07 20:14:53,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:14:53,837 INFO L276 IsEmpty]: Start isEmpty. Operand 19838 states and 59880 transitions. [2019-12-07 20:14:53,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 20:14:53,855 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:14:53,855 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:14:53,855 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:14:53,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:14:53,855 INFO L82 PathProgramCache]: Analyzing trace with hash -2065332723, now seen corresponding path program 1 times [2019-12-07 20:14:53,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:14:53,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675653153] [2019-12-07 20:14:53,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:14:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:14:53,907 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:14:53,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675653153] [2019-12-07 20:14:53,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:14:53,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:14:53,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040641369] [2019-12-07 20:14:53,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 20:14:53,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:14:53,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 20:14:53,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:14:53,908 INFO L87 Difference]: Start difference. First operand 19838 states and 59880 transitions. Second operand 7 states. [2019-12-07 20:14:54,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:14:54,532 INFO L93 Difference]: Finished difference Result 27351 states and 80470 transitions. [2019-12-07 20:14:54,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 20:14:54,532 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-07 20:14:54,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:14:54,562 INFO L225 Difference]: With dead ends: 27351 [2019-12-07 20:14:54,563 INFO L226 Difference]: Without dead ends: 27351 [2019-12-07 20:14:54,563 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:14:54,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27351 states. [2019-12-07 20:14:54,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27351 to 19289. [2019-12-07 20:14:54,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19289 states. [2019-12-07 20:14:54,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19289 states to 19289 states and 58283 transitions. [2019-12-07 20:14:54,900 INFO L78 Accepts]: Start accepts. Automaton has 19289 states and 58283 transitions. Word has length 33 [2019-12-07 20:14:54,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:14:54,901 INFO L462 AbstractCegarLoop]: Abstraction has 19289 states and 58283 transitions. [2019-12-07 20:14:54,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 20:14:54,901 INFO L276 IsEmpty]: Start isEmpty. Operand 19289 states and 58283 transitions. [2019-12-07 20:14:54,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 20:14:54,918 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:14:54,919 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:14:54,919 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:14:54,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:14:54,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1854368583, now seen corresponding path program 1 times [2019-12-07 20:14:54,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:14:54,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774656797] [2019-12-07 20:14:54,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:14:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:14:54,958 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:14:54,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774656797] [2019-12-07 20:14:54,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:14:54,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:14:54,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644123152] [2019-12-07 20:14:54,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:14:54,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:14:54,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:14:54,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:14:54,960 INFO L87 Difference]: Start difference. First operand 19289 states and 58283 transitions. Second operand 3 states. [2019-12-07 20:14:55,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:14:55,031 INFO L93 Difference]: Finished difference Result 18421 states and 54862 transitions. [2019-12-07 20:14:55,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:14:55,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-07 20:14:55,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:14:55,058 INFO L225 Difference]: With dead ends: 18421 [2019-12-07 20:14:55,058 INFO L226 Difference]: Without dead ends: 18421 [2019-12-07 20:14:55,058 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:14:55,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18421 states. [2019-12-07 20:14:55,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18421 to 18147. [2019-12-07 20:14:55,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18147 states. [2019-12-07 20:14:55,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18147 states to 18147 states and 54094 transitions. [2019-12-07 20:14:55,310 INFO L78 Accepts]: Start accepts. Automaton has 18147 states and 54094 transitions. Word has length 40 [2019-12-07 20:14:55,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:14:55,310 INFO L462 AbstractCegarLoop]: Abstraction has 18147 states and 54094 transitions. [2019-12-07 20:14:55,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:14:55,310 INFO L276 IsEmpty]: Start isEmpty. Operand 18147 states and 54094 transitions. [2019-12-07 20:14:55,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 20:14:55,324 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:14:55,325 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:14:55,325 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:14:55,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:14:55,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1843753540, now seen corresponding path program 1 times [2019-12-07 20:14:55,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:14:55,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78539747] [2019-12-07 20:14:55,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:14:55,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:14:55,364 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:14:55,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78539747] [2019-12-07 20:14:55,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:14:55,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:14:55,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893206311] [2019-12-07 20:14:55,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:14:55,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:14:55,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:14:55,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:14:55,365 INFO L87 Difference]: Start difference. First operand 18147 states and 54094 transitions. Second operand 5 states. [2019-12-07 20:14:55,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:14:55,421 INFO L93 Difference]: Finished difference Result 16651 states and 50821 transitions. [2019-12-07 20:14:55,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:14:55,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-07 20:14:55,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:14:55,439 INFO L225 Difference]: With dead ends: 16651 [2019-12-07 20:14:55,439 INFO L226 Difference]: Without dead ends: 16651 [2019-12-07 20:14:55,439 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:14:55,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16651 states. [2019-12-07 20:14:55,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16651 to 15033. [2019-12-07 20:14:55,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15033 states. [2019-12-07 20:14:55,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15033 states to 15033 states and 46041 transitions. [2019-12-07 20:14:55,677 INFO L78 Accepts]: Start accepts. Automaton has 15033 states and 46041 transitions. Word has length 41 [2019-12-07 20:14:55,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:14:55,678 INFO L462 AbstractCegarLoop]: Abstraction has 15033 states and 46041 transitions. [2019-12-07 20:14:55,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:14:55,678 INFO L276 IsEmpty]: Start isEmpty. Operand 15033 states and 46041 transitions. [2019-12-07 20:14:55,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 20:14:55,696 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:14:55,696 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:14:55,696 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:14:55,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:14:55,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1628177899, now seen corresponding path program 1 times [2019-12-07 20:14:55,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:14:55,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578813340] [2019-12-07 20:14:55,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:14:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:14:55,736 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:14:55,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578813340] [2019-12-07 20:14:55,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:14:55,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:14:55,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682323240] [2019-12-07 20:14:55,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:14:55,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:14:55,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:14:55,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:14:55,737 INFO L87 Difference]: Start difference. First operand 15033 states and 46041 transitions. Second operand 3 states. [2019-12-07 20:14:55,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:14:55,805 INFO L93 Difference]: Finished difference Result 19008 states and 57236 transitions. [2019-12-07 20:14:55,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:14:55,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 20:14:55,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:14:55,824 INFO L225 Difference]: With dead ends: 19008 [2019-12-07 20:14:55,824 INFO L226 Difference]: Without dead ends: 19008 [2019-12-07 20:14:55,825 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:14:55,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19008 states. [2019-12-07 20:14:56,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19008 to 14578. [2019-12-07 20:14:56,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14578 states. [2019-12-07 20:14:56,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14578 states to 14578 states and 44075 transitions. [2019-12-07 20:14:56,071 INFO L78 Accepts]: Start accepts. Automaton has 14578 states and 44075 transitions. Word has length 66 [2019-12-07 20:14:56,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:14:56,071 INFO L462 AbstractCegarLoop]: Abstraction has 14578 states and 44075 transitions. [2019-12-07 20:14:56,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:14:56,072 INFO L276 IsEmpty]: Start isEmpty. Operand 14578 states and 44075 transitions. [2019-12-07 20:14:56,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 20:14:56,084 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:14:56,084 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:14:56,085 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:14:56,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:14:56,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1017702190, now seen corresponding path program 1 times [2019-12-07 20:14:56,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:14:56,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918800800] [2019-12-07 20:14:56,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:14:56,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:14:56,137 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:14:56,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918800800] [2019-12-07 20:14:56,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:14:56,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:14:56,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458056074] [2019-12-07 20:14:56,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:14:56,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:14:56,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:14:56,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:14:56,138 INFO L87 Difference]: Start difference. First operand 14578 states and 44075 transitions. Second operand 3 states. [2019-12-07 20:14:56,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:14:56,206 INFO L93 Difference]: Finished difference Result 17447 states and 52826 transitions. [2019-12-07 20:14:56,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:14:56,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 20:14:56,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:14:56,232 INFO L225 Difference]: With dead ends: 17447 [2019-12-07 20:14:56,232 INFO L226 Difference]: Without dead ends: 17447 [2019-12-07 20:14:56,232 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:14:56,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17447 states. [2019-12-07 20:14:56,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17447 to 13814. [2019-12-07 20:14:56,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13814 states. [2019-12-07 20:14:56,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13814 states to 13814 states and 42123 transitions. [2019-12-07 20:14:56,471 INFO L78 Accepts]: Start accepts. Automaton has 13814 states and 42123 transitions. Word has length 66 [2019-12-07 20:14:56,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:14:56,471 INFO L462 AbstractCegarLoop]: Abstraction has 13814 states and 42123 transitions. [2019-12-07 20:14:56,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:14:56,471 INFO L276 IsEmpty]: Start isEmpty. Operand 13814 states and 42123 transitions. [2019-12-07 20:14:56,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 20:14:56,484 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:14:56,484 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:14:56,484 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:14:56,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:14:56,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1992119349, now seen corresponding path program 1 times [2019-12-07 20:14:56,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:14:56,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440874382] [2019-12-07 20:14:56,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:14:56,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:14:56,531 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:14:56,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440874382] [2019-12-07 20:14:56,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:14:56,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:14:56,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691031429] [2019-12-07 20:14:56,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:14:56,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:14:56,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:14:56,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:14:56,533 INFO L87 Difference]: Start difference. First operand 13814 states and 42123 transitions. Second operand 4 states. [2019-12-07 20:14:56,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:14:56,622 INFO L93 Difference]: Finished difference Result 13629 states and 41400 transitions. [2019-12-07 20:14:56,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:14:56,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-07 20:14:56,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:14:56,637 INFO L225 Difference]: With dead ends: 13629 [2019-12-07 20:14:56,637 INFO L226 Difference]: Without dead ends: 13629 [2019-12-07 20:14:56,637 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:14:56,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13629 states. [2019-12-07 20:14:56,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13629 to 12149. [2019-12-07 20:14:56,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12149 states. [2019-12-07 20:14:56,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12149 states to 12149 states and 36824 transitions. [2019-12-07 20:14:56,824 INFO L78 Accepts]: Start accepts. Automaton has 12149 states and 36824 transitions. Word has length 67 [2019-12-07 20:14:56,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:14:56,824 INFO L462 AbstractCegarLoop]: Abstraction has 12149 states and 36824 transitions. [2019-12-07 20:14:56,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:14:56,824 INFO L276 IsEmpty]: Start isEmpty. Operand 12149 states and 36824 transitions. [2019-12-07 20:14:56,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 20:14:56,833 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:14:56,833 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:14:56,833 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:14:56,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:14:56,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1668578459, now seen corresponding path program 1 times [2019-12-07 20:14:56,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:14:56,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652846503] [2019-12-07 20:14:56,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:14:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:14:57,072 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:14:57,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652846503] [2019-12-07 20:14:57,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:14:57,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 20:14:57,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585919667] [2019-12-07 20:14:57,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 20:14:57,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:14:57,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 20:14:57,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-07 20:14:57,074 INFO L87 Difference]: Start difference. First operand 12149 states and 36824 transitions. Second operand 10 states. [2019-12-07 20:14:57,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:14:57,956 INFO L93 Difference]: Finished difference Result 39871 states and 120835 transitions. [2019-12-07 20:14:57,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 20:14:57,956 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-07 20:14:57,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:14:57,996 INFO L225 Difference]: With dead ends: 39871 [2019-12-07 20:14:57,996 INFO L226 Difference]: Without dead ends: 35949 [2019-12-07 20:14:57,997 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-07 20:14:58,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35949 states. [2019-12-07 20:14:58,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35949 to 15172. [2019-12-07 20:14:58,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15172 states. [2019-12-07 20:14:58,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15172 states to 15172 states and 45681 transitions. [2019-12-07 20:14:58,365 INFO L78 Accepts]: Start accepts. Automaton has 15172 states and 45681 transitions. Word has length 67 [2019-12-07 20:14:58,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:14:58,365 INFO L462 AbstractCegarLoop]: Abstraction has 15172 states and 45681 transitions. [2019-12-07 20:14:58,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 20:14:58,366 INFO L276 IsEmpty]: Start isEmpty. Operand 15172 states and 45681 transitions. [2019-12-07 20:14:58,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 20:14:58,379 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:14:58,379 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:14:58,380 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:14:58,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:14:58,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1956141025, now seen corresponding path program 2 times [2019-12-07 20:14:58,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:14:58,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304990860] [2019-12-07 20:14:58,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:14:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:14:58,432 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:14:58,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304990860] [2019-12-07 20:14:58,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:14:58,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:14:58,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626258830] [2019-12-07 20:14:58,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:14:58,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:14:58,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:14:58,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:14:58,434 INFO L87 Difference]: Start difference. First operand 15172 states and 45681 transitions. Second operand 4 states. [2019-12-07 20:14:58,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:14:58,508 INFO L93 Difference]: Finished difference Result 23083 states and 69876 transitions. [2019-12-07 20:14:58,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:14:58,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-07 20:14:58,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:14:58,517 INFO L225 Difference]: With dead ends: 23083 [2019-12-07 20:14:58,517 INFO L226 Difference]: Without dead ends: 8705 [2019-12-07 20:14:58,518 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:14:58,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8705 states. [2019-12-07 20:14:58,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8705 to 8705. [2019-12-07 20:14:58,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8705 states. [2019-12-07 20:14:58,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8705 states to 8705 states and 26532 transitions. [2019-12-07 20:14:58,656 INFO L78 Accepts]: Start accepts. Automaton has 8705 states and 26532 transitions. Word has length 67 [2019-12-07 20:14:58,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:14:58,656 INFO L462 AbstractCegarLoop]: Abstraction has 8705 states and 26532 transitions. [2019-12-07 20:14:58,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:14:58,656 INFO L276 IsEmpty]: Start isEmpty. Operand 8705 states and 26532 transitions. [2019-12-07 20:14:58,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 20:14:58,663 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:14:58,663 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:14:58,664 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:14:58,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:14:58,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1541701607, now seen corresponding path program 3 times [2019-12-07 20:14:58,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:14:58,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782509303] [2019-12-07 20:14:58,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:14:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:14:58,729 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:14:58,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782509303] [2019-12-07 20:14:58,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:14:58,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:14:58,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048965823] [2019-12-07 20:14:58,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:14:58,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:14:58,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:14:58,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:14:58,731 INFO L87 Difference]: Start difference. First operand 8705 states and 26532 transitions. Second operand 4 states. [2019-12-07 20:14:58,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:14:58,784 INFO L93 Difference]: Finished difference Result 15196 states and 46595 transitions. [2019-12-07 20:14:58,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:14:58,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-07 20:14:58,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:14:58,794 INFO L225 Difference]: With dead ends: 15196 [2019-12-07 20:14:58,794 INFO L226 Difference]: Without dead ends: 6996 [2019-12-07 20:14:58,795 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:14:58,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6996 states. [2019-12-07 20:14:58,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6996 to 6996. [2019-12-07 20:14:58,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6996 states. [2019-12-07 20:14:58,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6996 states to 6996 states and 21488 transitions. [2019-12-07 20:14:58,915 INFO L78 Accepts]: Start accepts. Automaton has 6996 states and 21488 transitions. Word has length 67 [2019-12-07 20:14:58,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:14:58,915 INFO L462 AbstractCegarLoop]: Abstraction has 6996 states and 21488 transitions. [2019-12-07 20:14:58,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:14:58,915 INFO L276 IsEmpty]: Start isEmpty. Operand 6996 states and 21488 transitions. [2019-12-07 20:14:58,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 20:14:58,921 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:14:58,921 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:58,921 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:14:58,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:14:58,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1000943315, now seen corresponding path program 4 times [2019-12-07 20:14:58,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:14:58,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264193284] [2019-12-07 20:14:58,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:14:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:14:59,036 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:14:59,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264193284] [2019-12-07 20:14:59,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:14:59,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 20:14:59,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968950875] [2019-12-07 20:14:59,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 20:14:59,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:14:59,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 20:14:59,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-07 20:14:59,037 INFO L87 Difference]: Start difference. First operand 6996 states and 21488 transitions. Second operand 10 states. [2019-12-07 20:14:59,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:14:59,815 INFO L93 Difference]: Finished difference Result 15556 states and 46499 transitions. [2019-12-07 20:14:59,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 20:14:59,815 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-07 20:14:59,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:14:59,824 INFO L225 Difference]: With dead ends: 15556 [2019-12-07 20:14:59,825 INFO L226 Difference]: Without dead ends: 10306 [2019-12-07 20:14:59,825 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-12-07 20:14:59,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10306 states. [2019-12-07 20:14:59,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10306 to 8520. [2019-12-07 20:14:59,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8520 states. [2019-12-07 20:14:59,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8520 states to 8520 states and 25801 transitions. [2019-12-07 20:14:59,968 INFO L78 Accepts]: Start accepts. Automaton has 8520 states and 25801 transitions. Word has length 67 [2019-12-07 20:14:59,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:14:59,968 INFO L462 AbstractCegarLoop]: Abstraction has 8520 states and 25801 transitions. [2019-12-07 20:14:59,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 20:14:59,968 INFO L276 IsEmpty]: Start isEmpty. Operand 8520 states and 25801 transitions. [2019-12-07 20:14:59,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 20:14:59,975 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:14:59,975 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:14:59,975 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:14:59,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:14:59,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1387520431, now seen corresponding path program 5 times [2019-12-07 20:14:59,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:14:59,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006242529] [2019-12-07 20:14:59,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:14:59,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:15:00,129 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:15:00,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006242529] [2019-12-07 20:15:00,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:15:00,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 20:15:00,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631054679] [2019-12-07 20:15:00,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 20:15:00,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:15:00,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 20:15:00,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 20:15:00,130 INFO L87 Difference]: Start difference. First operand 8520 states and 25801 transitions. Second operand 10 states. [2019-12-07 20:15:00,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:15:00,673 INFO L93 Difference]: Finished difference Result 16085 states and 47898 transitions. [2019-12-07 20:15:00,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 20:15:00,673 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-07 20:15:00,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:15:00,691 INFO L225 Difference]: With dead ends: 16085 [2019-12-07 20:15:00,691 INFO L226 Difference]: Without dead ends: 13722 [2019-12-07 20:15:00,692 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2019-12-07 20:15:00,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13722 states. [2019-12-07 20:15:00,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13722 to 10996. [2019-12-07 20:15:00,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10996 states. [2019-12-07 20:15:00,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10996 states to 10996 states and 33194 transitions. [2019-12-07 20:15:00,888 INFO L78 Accepts]: Start accepts. Automaton has 10996 states and 33194 transitions. Word has length 67 [2019-12-07 20:15:00,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:15:00,889 INFO L462 AbstractCegarLoop]: Abstraction has 10996 states and 33194 transitions. [2019-12-07 20:15:00,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 20:15:00,889 INFO L276 IsEmpty]: Start isEmpty. Operand 10996 states and 33194 transitions. [2019-12-07 20:15:00,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 20:15:00,898 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:15:00,898 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:15:00,898 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:15:00,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:15:00,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1418038161, now seen corresponding path program 6 times [2019-12-07 20:15:00,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:15:00,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797834123] [2019-12-07 20:15:00,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:15:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:15:01,001 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:15:01,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797834123] [2019-12-07 20:15:01,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:15:01,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 20:15:01,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100844680] [2019-12-07 20:15:01,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 20:15:01,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:15:01,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 20:15:01,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 20:15:01,002 INFO L87 Difference]: Start difference. First operand 10996 states and 33194 transitions. Second operand 10 states. [2019-12-07 20:15:01,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:15:01,362 INFO L93 Difference]: Finished difference Result 13976 states and 41350 transitions. [2019-12-07 20:15:01,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 20:15:01,363 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-07 20:15:01,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:15:01,376 INFO L225 Difference]: With dead ends: 13976 [2019-12-07 20:15:01,376 INFO L226 Difference]: Without dead ends: 11261 [2019-12-07 20:15:01,376 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-07 20:15:01,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11261 states. [2019-12-07 20:15:01,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11261 to 8801. [2019-12-07 20:15:01,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8801 states. [2019-12-07 20:15:01,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8801 states to 8801 states and 26354 transitions. [2019-12-07 20:15:01,529 INFO L78 Accepts]: Start accepts. Automaton has 8801 states and 26354 transitions. Word has length 67 [2019-12-07 20:15:01,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:15:01,530 INFO L462 AbstractCegarLoop]: Abstraction has 8801 states and 26354 transitions. [2019-12-07 20:15:01,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 20:15:01,530 INFO L276 IsEmpty]: Start isEmpty. Operand 8801 states and 26354 transitions. [2019-12-07 20:15:01,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 20:15:01,537 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:15:01,537 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:15:01,537 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:15:01,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:15:01,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1156359029, now seen corresponding path program 7 times [2019-12-07 20:15:01,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:15:01,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296952634] [2019-12-07 20:15:01,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:15:01,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:15:01,931 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:15:01,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296952634] [2019-12-07 20:15:01,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:15:01,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-07 20:15:01,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958779745] [2019-12-07 20:15:01,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 20:15:01,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:15:01,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 20:15:01,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-12-07 20:15:01,932 INFO L87 Difference]: Start difference. First operand 8801 states and 26354 transitions. Second operand 17 states. [2019-12-07 20:15:03,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:15:03,183 INFO L93 Difference]: Finished difference Result 11227 states and 32613 transitions. [2019-12-07 20:15:03,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 20:15:03,183 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-07 20:15:03,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:15:03,191 INFO L225 Difference]: With dead ends: 11227 [2019-12-07 20:15:03,191 INFO L226 Difference]: Without dead ends: 9304 [2019-12-07 20:15:03,192 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=213, Invalid=1347, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 20:15:03,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9304 states. [2019-12-07 20:15:03,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9304 to 8608. [2019-12-07 20:15:03,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8608 states. [2019-12-07 20:15:03,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8608 states to 8608 states and 25332 transitions. [2019-12-07 20:15:03,319 INFO L78 Accepts]: Start accepts. Automaton has 8608 states and 25332 transitions. Word has length 67 [2019-12-07 20:15:03,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:15:03,320 INFO L462 AbstractCegarLoop]: Abstraction has 8608 states and 25332 transitions. [2019-12-07 20:15:03,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 20:15:03,320 INFO L276 IsEmpty]: Start isEmpty. Operand 8608 states and 25332 transitions. [2019-12-07 20:15:03,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 20:15:03,326 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:15:03,326 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:15:03,327 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:15:03,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:15:03,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1637609447, now seen corresponding path program 8 times [2019-12-07 20:15:03,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:15:03,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240951300] [2019-12-07 20:15:03,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:15:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:15:03,451 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:15:03,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240951300] [2019-12-07 20:15:03,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:15:03,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 20:15:03,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185026845] [2019-12-07 20:15:03,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 20:15:03,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:15:03,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 20:15:03,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 20:15:03,452 INFO L87 Difference]: Start difference. First operand 8608 states and 25332 transitions. Second operand 11 states. [2019-12-07 20:15:04,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:15:04,128 INFO L93 Difference]: Finished difference Result 13996 states and 40463 transitions. [2019-12-07 20:15:04,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 20:15:04,128 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 20:15:04,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:15:04,138 INFO L225 Difference]: With dead ends: 13996 [2019-12-07 20:15:04,138 INFO L226 Difference]: Without dead ends: 11113 [2019-12-07 20:15:04,138 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:15:04,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11113 states. [2019-12-07 20:15:04,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11113 to 8524. [2019-12-07 20:15:04,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8524 states. [2019-12-07 20:15:04,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8524 states to 8524 states and 25056 transitions. [2019-12-07 20:15:04,278 INFO L78 Accepts]: Start accepts. Automaton has 8524 states and 25056 transitions. Word has length 67 [2019-12-07 20:15:04,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:15:04,278 INFO L462 AbstractCegarLoop]: Abstraction has 8524 states and 25056 transitions. [2019-12-07 20:15:04,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 20:15:04,278 INFO L276 IsEmpty]: Start isEmpty. Operand 8524 states and 25056 transitions. [2019-12-07 20:15:04,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 20:15:04,285 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:15:04,285 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:15:04,285 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:15:04,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:15:04,286 INFO L82 PathProgramCache]: Analyzing trace with hash 187570937, now seen corresponding path program 9 times [2019-12-07 20:15:04,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:15:04,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732969508] [2019-12-07 20:15:04,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:15:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:15:04,420 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:15:04,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732969508] [2019-12-07 20:15:04,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:15:04,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 20:15:04,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390000178] [2019-12-07 20:15:04,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 20:15:04,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:15:04,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 20:15:04,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 20:15:04,421 INFO L87 Difference]: Start difference. First operand 8524 states and 25056 transitions. Second operand 11 states. [2019-12-07 20:15:04,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:15:04,891 INFO L93 Difference]: Finished difference Result 13204 states and 38333 transitions. [2019-12-07 20:15:04,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 20:15:04,892 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 20:15:04,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:15:04,900 INFO L225 Difference]: With dead ends: 13204 [2019-12-07 20:15:04,900 INFO L226 Difference]: Without dead ends: 9741 [2019-12-07 20:15:04,901 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=716, Unknown=0, NotChecked=0, Total=870 [2019-12-07 20:15:04,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9741 states. [2019-12-07 20:15:05,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9741 to 7572. [2019-12-07 20:15:05,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7572 states. [2019-12-07 20:15:05,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7572 states to 7572 states and 22330 transitions. [2019-12-07 20:15:05,025 INFO L78 Accepts]: Start accepts. Automaton has 7572 states and 22330 transitions. Word has length 67 [2019-12-07 20:15:05,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:15:05,025 INFO L462 AbstractCegarLoop]: Abstraction has 7572 states and 22330 transitions. [2019-12-07 20:15:05,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 20:15:05,026 INFO L276 IsEmpty]: Start isEmpty. Operand 7572 states and 22330 transitions. [2019-12-07 20:15:05,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 20:15:05,031 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:15:05,031 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:15:05,032 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:15:05,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:15:05,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1748623595, now seen corresponding path program 10 times [2019-12-07 20:15:05,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:15:05,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046169783] [2019-12-07 20:15:05,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:15:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 20:15:05,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 20:15:05,102 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 20:15:05,102 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 20:15:05,104 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) (= 0 v_~__unbuffered_p0_EAX~0_176) (= v_~__unbuffered_p1_EBX~0_38 0) (= 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|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t867~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) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t867~0.base_25| 1)) (= |v_#NULL.offset_4| 0) (= 0 v_~b$w_buff0~0_250) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t867~0.base_25|) (= v_~__unbuffered_cnt~0_137 0) (= 0 |v_ULTIMATE.start_main_~#t867~0.offset_17|) (= 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) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t867~0.base_25| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t867~0.base_25|) |v_ULTIMATE.start_main_~#t867~0.offset_17| 0))) (= 0 v_~b$read_delayed_var~0.base_7) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t867~0.base_25| 4) |v_#length_25|) (= 0 v_~b$r_buff0_thd1~0_323))) 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_~#t868~0.offset=|v_ULTIMATE.start_main_~#t868~0.offset_17|, 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_~#t867~0.base=|v_ULTIMATE.start_main_~#t867~0.base_25|, 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, #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, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_~#t867~0.offset=|v_ULTIMATE.start_main_~#t867~0.offset_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_~#t869~0.base=|v_ULTIMATE.start_main_~#t869~0.base_21|, ULTIMATE.start_main_~#t869~0.offset=|v_ULTIMATE.start_main_~#t869~0.offset_17|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_450, ~y~0=v_~y~0_19, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_222, ~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_~#t868~0.base=|v_ULTIMATE.start_main_~#t868~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_~#t868~0.offset, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t867~0.base, 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, #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, ~weak$$choice0~0, ULTIMATE.start_main_~#t867~0.offset, ~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_~#t869~0.base, ULTIMATE.start_main_~#t869~0.offset, ULTIMATE.start_main_#t~ite51, ~b$w_buff1_used~0, ~y~0, ~b$r_buff1_thd2~0, ~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_~#t868~0.base, ~z~0, ~weak$$choice2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-07 20:15:05,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L842-1-->L844: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t868~0.base_10|)) (= |v_ULTIMATE.start_main_~#t868~0.offset_9| 0) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t868~0.base_10| 1) |v_#valid_27|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t868~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t868~0.base_10|) |v_ULTIMATE.start_main_~#t868~0.offset_9| 1)) |v_#memory_int_11|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t868~0.base_10|) 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t868~0.base_10| 4) |v_#length_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t868~0.base_10|)) 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_~#t868~0.offset=|v_ULTIMATE.start_main_~#t868~0.offset_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t868~0.base=|v_ULTIMATE.start_main_~#t868~0.base_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t868~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t868~0.base, #length] because there is no mapped edge [2019-12-07 20:15:05,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L844-1-->L846: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t869~0.base_13|) (= |v_ULTIMATE.start_main_~#t869~0.offset_11| 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t869~0.base_13| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t869~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t869~0.base_13|) |v_ULTIMATE.start_main_~#t869~0.offset_11| 2)) |v_#memory_int_15|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t869~0.base_13| 1)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t869~0.base_13|)) (not (= |v_ULTIMATE.start_main_~#t869~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t869~0.base=|v_ULTIMATE.start_main_~#t869~0.base_13|, ULTIMATE.start_main_~#t869~0.offset=|v_ULTIMATE.start_main_~#t869~0.offset_11|, #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|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t869~0.base, ULTIMATE.start_main_~#t869~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-07 20:15:05,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L4-->L754: Formula: (and (= ~__unbuffered_p0_EAX~0_Out1935730888 ~x~0_In1935730888) (= ~b$r_buff1_thd2~0_Out1935730888 ~b$r_buff0_thd2~0_In1935730888) (= ~b$r_buff0_thd1~0_Out1935730888 1) (not (= 0 P0Thread1of1ForFork2___VERIFIER_assert_~expression_In1935730888)) (= ~b$r_buff1_thd1~0_Out1935730888 ~b$r_buff0_thd1~0_In1935730888) (= ~b$r_buff1_thd0~0_Out1935730888 ~b$r_buff0_thd0~0_In1935730888) (= ~b$r_buff1_thd3~0_Out1935730888 ~b$r_buff0_thd3~0_In1935730888)) InVars {~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1935730888, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1935730888, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1935730888, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In1935730888, ~x~0=~x~0_In1935730888, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1935730888} OutVars{~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out1935730888, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1935730888, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out1935730888, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1935730888, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_Out1935730888, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_Out1935730888, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In1935730888, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_Out1935730888, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_Out1935730888, ~x~0=~x~0_In1935730888, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1935730888} 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:15:05,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L780-2-->L780-4: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff1_used~0_In1442892500 256))) (.cse0 (= 0 (mod ~b$r_buff1_thd2~0_In1442892500 256)))) (or (and (= ~b~0_In1442892500 |P1Thread1of1ForFork0_#t~ite9_Out1442892500|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork0_#t~ite9_Out1442892500| ~b$w_buff1~0_In1442892500)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In1442892500, ~b~0=~b~0_In1442892500, ~b$w_buff1~0=~b$w_buff1~0_In1442892500, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1442892500} OutVars{~b$w_buff1_used~0=~b$w_buff1_used~0_In1442892500, ~b~0=~b~0_In1442892500, ~b$w_buff1~0=~b$w_buff1~0_In1442892500, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out1442892500|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1442892500} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-07 20:15:05,108 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:15:05,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~b$w_buff0_used~0_In-6436047 256) 0)) (.cse0 (= 0 (mod ~b$r_buff0_thd2~0_In-6436047 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite11_Out-6436047|) (not .cse1)) (and (= ~b$w_buff0_used~0_In-6436047 |P1Thread1of1ForFork0_#t~ite11_Out-6436047|) (or .cse1 .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-6436047, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-6436047} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-6436047, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-6436047, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out-6436047|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-07 20:15:05,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L782-->L782-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd2~0_In-1585101839 256) 0)) (.cse0 (= (mod ~b$w_buff0_used~0_In-1585101839 256) 0)) (.cse2 (= (mod ~b$w_buff1_used~0_In-1585101839 256) 0)) (.cse3 (= 0 (mod ~b$r_buff1_thd2~0_In-1585101839 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite12_Out-1585101839| ~b$w_buff1_used~0_In-1585101839) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite12_Out-1585101839| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1585101839, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1585101839, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1585101839, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-1585101839} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1585101839, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1585101839, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1585101839, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out-1585101839|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-1585101839} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-07 20:15:05,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L783-->L783-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd2~0_In-2128902244 256) 0)) (.cse0 (= (mod ~b$w_buff0_used~0_In-2128902244 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite13_Out-2128902244| ~b$r_buff0_thd2~0_In-2128902244) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork0_#t~ite13_Out-2128902244| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-2128902244, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-2128902244} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-2128902244, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-2128902244, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out-2128902244|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-07 20:15:05,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L784-->L784-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd2~0_In114749455 256) 0)) (.cse0 (= (mod ~b$w_buff0_used~0_In114749455 256) 0)) (.cse3 (= 0 (mod ~b$w_buff1_used~0_In114749455 256))) (.cse2 (= (mod ~b$r_buff1_thd2~0_In114749455 256) 0))) (or (and (= ~b$r_buff1_thd2~0_In114749455 |P1Thread1of1ForFork0_#t~ite14_Out114749455|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork0_#t~ite14_Out114749455|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In114749455, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In114749455, ~b$w_buff1_used~0=~b$w_buff1_used~0_In114749455, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In114749455} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In114749455, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In114749455, ~b$w_buff1_used~0=~b$w_buff1_used~0_In114749455, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out114749455|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In114749455} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-07 20:15:05,109 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:15:05,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L808-->L808-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In271387174 256) 0))) (or (and (= ~b$w_buff0~0_In271387174 |P2Thread1of1ForFork1_#t~ite21_Out271387174|) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite20_In271387174| |P2Thread1of1ForFork1_#t~ite20_Out271387174|)) (and (let ((.cse1 (= (mod ~b$r_buff0_thd3~0_In271387174 256) 0))) (or (and (= 0 (mod ~b$r_buff1_thd3~0_In271387174 256)) .cse1) (= (mod ~b$w_buff0_used~0_In271387174 256) 0) (and (= (mod ~b$w_buff1_used~0_In271387174 256) 0) .cse1))) (= ~b$w_buff0~0_In271387174 |P2Thread1of1ForFork1_#t~ite20_Out271387174|) (= |P2Thread1of1ForFork1_#t~ite21_Out271387174| |P2Thread1of1ForFork1_#t~ite20_Out271387174|) .cse0))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In271387174, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In271387174, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In271387174|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In271387174, ~b$w_buff0~0=~b$w_buff0~0_In271387174, ~weak$$choice2~0=~weak$$choice2~0_In271387174, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In271387174} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In271387174, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In271387174, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out271387174|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out271387174|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In271387174, ~b$w_buff0~0=~b$w_buff0~0_In271387174, ~weak$$choice2~0=~weak$$choice2~0_In271387174, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In271387174} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 20:15:05,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L810-->L810-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1041411881 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite26_In1041411881| |P2Thread1of1ForFork1_#t~ite26_Out1041411881|) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite27_Out1041411881| ~b$w_buff0_used~0_In1041411881)) (and .cse0 (= |P2Thread1of1ForFork1_#t~ite26_Out1041411881| ~b$w_buff0_used~0_In1041411881) (let ((.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In1041411881 256)))) (or (= (mod ~b$w_buff0_used~0_In1041411881 256) 0) (and .cse1 (= 0 (mod ~b$w_buff1_used~0_In1041411881 256))) (and .cse1 (= (mod ~b$r_buff1_thd3~0_In1041411881 256) 0)))) (= |P2Thread1of1ForFork1_#t~ite26_Out1041411881| |P2Thread1of1ForFork1_#t~ite27_Out1041411881|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1041411881, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1041411881, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In1041411881|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1041411881, ~weak$$choice2~0=~weak$$choice2~0_In1041411881, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1041411881} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1041411881, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out1041411881|, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1041411881, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out1041411881|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1041411881, ~weak$$choice2~0=~weak$$choice2~0_In1041411881, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1041411881} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-07 20:15:05,112 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:15:05,113 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:15:05,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L819-2-->L819-4: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff1_thd3~0_In-451554226 256))) (.cse1 (= (mod ~b$w_buff1_used~0_In-451554226 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite38_Out-451554226| ~b~0_In-451554226) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~b$w_buff1~0_In-451554226 |P2Thread1of1ForFork1_#t~ite38_Out-451554226|)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In-451554226, ~b~0=~b~0_In-451554226, ~b$w_buff1~0=~b$w_buff1~0_In-451554226, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-451554226} OutVars{P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out-451554226|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-451554226, ~b~0=~b~0_In-451554226, ~b$w_buff1~0=~b$w_buff1~0_In-451554226, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-451554226} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-07 20:15:05,114 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:15:05,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In-1303366422 256) 0)) (.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In-1303366422 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite40_Out-1303366422| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~b$w_buff0_used~0_In-1303366422 |P2Thread1of1ForFork1_#t~ite40_Out-1303366422|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1303366422, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1303366422} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1303366422, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1303366422, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out-1303366422|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-07 20:15:05,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L821-->L821-2: Formula: (let ((.cse2 (= (mod ~b$w_buff0_used~0_In-977118759 256) 0)) (.cse3 (= 0 (mod ~b$r_buff0_thd3~0_In-977118759 256))) (.cse0 (= (mod ~b$r_buff1_thd3~0_In-977118759 256) 0)) (.cse1 (= 0 (mod ~b$w_buff1_used~0_In-977118759 256)))) (or (and (or .cse0 .cse1) (= ~b$w_buff1_used~0_In-977118759 |P2Thread1of1ForFork1_#t~ite41_Out-977118759|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork1_#t~ite41_Out-977118759|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-977118759, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-977118759, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-977118759, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-977118759} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-977118759, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-977118759, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-977118759, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out-977118759|, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-977118759} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-07 20:15:05,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In1740454497 256))) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In1740454497 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite42_Out1740454497| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite42_Out1740454497| ~b$r_buff0_thd3~0_In1740454497) (or .cse1 .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1740454497, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1740454497} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1740454497, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1740454497, P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out1740454497|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-07 20:15:05,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff0_thd3~0_In-937894682 256))) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In-937894682 256))) (.cse3 (= 0 (mod ~b$r_buff1_thd3~0_In-937894682 256))) (.cse2 (= 0 (mod ~b$w_buff1_used~0_In-937894682 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite43_Out-937894682| ~b$r_buff1_thd3~0_In-937894682) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite43_Out-937894682| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-937894682, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-937894682, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-937894682, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-937894682} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-937894682, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-937894682, P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out-937894682|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-937894682, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-937894682} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-07 20:15:05,115 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:15:05,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L755-->L755-2: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff0_thd1~0_In2098222730 256))) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In2098222730 256)))) (or (and (or .cse0 .cse1) (= ~b$w_buff0_used~0_In2098222730 |P0Thread1of1ForFork2_#t~ite5_Out2098222730|)) (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite5_Out2098222730| 0) (not .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In2098222730, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In2098222730} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In2098222730, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In2098222730, P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out2098222730|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-07 20:15:05,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L756-->L756-2: Formula: (let ((.cse3 (= (mod ~b$r_buff1_thd1~0_In-1928924319 256) 0)) (.cse2 (= 0 (mod ~b$w_buff1_used~0_In-1928924319 256))) (.cse1 (= (mod ~b$w_buff0_used~0_In-1928924319 256) 0)) (.cse0 (= (mod ~b$r_buff0_thd1~0_In-1928924319 256) 0))) (or (and (or .cse0 .cse1) (= ~b$w_buff1_used~0_In-1928924319 |P0Thread1of1ForFork2_#t~ite6_Out-1928924319|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork2_#t~ite6_Out-1928924319|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1928924319, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1928924319, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-1928924319, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1928924319} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1928924319, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1928924319, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-1928924319, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1928924319, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out-1928924319|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-07 20:15:05,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L757-->L758: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff0_thd1~0_In-1154043594 256))) (.cse0 (= (mod ~b$w_buff0_used~0_In-1154043594 256) 0)) (.cse2 (= ~b$r_buff0_thd1~0_Out-1154043594 ~b$r_buff0_thd1~0_In-1154043594))) (or (and (not .cse0) (= ~b$r_buff0_thd1~0_Out-1154043594 0) (not .cse1)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1154043594, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1154043594} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1154043594, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out-1154043594, P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out-1154043594|} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-07 20:15:05,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L758-->L758-2: Formula: (let ((.cse1 (= (mod ~b$w_buff1_used~0_In1426044151 256) 0)) (.cse0 (= 0 (mod ~b$r_buff1_thd1~0_In1426044151 256))) (.cse2 (= (mod ~b$r_buff0_thd1~0_In1426044151 256) 0)) (.cse3 (= 0 (mod ~b$w_buff0_used~0_In1426044151 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite8_Out1426044151| ~b$r_buff1_thd1~0_In1426044151) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork2_#t~ite8_Out1426044151| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1426044151, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1426044151, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In1426044151, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1426044151} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1426044151, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1426044151, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In1426044151, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1426044151, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out1426044151|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-07 20:15:05,116 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:15:05,116 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:15:05,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L852-2-->L852-4: Formula: (let ((.cse0 (= (mod ~b$w_buff1_used~0_In-262341295 256) 0)) (.cse1 (= (mod ~b$r_buff1_thd0~0_In-262341295 256) 0))) (or (and (not .cse0) (not .cse1) (= ~b$w_buff1~0_In-262341295 |ULTIMATE.start_main_#t~ite47_Out-262341295|)) (and (or .cse0 .cse1) (= ~b~0_In-262341295 |ULTIMATE.start_main_#t~ite47_Out-262341295|)))) InVars {~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-262341295, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-262341295, ~b~0=~b~0_In-262341295, ~b$w_buff1~0=~b$w_buff1~0_In-262341295} OutVars{~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-262341295, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-262341295, ~b~0=~b~0_In-262341295, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-262341295|, ~b$w_buff1~0=~b$w_buff1~0_In-262341295} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 20:15:05,117 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:15:05,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L853-->L853-2: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff0_used~0_In1189180660 256))) (.cse1 (= 0 (mod ~b$r_buff0_thd0~0_In1189180660 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out1189180660|) (not .cse1)) (and (or .cse0 .cse1) (= ~b$w_buff0_used~0_In1189180660 |ULTIMATE.start_main_#t~ite49_Out1189180660|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1189180660, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1189180660} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1189180660, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1189180660|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1189180660} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 20:15:05,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L854-->L854-2: Formula: (let ((.cse2 (= 0 (mod ~b$r_buff1_thd0~0_In635798529 256))) (.cse3 (= (mod ~b$w_buff1_used~0_In635798529 256) 0)) (.cse1 (= (mod ~b$w_buff0_used~0_In635798529 256) 0)) (.cse0 (= (mod ~b$r_buff0_thd0~0_In635798529 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~b$w_buff1_used~0_In635798529 |ULTIMATE.start_main_#t~ite50_Out635798529|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite50_Out635798529|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In635798529, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In635798529, ~b$w_buff1_used~0=~b$w_buff1_used~0_In635798529, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In635798529} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out635798529|, ~b$w_buff0_used~0=~b$w_buff0_used~0_In635798529, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In635798529, ~b$w_buff1_used~0=~b$w_buff1_used~0_In635798529, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In635798529} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 20:15:05,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L855-->L855-2: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff0_used~0_In-725845716 256))) (.cse0 (= (mod ~b$r_buff0_thd0~0_In-725845716 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-725845716| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite51_Out-725845716| ~b$r_buff0_thd0~0_In-725845716)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-725845716, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-725845716} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-725845716, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-725845716|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-725845716} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 20:15:05,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L856-->L856-2: Formula: (let ((.cse2 (= 0 (mod ~b$r_buff1_thd0~0_In1967251826 256))) (.cse3 (= 0 (mod ~b$w_buff1_used~0_In1967251826 256))) (.cse0 (= (mod ~b$w_buff0_used~0_In1967251826 256) 0)) (.cse1 (= (mod ~b$r_buff0_thd0~0_In1967251826 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out1967251826|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~b$r_buff1_thd0~0_In1967251826 |ULTIMATE.start_main_#t~ite52_Out1967251826|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1967251826, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In1967251826, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1967251826, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1967251826} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1967251826, ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1967251826|, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In1967251826, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1967251826, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1967251826} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 20:15:05,119 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:15:05,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 08:15:05 BasicIcfg [2019-12-07 20:15:05,173 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 20:15:05,174 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 20:15:05,174 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 20:15:05,174 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 20:15:05,174 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:13:12" (3/4) ... [2019-12-07 20:15:05,176 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 20:15:05,176 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) (= 0 v_~__unbuffered_p0_EAX~0_176) (= v_~__unbuffered_p1_EBX~0_38 0) (= 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|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t867~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) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t867~0.base_25| 1)) (= |v_#NULL.offset_4| 0) (= 0 v_~b$w_buff0~0_250) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t867~0.base_25|) (= v_~__unbuffered_cnt~0_137 0) (= 0 |v_ULTIMATE.start_main_~#t867~0.offset_17|) (= 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) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t867~0.base_25| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t867~0.base_25|) |v_ULTIMATE.start_main_~#t867~0.offset_17| 0))) (= 0 v_~b$read_delayed_var~0.base_7) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t867~0.base_25| 4) |v_#length_25|) (= 0 v_~b$r_buff0_thd1~0_323))) 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_~#t868~0.offset=|v_ULTIMATE.start_main_~#t868~0.offset_17|, 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_~#t867~0.base=|v_ULTIMATE.start_main_~#t867~0.base_25|, 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, #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, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_~#t867~0.offset=|v_ULTIMATE.start_main_~#t867~0.offset_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_~#t869~0.base=|v_ULTIMATE.start_main_~#t869~0.base_21|, ULTIMATE.start_main_~#t869~0.offset=|v_ULTIMATE.start_main_~#t869~0.offset_17|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_450, ~y~0=v_~y~0_19, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_222, ~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_~#t868~0.base=|v_ULTIMATE.start_main_~#t868~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_~#t868~0.offset, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t867~0.base, 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, #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, ~weak$$choice0~0, ULTIMATE.start_main_~#t867~0.offset, ~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_~#t869~0.base, ULTIMATE.start_main_~#t869~0.offset, ULTIMATE.start_main_#t~ite51, ~b$w_buff1_used~0, ~y~0, ~b$r_buff1_thd2~0, ~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_~#t868~0.base, ~z~0, ~weak$$choice2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-07 20:15:05,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L842-1-->L844: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t868~0.base_10|)) (= |v_ULTIMATE.start_main_~#t868~0.offset_9| 0) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t868~0.base_10| 1) |v_#valid_27|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t868~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t868~0.base_10|) |v_ULTIMATE.start_main_~#t868~0.offset_9| 1)) |v_#memory_int_11|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t868~0.base_10|) 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t868~0.base_10| 4) |v_#length_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t868~0.base_10|)) 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_~#t868~0.offset=|v_ULTIMATE.start_main_~#t868~0.offset_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t868~0.base=|v_ULTIMATE.start_main_~#t868~0.base_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t868~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t868~0.base, #length] because there is no mapped edge [2019-12-07 20:15:05,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L844-1-->L846: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t869~0.base_13|) (= |v_ULTIMATE.start_main_~#t869~0.offset_11| 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t869~0.base_13| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t869~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t869~0.base_13|) |v_ULTIMATE.start_main_~#t869~0.offset_11| 2)) |v_#memory_int_15|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t869~0.base_13| 1)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t869~0.base_13|)) (not (= |v_ULTIMATE.start_main_~#t869~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t869~0.base=|v_ULTIMATE.start_main_~#t869~0.base_13|, ULTIMATE.start_main_~#t869~0.offset=|v_ULTIMATE.start_main_~#t869~0.offset_11|, #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|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t869~0.base, ULTIMATE.start_main_~#t869~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-07 20:15:05,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L4-->L754: Formula: (and (= ~__unbuffered_p0_EAX~0_Out1935730888 ~x~0_In1935730888) (= ~b$r_buff1_thd2~0_Out1935730888 ~b$r_buff0_thd2~0_In1935730888) (= ~b$r_buff0_thd1~0_Out1935730888 1) (not (= 0 P0Thread1of1ForFork2___VERIFIER_assert_~expression_In1935730888)) (= ~b$r_buff1_thd1~0_Out1935730888 ~b$r_buff0_thd1~0_In1935730888) (= ~b$r_buff1_thd0~0_Out1935730888 ~b$r_buff0_thd0~0_In1935730888) (= ~b$r_buff1_thd3~0_Out1935730888 ~b$r_buff0_thd3~0_In1935730888)) InVars {~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1935730888, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1935730888, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1935730888, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In1935730888, ~x~0=~x~0_In1935730888, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1935730888} OutVars{~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out1935730888, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1935730888, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out1935730888, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1935730888, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_Out1935730888, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_Out1935730888, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In1935730888, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_Out1935730888, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_Out1935730888, ~x~0=~x~0_In1935730888, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1935730888} 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:15:05,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L780-2-->L780-4: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff1_used~0_In1442892500 256))) (.cse0 (= 0 (mod ~b$r_buff1_thd2~0_In1442892500 256)))) (or (and (= ~b~0_In1442892500 |P1Thread1of1ForFork0_#t~ite9_Out1442892500|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork0_#t~ite9_Out1442892500| ~b$w_buff1~0_In1442892500)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In1442892500, ~b~0=~b~0_In1442892500, ~b$w_buff1~0=~b$w_buff1~0_In1442892500, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1442892500} OutVars{~b$w_buff1_used~0=~b$w_buff1_used~0_In1442892500, ~b~0=~b~0_In1442892500, ~b$w_buff1~0=~b$w_buff1~0_In1442892500, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out1442892500|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1442892500} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-07 20:15:05,179 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:15:05,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~b$w_buff0_used~0_In-6436047 256) 0)) (.cse0 (= 0 (mod ~b$r_buff0_thd2~0_In-6436047 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite11_Out-6436047|) (not .cse1)) (and (= ~b$w_buff0_used~0_In-6436047 |P1Thread1of1ForFork0_#t~ite11_Out-6436047|) (or .cse1 .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-6436047, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-6436047} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-6436047, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-6436047, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out-6436047|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-07 20:15:05,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L782-->L782-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd2~0_In-1585101839 256) 0)) (.cse0 (= (mod ~b$w_buff0_used~0_In-1585101839 256) 0)) (.cse2 (= (mod ~b$w_buff1_used~0_In-1585101839 256) 0)) (.cse3 (= 0 (mod ~b$r_buff1_thd2~0_In-1585101839 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite12_Out-1585101839| ~b$w_buff1_used~0_In-1585101839) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite12_Out-1585101839| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1585101839, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1585101839, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1585101839, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-1585101839} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1585101839, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1585101839, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1585101839, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out-1585101839|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-1585101839} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-07 20:15:05,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L783-->L783-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd2~0_In-2128902244 256) 0)) (.cse0 (= (mod ~b$w_buff0_used~0_In-2128902244 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite13_Out-2128902244| ~b$r_buff0_thd2~0_In-2128902244) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork0_#t~ite13_Out-2128902244| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-2128902244, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-2128902244} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-2128902244, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-2128902244, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out-2128902244|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-07 20:15:05,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L784-->L784-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd2~0_In114749455 256) 0)) (.cse0 (= (mod ~b$w_buff0_used~0_In114749455 256) 0)) (.cse3 (= 0 (mod ~b$w_buff1_used~0_In114749455 256))) (.cse2 (= (mod ~b$r_buff1_thd2~0_In114749455 256) 0))) (or (and (= ~b$r_buff1_thd2~0_In114749455 |P1Thread1of1ForFork0_#t~ite14_Out114749455|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork0_#t~ite14_Out114749455|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In114749455, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In114749455, ~b$w_buff1_used~0=~b$w_buff1_used~0_In114749455, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In114749455} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In114749455, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In114749455, ~b$w_buff1_used~0=~b$w_buff1_used~0_In114749455, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out114749455|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In114749455} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-07 20:15:05,180 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:15:05,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L808-->L808-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In271387174 256) 0))) (or (and (= ~b$w_buff0~0_In271387174 |P2Thread1of1ForFork1_#t~ite21_Out271387174|) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite20_In271387174| |P2Thread1of1ForFork1_#t~ite20_Out271387174|)) (and (let ((.cse1 (= (mod ~b$r_buff0_thd3~0_In271387174 256) 0))) (or (and (= 0 (mod ~b$r_buff1_thd3~0_In271387174 256)) .cse1) (= (mod ~b$w_buff0_used~0_In271387174 256) 0) (and (= (mod ~b$w_buff1_used~0_In271387174 256) 0) .cse1))) (= ~b$w_buff0~0_In271387174 |P2Thread1of1ForFork1_#t~ite20_Out271387174|) (= |P2Thread1of1ForFork1_#t~ite21_Out271387174| |P2Thread1of1ForFork1_#t~ite20_Out271387174|) .cse0))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In271387174, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In271387174, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In271387174|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In271387174, ~b$w_buff0~0=~b$w_buff0~0_In271387174, ~weak$$choice2~0=~weak$$choice2~0_In271387174, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In271387174} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In271387174, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In271387174, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out271387174|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out271387174|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In271387174, ~b$w_buff0~0=~b$w_buff0~0_In271387174, ~weak$$choice2~0=~weak$$choice2~0_In271387174, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In271387174} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 20:15:05,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L810-->L810-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1041411881 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite26_In1041411881| |P2Thread1of1ForFork1_#t~ite26_Out1041411881|) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite27_Out1041411881| ~b$w_buff0_used~0_In1041411881)) (and .cse0 (= |P2Thread1of1ForFork1_#t~ite26_Out1041411881| ~b$w_buff0_used~0_In1041411881) (let ((.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In1041411881 256)))) (or (= (mod ~b$w_buff0_used~0_In1041411881 256) 0) (and .cse1 (= 0 (mod ~b$w_buff1_used~0_In1041411881 256))) (and .cse1 (= (mod ~b$r_buff1_thd3~0_In1041411881 256) 0)))) (= |P2Thread1of1ForFork1_#t~ite26_Out1041411881| |P2Thread1of1ForFork1_#t~ite27_Out1041411881|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1041411881, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1041411881, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In1041411881|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1041411881, ~weak$$choice2~0=~weak$$choice2~0_In1041411881, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1041411881} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1041411881, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out1041411881|, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1041411881, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out1041411881|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1041411881, ~weak$$choice2~0=~weak$$choice2~0_In1041411881, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1041411881} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-07 20:15:05,184 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:15:05,184 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:15:05,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L819-2-->L819-4: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff1_thd3~0_In-451554226 256))) (.cse1 (= (mod ~b$w_buff1_used~0_In-451554226 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite38_Out-451554226| ~b~0_In-451554226) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~b$w_buff1~0_In-451554226 |P2Thread1of1ForFork1_#t~ite38_Out-451554226|)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In-451554226, ~b~0=~b~0_In-451554226, ~b$w_buff1~0=~b$w_buff1~0_In-451554226, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-451554226} OutVars{P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out-451554226|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-451554226, ~b~0=~b~0_In-451554226, ~b$w_buff1~0=~b$w_buff1~0_In-451554226, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-451554226} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-07 20:15:05,185 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:15:05,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In-1303366422 256) 0)) (.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In-1303366422 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite40_Out-1303366422| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~b$w_buff0_used~0_In-1303366422 |P2Thread1of1ForFork1_#t~ite40_Out-1303366422|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1303366422, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1303366422} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1303366422, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1303366422, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out-1303366422|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-07 20:15:05,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L821-->L821-2: Formula: (let ((.cse2 (= (mod ~b$w_buff0_used~0_In-977118759 256) 0)) (.cse3 (= 0 (mod ~b$r_buff0_thd3~0_In-977118759 256))) (.cse0 (= (mod ~b$r_buff1_thd3~0_In-977118759 256) 0)) (.cse1 (= 0 (mod ~b$w_buff1_used~0_In-977118759 256)))) (or (and (or .cse0 .cse1) (= ~b$w_buff1_used~0_In-977118759 |P2Thread1of1ForFork1_#t~ite41_Out-977118759|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork1_#t~ite41_Out-977118759|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-977118759, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-977118759, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-977118759, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-977118759} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-977118759, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-977118759, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-977118759, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out-977118759|, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-977118759} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-07 20:15:05,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In1740454497 256))) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In1740454497 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite42_Out1740454497| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite42_Out1740454497| ~b$r_buff0_thd3~0_In1740454497) (or .cse1 .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1740454497, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1740454497} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1740454497, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1740454497, P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out1740454497|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-07 20:15:05,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff0_thd3~0_In-937894682 256))) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In-937894682 256))) (.cse3 (= 0 (mod ~b$r_buff1_thd3~0_In-937894682 256))) (.cse2 (= 0 (mod ~b$w_buff1_used~0_In-937894682 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite43_Out-937894682| ~b$r_buff1_thd3~0_In-937894682) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite43_Out-937894682| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-937894682, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-937894682, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-937894682, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-937894682} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-937894682, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-937894682, P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out-937894682|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-937894682, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-937894682} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-07 20:15:05,186 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:15:05,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L755-->L755-2: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff0_thd1~0_In2098222730 256))) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In2098222730 256)))) (or (and (or .cse0 .cse1) (= ~b$w_buff0_used~0_In2098222730 |P0Thread1of1ForFork2_#t~ite5_Out2098222730|)) (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite5_Out2098222730| 0) (not .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In2098222730, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In2098222730} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In2098222730, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In2098222730, P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out2098222730|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-07 20:15:05,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L756-->L756-2: Formula: (let ((.cse3 (= (mod ~b$r_buff1_thd1~0_In-1928924319 256) 0)) (.cse2 (= 0 (mod ~b$w_buff1_used~0_In-1928924319 256))) (.cse1 (= (mod ~b$w_buff0_used~0_In-1928924319 256) 0)) (.cse0 (= (mod ~b$r_buff0_thd1~0_In-1928924319 256) 0))) (or (and (or .cse0 .cse1) (= ~b$w_buff1_used~0_In-1928924319 |P0Thread1of1ForFork2_#t~ite6_Out-1928924319|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork2_#t~ite6_Out-1928924319|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1928924319, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1928924319, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-1928924319, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1928924319} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1928924319, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1928924319, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-1928924319, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1928924319, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out-1928924319|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-07 20:15:05,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L757-->L758: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff0_thd1~0_In-1154043594 256))) (.cse0 (= (mod ~b$w_buff0_used~0_In-1154043594 256) 0)) (.cse2 (= ~b$r_buff0_thd1~0_Out-1154043594 ~b$r_buff0_thd1~0_In-1154043594))) (or (and (not .cse0) (= ~b$r_buff0_thd1~0_Out-1154043594 0) (not .cse1)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1154043594, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1154043594} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1154043594, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out-1154043594, P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out-1154043594|} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-07 20:15:05,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L758-->L758-2: Formula: (let ((.cse1 (= (mod ~b$w_buff1_used~0_In1426044151 256) 0)) (.cse0 (= 0 (mod ~b$r_buff1_thd1~0_In1426044151 256))) (.cse2 (= (mod ~b$r_buff0_thd1~0_In1426044151 256) 0)) (.cse3 (= 0 (mod ~b$w_buff0_used~0_In1426044151 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite8_Out1426044151| ~b$r_buff1_thd1~0_In1426044151) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork2_#t~ite8_Out1426044151| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1426044151, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1426044151, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In1426044151, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1426044151} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1426044151, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1426044151, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In1426044151, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1426044151, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out1426044151|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-07 20:15:05,188 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:15:05,188 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:15:05,188 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L852-2-->L852-4: Formula: (let ((.cse0 (= (mod ~b$w_buff1_used~0_In-262341295 256) 0)) (.cse1 (= (mod ~b$r_buff1_thd0~0_In-262341295 256) 0))) (or (and (not .cse0) (not .cse1) (= ~b$w_buff1~0_In-262341295 |ULTIMATE.start_main_#t~ite47_Out-262341295|)) (and (or .cse0 .cse1) (= ~b~0_In-262341295 |ULTIMATE.start_main_#t~ite47_Out-262341295|)))) InVars {~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-262341295, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-262341295, ~b~0=~b~0_In-262341295, ~b$w_buff1~0=~b$w_buff1~0_In-262341295} OutVars{~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-262341295, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-262341295, ~b~0=~b~0_In-262341295, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-262341295|, ~b$w_buff1~0=~b$w_buff1~0_In-262341295} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 20:15:05,188 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:15:05,188 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L853-->L853-2: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff0_used~0_In1189180660 256))) (.cse1 (= 0 (mod ~b$r_buff0_thd0~0_In1189180660 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out1189180660|) (not .cse1)) (and (or .cse0 .cse1) (= ~b$w_buff0_used~0_In1189180660 |ULTIMATE.start_main_#t~ite49_Out1189180660|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1189180660, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1189180660} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1189180660, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1189180660|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1189180660} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 20:15:05,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L854-->L854-2: Formula: (let ((.cse2 (= 0 (mod ~b$r_buff1_thd0~0_In635798529 256))) (.cse3 (= (mod ~b$w_buff1_used~0_In635798529 256) 0)) (.cse1 (= (mod ~b$w_buff0_used~0_In635798529 256) 0)) (.cse0 (= (mod ~b$r_buff0_thd0~0_In635798529 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~b$w_buff1_used~0_In635798529 |ULTIMATE.start_main_#t~ite50_Out635798529|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite50_Out635798529|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In635798529, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In635798529, ~b$w_buff1_used~0=~b$w_buff1_used~0_In635798529, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In635798529} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out635798529|, ~b$w_buff0_used~0=~b$w_buff0_used~0_In635798529, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In635798529, ~b$w_buff1_used~0=~b$w_buff1_used~0_In635798529, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In635798529} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 20:15:05,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L855-->L855-2: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff0_used~0_In-725845716 256))) (.cse0 (= (mod ~b$r_buff0_thd0~0_In-725845716 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-725845716| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite51_Out-725845716| ~b$r_buff0_thd0~0_In-725845716)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-725845716, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-725845716} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-725845716, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-725845716|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-725845716} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 20:15:05,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L856-->L856-2: Formula: (let ((.cse2 (= 0 (mod ~b$r_buff1_thd0~0_In1967251826 256))) (.cse3 (= 0 (mod ~b$w_buff1_used~0_In1967251826 256))) (.cse0 (= (mod ~b$w_buff0_used~0_In1967251826 256) 0)) (.cse1 (= (mod ~b$r_buff0_thd0~0_In1967251826 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out1967251826|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~b$r_buff1_thd0~0_In1967251826 |ULTIMATE.start_main_#t~ite52_Out1967251826|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1967251826, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In1967251826, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1967251826, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1967251826} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1967251826, ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1967251826|, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In1967251826, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1967251826, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1967251826} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 20:15:05,190 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:15:05,243 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_49ba22cf-636f-44c9-89b0-9a9c1d73edb6/bin/utaipan/witness.graphml [2019-12-07 20:15:05,243 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 20:15:05,244 INFO L168 Benchmark]: Toolchain (without parser) took 113874.70 ms. Allocated memory was 1.0 GB in the beginning and 6.9 GB in the end (delta: 5.9 GB). Free memory was 932.7 MB in the beginning and 4.5 GB in the end (delta: -3.6 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2019-12-07 20:15:05,244 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:15:05,245 INFO L168 Benchmark]: CACSL2BoogieTranslator took 394.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.4 MB). Free memory was 932.7 MB in the beginning and 1.1 GB in the end (delta: -122.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:15:05,245 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.21 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:15:05,245 INFO L168 Benchmark]: Boogie Preprocessor took 27.18 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:15:05,245 INFO L168 Benchmark]: RCFGBuilder took 425.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 995.9 MB in the end (delta: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. [2019-12-07 20:15:05,246 INFO L168 Benchmark]: TraceAbstraction took 112916.55 ms. Allocated memory was 1.1 GB in the beginning and 6.9 GB in the end (delta: 5.8 GB). Free memory was 995.9 MB in the beginning and 4.5 GB in the end (delta: -3.5 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2019-12-07 20:15:05,246 INFO L168 Benchmark]: Witness Printer took 69.22 ms. Allocated memory is still 6.9 GB. Free memory was 4.5 GB in the beginning and 4.5 GB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 11.5 GB. [2019-12-07 20:15:05,247 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 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 394.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.4 MB). Free memory was 932.7 MB in the beginning and 1.1 GB in the end (delta: -122.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.21 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.18 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 425.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 995.9 MB in the end (delta: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 112916.55 ms. Allocated memory was 1.1 GB in the beginning and 6.9 GB in the end (delta: 5.8 GB). Free memory was 995.9 MB in the beginning and 4.5 GB in the end (delta: -3.5 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. * Witness Printer took 69.22 ms. Allocated memory is still 6.9 GB. Free memory was 4.5 GB in the beginning and 4.5 GB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 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: 1.0s, 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(&t867, ((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(&t868, ((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(&t869, ((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: 112.7s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 17.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5103 SDtfs, 7437 SDslu, 16091 SDs, 0 SdLazy, 8611 SolverSat, 318 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 300 GetRequests, 34 SyntacticMatches, 20 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 2.4s 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: 69.9s AutomataMinimizationTime, 26 MinimizatonAttempts, 218170 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1192 NumberOfCodeBlocks, 1192 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1099 ConstructedInterpolants, 0 QuantifiedInterpolants, 442051 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...